/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:39:07,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:39:07,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:39:07,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:39:07,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:39:07,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:39:07,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:39:07,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:39:07,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:39:07,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:39:07,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:39:07,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:39:07,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:39:07,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:39:07,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:39:07,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:39:07,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:39:07,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:39:07,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:39:07,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:39:07,258 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:39:07,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:39:07,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:39:07,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:39:07,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:39:07,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:39:07,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:39:07,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:39:07,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:39:07,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:39:07,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:39:07,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:39:07,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:39:07,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:39:07,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:39:07,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:39:07,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:39:07,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:39:07,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:39:07,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:39:07,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:39:07,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:39:07,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:39:07,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:39:07,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:39:07,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:39:07,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:39:07,312 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:39:07,313 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:39:07,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:39:07,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:39:07,313 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:39:07,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:39:07,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:39:07,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:39:07,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:39:07,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:39:07,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:39:07,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:39:07,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:39:07,314 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:39:07,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:39:07,314 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:39:07,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:39:07,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:39:07,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:39:07,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:39:07,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:39:07,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:39:07,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:39:07,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:39:07,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:39:07,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:39:07,315 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:39:07,315 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:39:07,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:39:07,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:39:07,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:39:07,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:39:07,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:39:07,509 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:39:07,510 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:39:07,511 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2022-04-27 10:39:07,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f057f3e0c/9aba43c2e6f94f87b14748720d40cee6/FLAG758f0431a [2022-04-27 10:39:07,924 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:39:07,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2022-04-27 10:39:07,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f057f3e0c/9aba43c2e6f94f87b14748720d40cee6/FLAG758f0431a [2022-04-27 10:39:07,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f057f3e0c/9aba43c2e6f94f87b14748720d40cee6 [2022-04-27 10:39:07,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:39:07,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:39:07,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:39:07,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:39:07,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:39:07,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:39:07" (1/1) ... [2022-04-27 10:39:07,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd43195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:07, skipping insertion in model container [2022-04-27 10:39:07,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:39:07" (1/1) ... [2022-04-27 10:39:07,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:39:07,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:39:08,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2022-04-27 10:39:08,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:39:08,056 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:39:08,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2022-04-27 10:39:08,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:39:08,104 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:39:08,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:08 WrapperNode [2022-04-27 10:39:08,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:39:08,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:39:08,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:39:08,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:39:08,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:08" (1/1) ... [2022-04-27 10:39:08,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:08" (1/1) ... [2022-04-27 10:39:08,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:08" (1/1) ... [2022-04-27 10:39:08,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:08" (1/1) ... [2022-04-27 10:39:08,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:08" (1/1) ... [2022-04-27 10:39:08,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:08" (1/1) ... [2022-04-27 10:39:08,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:08" (1/1) ... [2022-04-27 10:39:08,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:39:08,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:39:08,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:39:08,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:39:08,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:08" (1/1) ... [2022-04-27 10:39:08,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:39:08,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:39:08,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:39:08,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:39:08,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:39:08,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:39:08,180 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:39:08,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:39:08,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:39:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:39:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:39:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:39:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:39:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:39:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:39:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:39:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:39:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:39:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:39:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:39:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:39:08,218 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:39:08,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:39:08,293 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:39:08,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:39:08,297 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:39:08,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:39:08 BoogieIcfgContainer [2022-04-27 10:39:08,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:39:08,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:39:08,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:39:08,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:39:08,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:39:07" (1/3) ... [2022-04-27 10:39:08,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a354da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:39:08, skipping insertion in model container [2022-04-27 10:39:08,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:08" (2/3) ... [2022-04-27 10:39:08,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a354da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:39:08, skipping insertion in model container [2022-04-27 10:39:08,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:39:08" (3/3) ... [2022-04-27 10:39:08,314 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.c [2022-04-27 10:39:08,322 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:39:08,322 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:39:08,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:39:08,364 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@841020b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64ca26a9 [2022-04-27 10:39:08,364 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:39:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:39:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:39:08,379 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:08,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:08,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-27 10:39:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:08,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455334390] [2022-04-27 10:39:08,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:08,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 10:39:08,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:39:08,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-27 10:39:08,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:08,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 10:39:08,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:39:08,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-27 10:39:08,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-27 10:39:08,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-27 10:39:08,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-27 10:39:08,516 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {22#false} is VALID [2022-04-27 10:39:08,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-27 10:39:08,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-27 10:39:08,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-27 10:39:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:39:08,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:08,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455334390] [2022-04-27 10:39:08,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455334390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:39:08,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:39:08,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:39:08,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914001649] [2022-04-27 10:39:08,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:39:08,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:39:08,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:08,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:08,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:39:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:39:08,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:39:08,553 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:08,597 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 10:39:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:39:08,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:39:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 10:39:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 10:39:08,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-27 10:39:08,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:08,656 INFO L225 Difference]: With dead ends: 29 [2022-04-27 10:39:08,656 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 10:39:08,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:39:08,660 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:08,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:39:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 10:39:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 10:39:08,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:08,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,686 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,686 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:08,694 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 10:39:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:39:08,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:08,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:08,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 10:39:08,695 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 10:39:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:08,697 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 10:39:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:39:08,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:08,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:08,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:08,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 10:39:08,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 10:39:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:08,703 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 10:39:08,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:39:08,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:39:08,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:08,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:08,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:39:08,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:08,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-27 10:39:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:08,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449346248] [2022-04-27 10:39:08,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:08,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:08,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:08,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {110#true} is VALID [2022-04-27 10:39:08,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume true; {110#true} is VALID [2022-04-27 10:39:08,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} #34#return; {110#true} is VALID [2022-04-27 10:39:08,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} call ULTIMATE.init(); {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:08,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {110#true} is VALID [2022-04-27 10:39:08,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} assume true; {110#true} is VALID [2022-04-27 10:39:08,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110#true} {110#true} #34#return; {110#true} is VALID [2022-04-27 10:39:08,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#true} call #t~ret5 := main(); {110#true} is VALID [2022-04-27 10:39:08,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} ~x~0 := 0;~y~0 := 1; {115#(= main_~x~0 0)} is VALID [2022-04-27 10:39:08,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {111#false} is VALID [2022-04-27 10:39:08,812 INFO L272 TraceCheckUtils]: 7: Hoare triple {111#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {111#false} is VALID [2022-04-27 10:39:08,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#false} ~cond := #in~cond; {111#false} is VALID [2022-04-27 10:39:08,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {111#false} assume 0 == ~cond; {111#false} is VALID [2022-04-27 10:39:08,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#false} assume !false; {111#false} is VALID [2022-04-27 10:39:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:39:08,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:08,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449346248] [2022-04-27 10:39:08,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449346248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:39:08,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:39:08,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:39:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068974952] [2022-04-27 10:39:08,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:39:08,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:39:08,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:08,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:08,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:39:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:08,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:39:08,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:39:08,833 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:08,879 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:39:08,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:39:08,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:39:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 10:39:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 10:39:08,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-27 10:39:08,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:08,912 INFO L225 Difference]: With dead ends: 18 [2022-04-27 10:39:08,913 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 10:39:08,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:39:08,916 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:08,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:39:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 10:39:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 10:39:08,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:08,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,919 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,919 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:08,920 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:39:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:39:08,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:08,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:08,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 10:39:08,921 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 10:39:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:08,922 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:39:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:39:08,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:08,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:08,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:08,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 10:39:08,931 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 10:39:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:08,931 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 10:39:08,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:39:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:39:08,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:08,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:08,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:39:08,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:08,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:08,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-27 10:39:08,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:08,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64752908] [2022-04-27 10:39:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:08,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:08,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:09,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:39:09,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:39:09,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:39:09,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:09,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:39:09,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:39:09,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:39:09,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:39:09,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 0;~y~0 := 1; {201#(= main_~x~0 0)} is VALID [2022-04-27 10:39:09,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {202#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:39:09,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {197#false} is VALID [2022-04-27 10:39:09,035 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {197#false} is VALID [2022-04-27 10:39:09,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 10:39:09,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:39:09,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:39:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:39:09,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:09,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64752908] [2022-04-27 10:39:09,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64752908] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:39:09,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869754799] [2022-04-27 10:39:09,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:09,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:39:09,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:39:09,048 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:39:09,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:39:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:09,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:39:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:09,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:39:09,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 10:39:09,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:39:09,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:39:09,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:39:09,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:39:09,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 0;~y~0 := 1; {201#(= main_~x~0 0)} is VALID [2022-04-27 10:39:09,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {225#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 10:39:09,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {225#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 6); {197#false} is VALID [2022-04-27 10:39:09,180 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {197#false} is VALID [2022-04-27 10:39:09,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 10:39:09,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:39:09,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:39:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:39:09,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:39:09,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:39:09,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:39:09,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 10:39:09,259 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {197#false} is VALID [2022-04-27 10:39:09,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(< (mod main_~x~0 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {197#false} is VALID [2022-04-27 10:39:09,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#(< (mod (+ main_~x~0 1) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {253#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-27 10:39:09,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 0;~y~0 := 1; {257#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-27 10:39:09,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:39:09,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:39:09,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:39:09,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:39:09,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 10:39:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:39:09,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869754799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:39:09,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:39:09,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:39:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158225131] [2022-04-27 10:39:09,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:39:09,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:39:09,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:09,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:09,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:09,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:39:09,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:09,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:39:09,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:39:09,282 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:11,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:39:13,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:39:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:13,717 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 10:39:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:39:13,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:39:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-27 10:39:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-27 10:39:13,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2022-04-27 10:39:13,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:13,743 INFO L225 Difference]: With dead ends: 21 [2022-04-27 10:39:13,743 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 10:39:13,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:39:13,745 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:13,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-04-27 10:39:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 10:39:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 10:39:13,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:13,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:13,750 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:13,750 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:13,751 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:39:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:39:13,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:13,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:13,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 10:39:13,752 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 10:39:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:13,752 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:39:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:39:13,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:13,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:13,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:13,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-27 10:39:13,758 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-27 10:39:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:13,758 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-27 10:39:13,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:39:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:39:13,759 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:13,759 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:13,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:39:13,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:39:13,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:13,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:13,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 2 times [2022-04-27 10:39:13,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:13,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215677403] [2022-04-27 10:39:13,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:13,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:14,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-27 10:39:14,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-27 10:39:14,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} #34#return; {379#true} is VALID [2022-04-27 10:39:14,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:14,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-27 10:39:14,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-27 10:39:14,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #34#return; {379#true} is VALID [2022-04-27 10:39:14,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret5 := main(); {379#true} is VALID [2022-04-27 10:39:14,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} ~x~0 := 0;~y~0 := 1; {384#(= main_~x~0 0)} is VALID [2022-04-27 10:39:14,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {385#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:39:14,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {386#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:39:14,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {387#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:39:14,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {388#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:39:14,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {388#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {380#false} is VALID [2022-04-27 10:39:14,170 INFO L272 TraceCheckUtils]: 11: Hoare triple {380#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {380#false} is VALID [2022-04-27 10:39:14,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2022-04-27 10:39:14,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {380#false} assume 0 == ~cond; {380#false} is VALID [2022-04-27 10:39:14,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-27 10:39:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:39:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:14,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215677403] [2022-04-27 10:39:14,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215677403] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:39:14,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934192133] [2022-04-27 10:39:14,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:39:14,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:39:14,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:39:14,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:39:14,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:39:14,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:39:14,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:39:14,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 10:39:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:14,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:39:14,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {379#true} is VALID [2022-04-27 10:39:14,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-27 10:39:14,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-27 10:39:14,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #34#return; {379#true} is VALID [2022-04-27 10:39:14,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret5 := main(); {379#true} is VALID [2022-04-27 10:39:14,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} ~x~0 := 0;~y~0 := 1; {384#(= main_~x~0 0)} is VALID [2022-04-27 10:39:14,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {385#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:39:14,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {386#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:39:14,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {387#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:39:14,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {420#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:39:14,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {380#false} is VALID [2022-04-27 10:39:14,466 INFO L272 TraceCheckUtils]: 11: Hoare triple {380#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {380#false} is VALID [2022-04-27 10:39:14,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2022-04-27 10:39:14,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {380#false} assume 0 == ~cond; {380#false} is VALID [2022-04-27 10:39:14,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-27 10:39:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:39:14,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:39:14,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-27 10:39:14,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {380#false} assume 0 == ~cond; {380#false} is VALID [2022-04-27 10:39:14,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2022-04-27 10:39:14,586 INFO L272 TraceCheckUtils]: 11: Hoare triple {380#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {380#false} is VALID [2022-04-27 10:39:14,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {448#(< (mod main_~x~0 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {380#false} is VALID [2022-04-27 10:39:14,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#(< (mod (+ main_~x~0 1) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {448#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-27 10:39:14,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(< (mod (+ main_~x~0 2) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {452#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-27 10:39:14,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#(< (mod (+ main_~x~0 3) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {456#(< (mod (+ main_~x~0 2) 4294967296) 6)} is VALID [2022-04-27 10:39:14,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(< (mod (+ main_~x~0 4) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {460#(< (mod (+ main_~x~0 3) 4294967296) 6)} is VALID [2022-04-27 10:39:14,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} ~x~0 := 0;~y~0 := 1; {464#(< (mod (+ main_~x~0 4) 4294967296) 6)} is VALID [2022-04-27 10:39:14,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret5 := main(); {379#true} is VALID [2022-04-27 10:39:14,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #34#return; {379#true} is VALID [2022-04-27 10:39:14,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-27 10:39:14,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-27 10:39:14,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {379#true} is VALID [2022-04-27 10:39:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:39:14,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934192133] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:39:14,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:39:14,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:39:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460897538] [2022-04-27 10:39:14,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:39:14,595 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:39:14,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:14,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:14,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:14,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:39:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:14,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:39:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:39:14,614 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:14,863 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-27 10:39:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:39:14,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:39:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-27 10:39:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-27 10:39:14,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 24 transitions. [2022-04-27 10:39:14,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:14,885 INFO L225 Difference]: With dead ends: 23 [2022-04-27 10:39:14,885 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 10:39:14,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:39:14,886 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:14,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:39:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 10:39:14,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 10:39:14,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:14,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:14,901 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:14,901 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:14,902 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:39:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 10:39:14,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:14,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:14,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 10:39:14,903 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 10:39:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:14,904 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:39:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 10:39:14,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:14,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:14,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:14,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-27 10:39:14,905 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-04-27 10:39:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:14,905 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-27 10:39:14,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 10:39:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:39:14,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:14,907 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:14,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 10:39:15,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:39:15,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:15,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:15,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 3 times [2022-04-27 10:39:15,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:15,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457388052] [2022-04-27 10:39:15,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:15,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:15,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:15,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {602#true} is VALID [2022-04-27 10:39:15,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {602#true} assume true; {602#true} is VALID [2022-04-27 10:39:15,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {602#true} {602#true} #34#return; {602#true} is VALID [2022-04-27 10:39:15,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {602#true} call ULTIMATE.init(); {616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:15,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {602#true} is VALID [2022-04-27 10:39:15,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {602#true} assume true; {602#true} is VALID [2022-04-27 10:39:15,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {602#true} {602#true} #34#return; {602#true} is VALID [2022-04-27 10:39:15,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {602#true} call #t~ret5 := main(); {602#true} is VALID [2022-04-27 10:39:15,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {602#true} ~x~0 := 0;~y~0 := 1; {607#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 10:39:15,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {607#(= (+ (- 1) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {608#(<= (* (div (+ (* 44739243 main_~y~0) 178956969) 134217728) 134217728) (+ (* 44739243 main_~y~0) 44739242))} is VALID [2022-04-27 10:39:15,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(<= (* (div (+ (* 44739243 main_~y~0) 178956969) 134217728) 134217728) (+ (* 44739243 main_~y~0) 44739242))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {609#(<= (+ (* 89478485 main_~y~0) (* (div (+ (* (- 89478485) main_~y~0) 357913939) 268435456) 268435456)) 89478484)} is VALID [2022-04-27 10:39:16,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#(<= (+ (* 89478485 main_~y~0) (* (div (+ (* (- 89478485) main_~y~0) 357913939) 268435456) 268435456)) 89478484)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {610#(<= (* (div (+ 715827879 (* main_~y~0 178956971)) 536870912) 536870912) (+ (* main_~y~0 178956971) 178956968))} is VALID [2022-04-27 10:39:18,637 WARN L290 TraceCheckUtils]: 9: Hoare triple {610#(<= (* (div (+ 715827879 (* main_~y~0 178956971)) 536870912) 536870912) (+ (* main_~y~0 178956971) 178956968))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {611#(<= (+ (* 1073741824 (div (+ (* main_~y~0 (- 357913941)) 1431655759) 1073741824)) (* main_~y~0 357913941)) 357913936)} is UNKNOWN [2022-04-27 10:39:18,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {611#(<= (+ (* 1073741824 (div (+ (* main_~y~0 (- 357913941)) 1431655759) 1073741824)) (* main_~y~0 357913941)) 357913936)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {612#(<= (* (div (+ 2863311519 (* 715827883 main_~y~0)) 2147483648) 2147483648) (+ (* 715827883 main_~y~0) 715827872))} is VALID [2022-04-27 10:39:20,834 WARN L290 TraceCheckUtils]: 11: Hoare triple {612#(<= (* (div (+ 2863311519 (* 715827883 main_~y~0)) 2147483648) 2147483648) (+ (* 715827883 main_~y~0) 715827872))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {613#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} is UNKNOWN [2022-04-27 10:39:20,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {613#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} assume !(~x~0 % 4294967296 < 6); {613#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} is VALID [2022-04-27 10:39:20,838 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {614#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:39:20,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {614#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {615#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:39:20,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {615#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {603#false} is VALID [2022-04-27 10:39:20,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {603#false} assume !false; {603#false} is VALID [2022-04-27 10:39:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:39:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:20,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457388052] [2022-04-27 10:39:20,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457388052] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:39:20,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534737919] [2022-04-27 10:39:20,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:39:20,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:39:20,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:39:20,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:39:20,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process