/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-industry-pattern/mod3.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:56:12,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:56:12,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:56:12,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:56:12,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:56:12,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:56:12,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:56:12,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:56:12,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:56:12,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:56:12,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:56:12,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:56:12,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:56:12,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:56:12,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:56:12,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:56:12,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:56:12,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:56:12,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:56:12,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:56:12,224 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:56:12,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:56:12,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:56:12,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:56:12,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:56:12,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:56:12,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:56:12,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:56:12,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:56:12,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:56:12,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:56:12,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:56:12,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:56:12,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:56:12,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:56:12,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:56:12,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:56:12,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:56:12,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:56:12,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:56:12,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:56:12,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:56:12,244 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:56:12,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:56:12,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:56:12,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:56:12,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:56:12,273 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:56:12,273 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:56:12,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:56:12,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:56:12,274 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:56:12,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:56:12,275 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:56:12,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:56:12,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:56:12,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:56:12,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:56:12,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:56:12,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:56:12,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:56:12,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:56:12,277 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:56:12,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:56:12,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:56:12,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:56:12,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:56:12,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:56:12,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:56:12,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:56:12,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:56:12,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:56:12,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:56:12,279 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:56:12,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:56:12,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:56:12,279 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:56:12,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:56:12,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:56:12,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:56:12,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:56:12,498 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:56:12,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+cfa-reducer.c [2022-04-27 10:56:12,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1172daf47/9558976f82404be38a48685026cedb30/FLAGe13d0dc12 [2022-04-27 10:56:12,866 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:56:12,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+cfa-reducer.c [2022-04-27 10:56:12,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1172daf47/9558976f82404be38a48685026cedb30/FLAGe13d0dc12 [2022-04-27 10:56:13,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1172daf47/9558976f82404be38a48685026cedb30 [2022-04-27 10:56:13,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:56:13,297 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:56:13,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:56:13,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:56:13,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:56:13,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:56:13" (1/1) ... [2022-04-27 10:56:13,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d97b8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:56:13, skipping insertion in model container [2022-04-27 10:56:13,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:56:13" (1/1) ... [2022-04-27 10:56:13,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:56:13,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:56:13,552 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-industry-pattern/mod3.c.v+cfa-reducer.c[1250,1263] [2022-04-27 10:56:13,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:56:13,562 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:56:13,590 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-industry-pattern/mod3.c.v+cfa-reducer.c[1250,1263] [2022-04-27 10:56:13,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:56:13,609 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:56:13,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:56:13 WrapperNode [2022-04-27 10:56:13,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:56:13,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:56:13,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:56:13,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:56:13,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:56:13" (1/1) ... [2022-04-27 10:56:13,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:56:13" (1/1) ... [2022-04-27 10:56:13,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:56:13" (1/1) ... [2022-04-27 10:56:13,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:56:13" (1/1) ... [2022-04-27 10:56:13,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:56:13" (1/1) ... [2022-04-27 10:56:13,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:56:13" (1/1) ... [2022-04-27 10:56:13,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:56:13" (1/1) ... [2022-04-27 10:56:13,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:56:13,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:56:13,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:56:13,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:56:13,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:56:13" (1/1) ... [2022-04-27 10:56:13,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:56:13,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:56:13,680 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:56:13,686 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:56:13,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:56:13,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:56:13,730 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:56:13,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:56:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:56:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:56:13,733 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:56:13,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:56:13,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:56:13,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:56:13,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:56:13,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:56:13,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:56:13,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:56:13,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:56:13,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:56:13,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:56:13,795 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:56:13,796 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:56:18,276 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:56:18,281 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:56:18,282 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 10:56:18,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:56:18 BoogieIcfgContainer [2022-04-27 10:56:18,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:56:18,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:56:18,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:56:18,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:56:18,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:56:13" (1/3) ... [2022-04-27 10:56:18,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a238d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:56:18, skipping insertion in model container [2022-04-27 10:56:18,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:56:13" (2/3) ... [2022-04-27 10:56:18,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a238d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:56:18, skipping insertion in model container [2022-04-27 10:56:18,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:56:18" (3/3) ... [2022-04-27 10:56:18,292 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+cfa-reducer.c [2022-04-27 10:56:18,306 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:56:18,307 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:56:18,348 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:56:18,353 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@7b3ef7c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17c85384 [2022-04-27 10:56:18,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:56:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:56:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:56:18,371 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:56:18,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:56:18,372 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:56:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:56:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1410293457, now seen corresponding path program 1 times [2022-04-27 10:56:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:56:18,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384207262] [2022-04-27 10:56:18,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:56:18,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:56:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:56:18,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:56:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:56:18,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_107~0 := 0; {22#true} is VALID [2022-04-27 10:56:18,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-27 10:56:18,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #43#return; {22#true} is VALID [2022-04-27 10:56:18,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:56:18,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_107~0 := 0; {22#true} is VALID [2022-04-27 10:56:18,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-27 10:56:18,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #43#return; {22#true} is VALID [2022-04-27 10:56:18,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret7 := main(); {22#true} is VALID [2022-04-27 10:56:18,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {27#(= (+ (- 1) main_~main__y~0) 0)} is VALID [2022-04-27 10:56:18,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#(= (+ (- 1) main_~main__y~0) 0)} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {27#(= (+ (- 1) main_~main__y~0) 0)} is VALID [2022-04-27 10:56:18,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#(= (+ (- 1) main_~main__y~0) 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0); {27#(= (+ (- 1) main_~main__y~0) 0)} is VALID [2022-04-27 10:56:18,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#(= (+ (- 1) main_~main__y~0) 0)} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {23#false} is VALID [2022-04-27 10:56:18,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~__VERIFIER_assert__cond~0; {23#false} is VALID [2022-04-27 10:56:18,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-27 10:56:18,588 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:56:18,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:56:18,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384207262] [2022-04-27 10:56:18,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384207262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:56:18,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:56:18,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:56:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953092389] [2022-04-27 10:56:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:56:18,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:56:18,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:56:18,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:56:18,618 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:56:18,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:56:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:56:18,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:56:18,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:56:18,638 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:56:22,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:56:27,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:56:29,468 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:56:31,667 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:56:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:56:31,893 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-27 10:56:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:56:31,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:56:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:56:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:56:31,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-27 10:56:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:56:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-27 10:56:31,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-27 10:56:31,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:56:31,978 INFO L225 Difference]: With dead ends: 36 [2022-04-27 10:56:31,978 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 10:56:31,981 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:56:31,987 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:56:31,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 31 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 8.1s Time] [2022-04-27 10:56:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 10:56:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-04-27 10:56:32,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:56:32,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:56:32,026 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:56:32,026 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:56:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:56:32,030 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-04-27 10:56:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-04-27 10:56:32,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:56:32,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:56:32,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-27 10:56:32,032 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-27 10:56:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:56:32,034 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-04-27 10:56:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-04-27 10:56:32,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:56:32,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:56:32,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:56:32,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:56:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:56:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-27 10:56:32,038 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2022-04-27 10:56:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:56:32,038 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-27 10:56:32,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:56:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 10:56:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:56:32,039 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:56:32,039 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:56:32,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:56:32,040 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:56:32,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:56:32,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1346650520, now seen corresponding path program 1 times [2022-04-27 10:56:32,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:56:32,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321368655] [2022-04-27 10:56:32,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:56:32,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:56:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:56:32,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:56:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:56:32,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_107~0 := 0; {138#true} is VALID [2022-04-27 10:56:32,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#true} assume true; {138#true} is VALID [2022-04-27 10:56:32,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} #43#return; {138#true} is VALID [2022-04-27 10:56:32,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {138#true} call ULTIMATE.init(); {146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:56:32,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_107~0 := 0; {138#true} is VALID [2022-04-27 10:56:32,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#true} assume true; {138#true} is VALID [2022-04-27 10:56:32,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138#true} {138#true} #43#return; {138#true} is VALID [2022-04-27 10:56:32,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {138#true} call #t~ret7 := main(); {138#true} is VALID [2022-04-27 10:56:32,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:56:32,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:56:32,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume !(0 == ~main____CPAchecker_TMP_0~0); {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:56:34,627 WARN L290 TraceCheckUtils]: 8: Hoare triple {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume 1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 2 + ~main__x~0;~main__y~0 := 0; {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 10:56:34,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:56:34,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~0); {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:56:34,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {145#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 10:56:34,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {145#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {139#false} is VALID [2022-04-27 10:56:34,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {139#false} assume !false; {139#false} is VALID [2022-04-27 10:56:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:56:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:56:34,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321368655] [2022-04-27 10:56:34,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321368655] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:56:34,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336862348] [2022-04-27 10:56:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:56:34,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:56:34,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:56:34,644 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:56:34,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process