/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:51:25,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:51:25,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:51:25,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:51:25,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:51:25,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:51:25,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:51:25,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:51:25,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:51:25,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:51:25,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:51:25,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:51:25,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:51:25,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:51:25,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:51:25,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:51:25,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:51:25,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:51:25,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:51:25,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:51:25,298 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:51:25,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:51:25,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:51:25,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:51:25,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:51:25,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:51:25,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:51:25,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:51:25,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:51:25,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:51:25,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:51:25,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:51:25,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:51:25,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:51:25,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:51:25,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:51:25,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:51:25,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:51:25,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:51:25,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:51:25,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:51:25,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:51:25,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:51:25,324 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:51:25,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:51:25,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:51:25,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:51:25,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:51:25,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:51:25,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:51:25,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:51:25,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:51:25,327 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:51:25,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:51:25,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:51:25,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:51:25,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:51:25,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:51:25,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:51:25,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:51:25,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:51:25,327 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:51:25,328 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:51:25,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:51:25,328 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:51:25,328 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 09:51:25,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:51:25,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:51:25,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:51:25,504 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:51:25,504 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:51:25,505 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+lhb-reducer.c [2022-04-08 09:51:25,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68507e2e/4c784b74f282482596dca1d6b7d4d95f/FLAG40d40bbe4 [2022-04-08 09:51:25,850 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:51:25,850 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-04-08 09:51:25,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68507e2e/4c784b74f282482596dca1d6b7d4d95f/FLAG40d40bbe4 [2022-04-08 09:51:26,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68507e2e/4c784b74f282482596dca1d6b7d4d95f [2022-04-08 09:51:26,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:51:26,274 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:51:26,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:51:26,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:51:26,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:51:26,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:51:26" (1/1) ... [2022-04-08 09:51:26,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ecb8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:26, skipping insertion in model container [2022-04-08 09:51:26,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:51:26" (1/1) ... [2022-04-08 09:51:26,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:51:26,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:51:26,419 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+lhb-reducer.c[2265,2278] [2022-04-08 09:51:26,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:51:26,430 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:51:26,451 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+lhb-reducer.c[2265,2278] [2022-04-08 09:51:26,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:51:26,462 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:51:26,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:26 WrapperNode [2022-04-08 09:51:26,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:51:26,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:51:26,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:51:26,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:51:26,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:26" (1/1) ... [2022-04-08 09:51:26,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:26" (1/1) ... [2022-04-08 09:51:26,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:26" (1/1) ... [2022-04-08 09:51:26,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:26" (1/1) ... [2022-04-08 09:51:26,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:26" (1/1) ... [2022-04-08 09:51:26,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:26" (1/1) ... [2022-04-08 09:51:26,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:26" (1/1) ... [2022-04-08 09:51:26,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:51:26,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:51:26,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:51:26,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:51:26,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:26" (1/1) ... [2022-04-08 09:51:26,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:51:26,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:51:26,519 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-08 09:51:26,520 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-08 09:51:26,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:51:26,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:51:26,551 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:51:26,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:51:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:51:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:51:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:51:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:51:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:51:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:51:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:51:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:51:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:51:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:51:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:51:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:51:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:51:26,607 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:51:26,608 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:51:35,450 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:51:35,454 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:51:35,455 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-08 09:51:35,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:51:35 BoogieIcfgContainer [2022-04-08 09:51:35,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:51:35,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:51:35,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:51:35,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:51:35,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:51:26" (1/3) ... [2022-04-08 09:51:35,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a3a01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:51:35, skipping insertion in model container [2022-04-08 09:51:35,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:26" (2/3) ... [2022-04-08 09:51:35,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a3a01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:51:35, skipping insertion in model container [2022-04-08 09:51:35,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:51:35" (3/3) ... [2022-04-08 09:51:35,465 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+lhb-reducer.c [2022-04-08 09:51:35,468 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:51:35,468 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:51:35,506 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:51:35,512 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-08 09:51:35,512 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:51:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 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-08 09:51:35,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:51:35,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:51:35,537 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:51:35,538 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:51:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:51:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1261463571, now seen corresponding path program 1 times [2022-04-08 09:51:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:51:35,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1568242159] [2022-04-08 09:51:35,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:51:35,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1261463571, now seen corresponding path program 2 times [2022-04-08 09:51:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:51:35,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355568155] [2022-04-08 09:51:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:51:35,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:51:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:51:36,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:51:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:51:36,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {31#true} is VALID [2022-04-08 09:51:36,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 09:51:36,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-08 09:51:36,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:51:36,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {31#true} is VALID [2022-04-08 09:51:36,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 09:51:36,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-08 09:51:36,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2022-04-08 09:51:36,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {36#(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-08 09:51:36,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(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; {36#(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-08 09:51:36,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(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); {36#(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-08 09:51:38,187 WARN L290 TraceCheckUtils]: 8: Hoare triple {36#(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;~__tmp_112_0~0 := ~main____CPAchecker_TMP_0~0; {37#(<= 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-08 09:51:38,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(<= 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)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_112_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~0; {37#(<= 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-08 09:51:38,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= 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)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {37#(<= 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-08 09:51:38,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= 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~1); {37#(<= 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-08 09:51:38,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= 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; {38#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-08 09:51:38,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {32#false} is VALID [2022-04-08 09:51:38,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 09:51:38,198 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-08 09:51:38,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:51:38,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355568155] [2022-04-08 09:51:38,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355568155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:51:38,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:51:38,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:51:38,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:51:38,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1568242159] [2022-04-08 09:51:38,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1568242159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:51:38,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:51:38,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:51:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170133969] [2022-04-08 09:51:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:51:38,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2022-04-08 09:51:38,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:51:38,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 09:51:40,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 09:51:40,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:51:40,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:51:40,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:51:40,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:51:40,425 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 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 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 09:51:42,631 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-08 09:51:46,999 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-08 09:51:49,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:51:55,899 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-08 09:51:58,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:52:00,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:52:02,271 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-08 09:52:04,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:52:06,604 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-08 09:52:08,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:52:10,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:52:17,268 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-08 09:52:19,446 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-08 09:52:23,977 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-08 09:52:26,159 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-08 09:52:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:26,358 INFO L93 Difference]: Finished difference Result 85 states and 119 transitions. [2022-04-08 09:52:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:52:26,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2022-04-08 09:52:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:52:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 09:52:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-08 09:52:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 09:52:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-08 09:52:26,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 119 transitions. [2022-04-08 09:52:30,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 117 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 09:52:30,852 INFO L225 Difference]: With dead ends: 85 [2022-04-08 09:52:30,853 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 09:52:30,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:52:30,856 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.8s IncrementalHoareTripleChecker+Time [2022-04-08 09:52:30,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 106 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 15 Unknown, 0 Unchecked, 31.8s Time] [2022-04-08 09:52:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 09:52:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2022-04-08 09:52:30,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:52:30,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-08 09:52:30,886 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-08 09:52:30,886 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-08 09:52:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:30,890 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-08 09:52:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-08 09:52:30,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:52:30,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:52:30,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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 45 states. [2022-04-08 09:52:30,891 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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 45 states. [2022-04-08 09:52:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:30,894 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-08 09:52:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-08 09:52:30,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:52:30,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:52:30,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:52:30,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:52:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-08 09:52:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-08 09:52:30,897 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-04-08 09:52:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:52:30,898 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-08 09:52:30,898 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 09:52:30,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 39 transitions. [2022-04-08 09:52:33,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 09:52:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-08 09:52:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:52:33,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:52:33,108 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:52:33,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:52:33,108 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:52:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:52:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash 489359351, now seen corresponding path program 1 times [2022-04-08 09:52:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:52:33,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2067722697] [2022-04-08 09:52:33,110 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:52:33,110 INFO L85 PathProgramCache]: Analyzing trace with hash 489359351, now seen corresponding path program 2 times [2022-04-08 09:52:33,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:52:33,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318813415] [2022-04-08 09:52:33,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:52:33,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:52:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:52:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:52:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:52:33,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {380#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {372#true} is VALID [2022-04-08 09:52:33,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {372#true} assume true; {372#true} is VALID [2022-04-08 09:52:33,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {372#true} {372#true} #72#return; {372#true} is VALID [2022-04-08 09:52:33,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {372#true} call ULTIMATE.init(); {380#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:52:33,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {380#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {372#true} is VALID [2022-04-08 09:52:33,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {372#true} assume true; {372#true} is VALID [2022-04-08 09:52:33,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {372#true} {372#true} #72#return; {372#true} is VALID [2022-04-08 09:52:33,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {372#true} call #t~ret9 := main(); {372#true} is VALID [2022-04-08 09:52:33,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {372#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {377#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (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))))))} is VALID [2022-04-08 09:52:33,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (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))))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {377#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (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))))))} is VALID [2022-04-08 09:52:33,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (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))))))} assume !(0 == ~main____CPAchecker_TMP_0~0); {377#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (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))))))} is VALID [2022-04-08 09:52:33,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (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))))))} 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); {377#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (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))))))} is VALID [2022-04-08 09:52:35,560 WARN L290 TraceCheckUtils]: 9: Hoare triple {377#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (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))))))} assume 2 == (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 := 1 + ~main__x~0;~main__y~0 := 0;~__tmp_93_0~0 := ~main____CPAchecker_TMP_0~0; {378#(<= 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-08 09:52:35,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {378#(<= 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)))} ~main____CPAchecker_TMP_0~1 := ~__tmp_93_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~1; {378#(<= 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-08 09:52:35,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {378#(<= 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)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {378#(<= 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-08 09:52:35,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {378#(<= 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~1); {378#(<= 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-08 09:52:35,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {378#(<= 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; {379#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-08 09:52:35,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {379#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {373#false} is VALID [2022-04-08 09:52:35,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {373#false} assume !false; {373#false} is VALID [2022-04-08 09:52:35,568 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-08 09:52:35,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:52:35,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318813415] [2022-04-08 09:52:35,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318813415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:52:35,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:52:35,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:52:35,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:52:35,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2067722697] [2022-04-08 09:52:35,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2067722697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:52:35,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:52:35,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:52:35,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318103076] [2022-04-08 09:52:35,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:52:35,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2022-04-08 09:52:35,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:52:35,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-08 09:52:37,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 09:52:37,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:52:37,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:52:37,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:52:37,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:52:37,723 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-08 09:52:39,902 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-08 09:52:44,282 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-08 09:52:46,455 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:52:48,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-08 09:52:51,041 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-08 09:52:57,578 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-08 09:52:59,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:53:01,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:53:06,333 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-08 09:53:10,692 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-08 09:53:15,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:53:17,188 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-08 09:53:23,694 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-08 09:53:28,041 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-08 09:53:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:34,743 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2022-04-08 09:53:34,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:53:34,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2022-04-08 09:53:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:53:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-08 09:53:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-08 09:53:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-08 09:53:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-08 09:53:34,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-08 09:53:36,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:36,961 INFO L225 Difference]: With dead ends: 60 [2022-04-08 09:53:36,961 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 09:53:36,962 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:53:36,962 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:53:36,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 13 Unknown, 0 Unchecked, 29.5s Time] [2022-04-08 09:53:36,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 09:53:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-08 09:53:36,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:53:36,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:53:36,994 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:53:36,995 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:53:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:36,996 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 09:53:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-08 09:53:36,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:53:36,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:53:36,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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 40 states. [2022-04-08 09:53:36,997 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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 40 states. [2022-04-08 09:53:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:36,998 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 09:53:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-08 09:53:36,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:53:36,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:53:36,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:53:36,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:53:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:53:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-08 09:53:37,008 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-04-08 09:53:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:53:37,008 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-08 09:53:37,009 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-08 09:53:37,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-08 09:53:41,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 40 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-08 09:53:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 09:53:41,332 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:53:41,332 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:53:41,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:53:41,333 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:53:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:53:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash 7180197, now seen corresponding path program 1 times [2022-04-08 09:53:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:53:41,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [776656943] [2022-04-08 09:53:41,334 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:53:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash 7180197, now seen corresponding path program 2 times [2022-04-08 09:53:41,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:53:41,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613641987] [2022-04-08 09:53:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:53:41,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:53:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:53:41,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:53:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:53:41,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {662#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {655#true} is VALID [2022-04-08 09:53:41,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#true} assume true; {655#true} is VALID [2022-04-08 09:53:41,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {655#true} {655#true} #72#return; {655#true} is VALID [2022-04-08 09:53:41,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {662#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:53:41,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {662#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {655#true} is VALID [2022-04-08 09:53:41,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {655#true} assume true; {655#true} is VALID [2022-04-08 09:53:41,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {655#true} {655#true} #72#return; {655#true} is VALID [2022-04-08 09:53:41,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {655#true} call #t~ret9 := main(); {655#true} is VALID [2022-04-08 09:53:41,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {655#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {655#true} is VALID [2022-04-08 09:53:41,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {655#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {655#true} is VALID [2022-04-08 09:53:41,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {655#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {655#true} is VALID [2022-04-08 09:53:41,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {655#true} 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); {655#true} is VALID [2022-04-08 09:53:41,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {655#true} assume !(2 == (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);havoc ~main____CPAchecker_TMP_1~1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~1 := #t~nondet8;havoc #t~nondet8; {655#true} is VALID [2022-04-08 09:53:41,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {655#true} assume !(0 == ~main____CPAchecker_TMP_1~1);~main__x~0 := 4 + ~main__x~0;~main__y~0 := 1;~__tmp_88_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_88_1~0 := ~main____CPAchecker_TMP_1~1; {655#true} is VALID [2022-04-08 09:53:41,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {655#true} ~main____CPAchecker_TMP_0~1 := ~__tmp_88_0~0;~main____CPAchecker_TMP_1~0 := ~__tmp_88_1~0; {655#true} is VALID [2022-04-08 09:53:41,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {655#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {655#true} is VALID [2022-04-08 09:53:41,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {655#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {655#true} is VALID [2022-04-08 09:53:43,659 WARN L290 TraceCheckUtils]: 14: Hoare triple {655#true} 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;~__tmp_112_0~0 := ~main____CPAchecker_TMP_0~0; {660#(<= 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-08 09:53:43,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {660#(<= 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)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_112_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~0; {660#(<= 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-08 09:53:43,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {660#(<= 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)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {660#(<= 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-08 09:53:43,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {660#(<= 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~1); {660#(<= 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-08 09:53:43,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {660#(<= 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; {661#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-08 09:53:43,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {661#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {656#false} is VALID [2022-04-08 09:53:43,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#false} assume !false; {656#false} is VALID [2022-04-08 09:53:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 09:53:43,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:53:43,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613641987] [2022-04-08 09:53:43,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613641987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:53:43,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:53:43,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:53:43,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:53:43,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [776656943] [2022-04-08 09:53:43,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [776656943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:53:43,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:53:43,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:53:43,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258268919] [2022-04-08 09:53:43,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:53:43,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 21 [2022-04-08 09:53:43,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:53:43,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:53:45,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:45,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:53:45,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:53:45,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:53:45,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:53:45,869 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:53:50,100 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-08 09:53:52,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:53:56,614 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-08 09:53:58,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:54:00,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:54:03,145 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-08 09:54:05,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:54:09,736 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-08 09:54:14,104 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-08 09:54:16,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:54:20,614 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-08 09:54:24,987 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-08 09:54:27,165 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:54:33,666 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-08 09:54:38,008 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-08 09:54:40,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:54:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:54:42,507 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-08 09:54:42,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:54:42,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 21 [2022-04-08 09:54:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:54:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:54:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-08 09:54:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:54:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-08 09:54:42,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-08 09:54:46,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 72 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 09:54:46,922 INFO L225 Difference]: With dead ends: 65 [2022-04-08 09:54:46,922 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 09:54:46,922 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:54:46,923 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:54:46,923 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 16 Unknown, 0 Unchecked, 33.5s Time] [2022-04-08 09:54:46,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 09:54:46,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-04-08 09:54:46,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:54:46,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:54:46,940 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:54:46,940 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:54:46,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:54:46,941 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-08 09:54:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-08 09:54:46,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:54:46,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:54:46,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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 45 states. [2022-04-08 09:54:46,942 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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 45 states. [2022-04-08 09:54:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:54:46,943 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-08 09:54:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-08 09:54:46,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:54:46,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:54:46,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:54:46,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:54:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:54:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-08 09:54:46,945 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-08 09:54:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:54:46,945 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-08 09:54:46,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:54:46,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-08 09:54:53,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 39 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 09:54:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-08 09:54:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:54:53,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:54:53,476 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:54:53,476 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 09:54:53,476 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:54:53,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:54:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash 261280421, now seen corresponding path program 1 times [2022-04-08 09:54:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:54:53,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1962645234] [2022-04-08 09:54:53,477 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:54:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash 261280421, now seen corresponding path program 2 times [2022-04-08 09:54:53,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:54:53,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029258637] [2022-04-08 09:54:53,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:54:53,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:54:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:54:53,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:54:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:54:53,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {962#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {955#true} is VALID [2022-04-08 09:54:53,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {955#true} assume true; {955#true} is VALID [2022-04-08 09:54:53,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {955#true} {955#true} #72#return; {955#true} is VALID [2022-04-08 09:54:53,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {962#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:54:53,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {962#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {955#true} is VALID [2022-04-08 09:54:53,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2022-04-08 09:54:53,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {955#true} {955#true} #72#return; {955#true} is VALID [2022-04-08 09:54:53,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {955#true} call #t~ret9 := main(); {955#true} is VALID [2022-04-08 09:54:53,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {955#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {955#true} is VALID [2022-04-08 09:54:53,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {955#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {955#true} is VALID [2022-04-08 09:54:53,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {955#true} is VALID [2022-04-08 09:54:53,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {955#true} 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); {955#true} is VALID [2022-04-08 09:54:53,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {955#true} assume !(2 == (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);havoc ~main____CPAchecker_TMP_1~1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~1 := #t~nondet8;havoc #t~nondet8; {955#true} is VALID [2022-04-08 09:54:53,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {955#true} assume !(0 == ~main____CPAchecker_TMP_1~1);~main__x~0 := 4 + ~main__x~0;~main__y~0 := 1;~__tmp_88_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_88_1~0 := ~main____CPAchecker_TMP_1~1; {955#true} is VALID [2022-04-08 09:54:53,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {955#true} ~main____CPAchecker_TMP_0~1 := ~__tmp_88_0~0;~main____CPAchecker_TMP_1~0 := ~__tmp_88_1~0; {955#true} is VALID [2022-04-08 09:54:53,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {955#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {955#true} is VALID [2022-04-08 09:54:53,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {955#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {955#true} is VALID [2022-04-08 09:54:53,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {955#true} 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); {955#true} is VALID [2022-04-08 09:54:55,843 WARN L290 TraceCheckUtils]: 15: Hoare triple {955#true} assume 2 == (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 := 1 + ~main__x~0;~main__y~0 := 0;~__tmp_93_0~0 := ~main____CPAchecker_TMP_0~0; {960#(<= 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-08 09:54:55,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {960#(<= 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)))} ~main____CPAchecker_TMP_0~1 := ~__tmp_93_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~1; {960#(<= 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-08 09:54:55,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#(<= 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)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {960#(<= 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-08 09:54:55,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#(<= 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~1); {960#(<= 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-08 09:54:55,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#(<= 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; {961#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-08 09:54:55,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {961#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {956#false} is VALID [2022-04-08 09:54:55,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {956#false} assume !false; {956#false} is VALID [2022-04-08 09:54:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 09:54:55,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:54:55,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029258637] [2022-04-08 09:54:55,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029258637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:54:55,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:54:55,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:54:55,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:54:55,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1962645234] [2022-04-08 09:54:55,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1962645234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:54:55,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:54:55,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:54:55,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940778945] [2022-04-08 09:54:55,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:54:55,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 22 [2022-04-08 09:54:55,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:54:55,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:54:58,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 09:54:58,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:54:58,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:54:58,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:54:58,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:54:58,055 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:55:02,299 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-08 09:55:04,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:55:06,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:55:10,908 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-08 09:55:15,259 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-08 09:55:17,475 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-08 09:55:19,654 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-08 09:55:21,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:55:22,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:55:22,065 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-04-08 09:55:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:55:22,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 22 [2022-04-08 09:55:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:55:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:55:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 09:55:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:55:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 09:55:22,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 09:55:26,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 65 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 09:55:26,498 INFO L225 Difference]: With dead ends: 60 [2022-04-08 09:55:26,498 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:55:26,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:55:26,499 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:55:26,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 8 Unknown, 0 Unchecked, 17.0s Time] [2022-04-08 09:55:26,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:55:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:55:26,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:55:26,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:55:26,500 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:55:26,500 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:55:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:55:26,500 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:55:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:55:26,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:55:26,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:55:26,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:55:26,501 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:55:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:55:26,501 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:55:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:55:26,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:55:26,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:55:26,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:55:26,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:55:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:55:26,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:55:26,501 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-08 09:55:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:55:26,502 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:55:26,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:55:26,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:55:26,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:55:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:55:26,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:55:26,504 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:55:26,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 09:55:26,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:55:26,597 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-08 09:55:26,597 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-08 09:55:26,597 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-08 09:55:26,598 INFO L878 garLoopResultBuilder]: At program point L97(lines 97 106) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296))))))) [2022-04-08 09:55:26,598 INFO L878 garLoopResultBuilder]: At program point L122(lines 25 145) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-08 09:55:26,598 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 151) the Hoare annotation is: true [2022-04-08 09:55:26,598 INFO L878 garLoopResultBuilder]: At program point L56(lines 26 114) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-08 09:55:26,598 INFO L885 garLoopResultBuilder]: At program point L23(lines 23 150) the Hoare annotation is: true [2022-04-08 09:55:26,598 INFO L878 garLoopResultBuilder]: At program point L48(lines 48 85) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-08 09:55:26,598 INFO L878 garLoopResultBuilder]: At program point L44(lines 26 114) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-08 09:55:26,598 INFO L878 garLoopResultBuilder]: At program point L90(lines 90 112) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-08 09:55:26,598 INFO L878 garLoopResultBuilder]: At program point L37(lines 37 113) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-08 09:55:26,599 INFO L878 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: false [2022-04-08 09:55:26,599 INFO L885 garLoopResultBuilder]: At program point L128(lines 128 143) the Hoare annotation is: true [2022-04-08 09:55:26,599 INFO L885 garLoopResultBuilder]: At program point L62(lines 62 84) the Hoare annotation is: true [2022-04-08 09:55:26,599 INFO L885 garLoopResultBuilder]: At program point L25(lines 25 145) the Hoare annotation is: true [2022-04-08 09:55:26,599 INFO L885 garLoopResultBuilder]: At program point L83(lines 17 151) the Hoare annotation is: true [2022-04-08 09:55:26,599 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 151) the Hoare annotation is: true [2022-04-08 09:55:26,599 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 99) the Hoare annotation is: false [2022-04-08 09:55:26,599 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 16 151) the Hoare annotation is: (and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|)) [2022-04-08 09:55:26,599 INFO L885 garLoopResultBuilder]: At program point L117(lines 117 144) the Hoare annotation is: true [2022-04-08 09:55:26,599 INFO L885 garLoopResultBuilder]: At program point L142(lines 25 145) the Hoare annotation is: true [2022-04-08 09:55:26,600 INFO L878 garLoopResultBuilder]: At program point L39(lines 39 86) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-08 09:55:26,600 INFO L885 garLoopResultBuilder]: At program point L134(lines 25 145) the Hoare annotation is: true [2022-04-08 09:55:26,600 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:55:26,600 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:55:26,600 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:55:26,600 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:55:26,600 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:55:26,600 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:55:26,600 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:55:26,602 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-04-08 09:55:26,603 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:55:26,605 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:55:26,614 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:55:30,984 INFO L163 areAnnotationChecker]: CFG has 37 edges. 35 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:55:30,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:55:30 BoogieIcfgContainer [2022-04-08 09:55:30,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:55:30,992 INFO L158 Benchmark]: Toolchain (without parser) took 244718.05ms. Allocated memory is still 169.9MB. Free memory was 123.2MB in the beginning and 100.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. [2022-04-08 09:55:30,992 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:55:30,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.52ms. Allocated memory is still 169.9MB. Free memory was 123.0MB in the beginning and 148.1MB in the end (delta: -25.1MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-04-08 09:55:30,993 INFO L158 Benchmark]: Boogie Preprocessor took 21.49ms. Allocated memory is still 169.9MB. Free memory was 148.1MB in the beginning and 146.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:55:30,993 INFO L158 Benchmark]: RCFGBuilder took 8972.63ms. Allocated memory is still 169.9MB. Free memory was 146.4MB in the beginning and 133.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 09:55:30,993 INFO L158 Benchmark]: TraceAbstraction took 235532.57ms. Allocated memory is still 169.9MB. Free memory was 132.8MB in the beginning and 100.4MB in the end (delta: 32.4MB). Peak memory consumption was 32.9MB. Max. memory is 8.0GB. [2022-04-08 09:55:30,994 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.52ms. Allocated memory is still 169.9MB. Free memory was 123.0MB in the beginning and 148.1MB in the end (delta: -25.1MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.49ms. Allocated memory is still 169.9MB. Free memory was 148.1MB in the beginning and 146.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 8972.63ms. Allocated memory is still 169.9MB. Free memory was 146.4MB in the beginning and 133.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 235532.57ms. Allocated memory is still 169.9MB. Free memory was 132.8MB in the beginning and 100.4MB in the end (delta: 32.4MB). Peak memory consumption was 32.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 99]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 231.1s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 199.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 52 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 111.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 302 SdHoareTripleChecker+Invalid, 106.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 279 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 109 mSDtfsCounter, 279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 30 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 66 NumberOfFragments, 410 HoareAnnotationTreeSize, 28 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:55:31,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...