/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/loops-crafted-1/mono-crafted_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:01:13,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:01:13,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:01:13,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:01:13,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:01:13,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:01:13,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:01:13,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:01:13,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:01:13,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:01:13,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:01:13,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:01:13,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:01:13,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:01:13,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:01:13,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:01:13,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:01:13,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:01:13,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:01:13,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:01:13,398 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:01:13,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:01:13,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:01:13,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:01:13,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:01:13,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:01:13,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:01:13,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:01:13,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:01:13,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:01:13,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:01:13,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:01:13,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:01:13,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:01:13,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:01:13,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:01:13,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:01:13,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:01:13,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:01:13,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:01:13,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:01:13,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:01:13,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:01:13,422 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:01:13,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:01:13,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:01:13,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:01:13,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:01:13,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:01:13,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:01:13,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:01:13,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:01:13,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:01:13,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:01:13,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:01:13,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:01:13,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:01:13,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:01:13,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:01:13,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:01:13,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:01:13,426 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:01:13,426 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:01:13,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:01:13,426 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:01:13,426 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-15 13:01:13,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:01:13,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:01:13,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:01:13,654 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:01:13,655 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:01:13,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-15 13:01:13,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78fe0a021/a763c347599648f797d6051413f402a9/FLAGf393357b4 [2022-04-15 13:01:14,068 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:01:14,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-15 13:01:14,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78fe0a021/a763c347599648f797d6051413f402a9/FLAGf393357b4 [2022-04-15 13:01:14,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78fe0a021/a763c347599648f797d6051413f402a9 [2022-04-15 13:01:14,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:01:14,093 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:01:14,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:01:14,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:01:14,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:01:14,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:01:14" (1/1) ... [2022-04-15 13:01:14,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ef7a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:14, skipping insertion in model container [2022-04-15 13:01:14,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:01:14" (1/1) ... [2022-04-15 13:01:14,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:01:14,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:01:14,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c[319,332] [2022-04-15 13:01:14,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:01:14,285 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:01:14,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c[319,332] [2022-04-15 13:01:14,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:01:14,315 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:01:14,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:14 WrapperNode [2022-04-15 13:01:14,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:01:14,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:01:14,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:01:14,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:01:14,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:14" (1/1) ... [2022-04-15 13:01:14,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:14" (1/1) ... [2022-04-15 13:01:14,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:14" (1/1) ... [2022-04-15 13:01:14,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:14" (1/1) ... [2022-04-15 13:01:14,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:14" (1/1) ... [2022-04-15 13:01:14,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:14" (1/1) ... [2022-04-15 13:01:14,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:14" (1/1) ... [2022-04-15 13:01:14,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:01:14,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:01:14,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:01:14,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:01:14,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:14" (1/1) ... [2022-04-15 13:01:14,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:01:14,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:14,422 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-15 13:01:14,442 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-15 13:01:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:01:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:01:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:01:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:01:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:01:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:01:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:01:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:01:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:01:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:01:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:01:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:01:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:01:14,501 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:01:14,502 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:01:14,588 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:01:14,592 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:01:14,592 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:01:14,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:01:14 BoogieIcfgContainer [2022-04-15 13:01:14,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:01:14,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:01:14,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:01:14,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:01:14,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:01:14" (1/3) ... [2022-04-15 13:01:14,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a3fd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:01:14, skipping insertion in model container [2022-04-15 13:01:14,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:14" (2/3) ... [2022-04-15 13:01:14,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a3fd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:01:14, skipping insertion in model container [2022-04-15 13:01:14,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:01:14" (3/3) ... [2022-04-15 13:01:14,599 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2022-04-15 13:01:14,602 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:01:14,602 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:01:14,629 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:01:14,633 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-15 13:01:14,633 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:01:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:01:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:01:14,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:14,649 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:14,649 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:14,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 1 times [2022-04-15 13:01:14,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:14,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1434560332] [2022-04-15 13:01:14,670 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:01:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 2 times [2022-04-15 13:01:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:14,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299509603] [2022-04-15 13:01:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:14,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:14,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-15 13:01:14,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 13:01:14,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-15 13:01:14,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:14,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-15 13:01:14,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 13:01:14,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-15 13:01:14,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-15 13:01:14,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0; {23#true} is VALID [2022-04-15 13:01:14,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-15 13:01:14,842 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24#false} is VALID [2022-04-15 13:01:14,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 13:01:14,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 13:01:14,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 13:01:14,843 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-15 13:01:14,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:14,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299509603] [2022-04-15 13:01:14,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299509603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:14,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:14,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:01:14,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:14,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1434560332] [2022-04-15 13:01:14,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1434560332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:14,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:14,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:01:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34500922] [2022-04-15 13:01:14,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:14,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:01:14,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:14,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:14,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:14,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:01:14,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:14,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:01:14,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:01:14,903 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:14,968 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 13:01:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:01:14,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:01:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 13:01:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 13:01:14,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-15 13:01:15,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:15,014 INFO L225 Difference]: With dead ends: 32 [2022-04-15 13:01:15,014 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 13:01:15,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:01:15,027 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:15,030 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 13:01:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 13:01:15,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:15,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,049 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,050 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:15,051 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 13:01:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 13:01:15,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:15,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:15,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 13:01:15,052 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 13:01:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:15,054 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 13:01:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 13:01:15,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:15,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:15,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:15,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-15 13:01:15,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-15 13:01:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:15,057 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-15 13:01:15,057 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-15 13:01:15,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 13:01:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:01:15,071 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:15,071 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:15,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:01:15,071 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2022-04-15 13:01:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:15,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1256905046] [2022-04-15 13:01:15,073 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:01:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 2 times [2022-04-15 13:01:15,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:15,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410815614] [2022-04-15 13:01:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:15,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:15,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-15 13:01:15,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-15 13:01:15,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-15 13:01:15,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:15,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-15 13:01:15,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-15 13:01:15,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-15 13:01:15,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret5 := main(); {147#true} is VALID [2022-04-15 13:01:15,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} ~x~0 := 0; {152#(= main_~x~0 0)} is VALID [2022-04-15 13:01:15,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 100000000); {148#false} is VALID [2022-04-15 13:01:15,187 INFO L272 TraceCheckUtils]: 7: Hoare triple {148#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {148#false} is VALID [2022-04-15 13:01:15,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2022-04-15 13:01:15,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2022-04-15 13:01:15,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-04-15 13:01:15,187 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-15 13:01:15,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:15,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410815614] [2022-04-15 13:01:15,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410815614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:15,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:15,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:01:15,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:15,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1256905046] [2022-04-15 13:01:15,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1256905046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:15,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:15,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:01:15,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504356244] [2022-04-15 13:01:15,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:15,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:01:15,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:15,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:15,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:01:15,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:15,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:01:15,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:01:15,200 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:15,297 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 13:01:15,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:01:15,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:01:15,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 13:01:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 13:01:15,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-15 13:01:15,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:15,329 INFO L225 Difference]: With dead ends: 22 [2022-04-15 13:01:15,329 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 13:01:15,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:01:15,333 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:15,333 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 13:01:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 13:01:15,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:15,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,342 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,342 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:15,344 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 13:01:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 13:01:15,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:15,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:15,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 13:01:15,346 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 13:01:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:15,349 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 13:01:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 13:01:15,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:15,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:15,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:15,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 13:01:15,351 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-15 13:01:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:15,352 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 13:01:15,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 13:01:15,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 13:01:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 13:01:15,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:15,370 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:15,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:01:15,371 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:15,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:15,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 1 times [2022-04-15 13:01:15,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:15,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1052853775] [2022-04-15 13:01:15,460 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:01:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1209153456, now seen corresponding path program 1 times [2022-04-15 13:01:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:15,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940900260] [2022-04-15 13:01:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:15,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:15,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-15 13:01:15,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 13:01:15,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-15 13:01:15,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:15,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-15 13:01:15,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 13:01:15,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-15 13:01:15,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret5 := main(); {262#true} is VALID [2022-04-15 13:01:15,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~x~0 := 0; {267#(= main_~x~0 0)} is VALID [2022-04-15 13:01:15,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~x~0 0)} [47] L9-2-->L8-2_primed: Formula: (or (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post4_Out_2| 0) (< (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296) 10000000)) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) InVars {main_~x~0=v_main_~x~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post4=|v_main_#t~post4_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {268#(or (<= (+ 4284967296 main_~x~0) (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296)) (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))))} is VALID [2022-04-15 13:01:15,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(or (<= (+ 4284967296 main_~x~0) (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296)) (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))))} [46] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {263#false} is VALID [2022-04-15 13:01:15,578 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {263#false} is VALID [2022-04-15 13:01:15,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-15 13:01:15,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-15 13:01:15,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-15 13:01:15,578 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-15 13:01:15,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:15,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940900260] [2022-04-15 13:01:15,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940900260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:15,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:15,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:01:15,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:15,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1052853775] [2022-04-15 13:01:15,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1052853775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:15,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:15,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:01:15,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782991420] [2022-04-15 13:01:15,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:15,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:01:15,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:15,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:15,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:01:15,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:15,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:01:15,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:01:15,685 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:15,835 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 13:01:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:01:15,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:01:15,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 13:01:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 13:01:15,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-15 13:01:15,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:15,937 INFO L225 Difference]: With dead ends: 22 [2022-04-15 13:01:15,937 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 13:01:15,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:01:15,938 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:15,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 13:01:15,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 13:01:15,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:15,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,951 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,951 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:15,953 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:01:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:01:15,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:15,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:15,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 13:01:15,955 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 13:01:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:15,957 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:01:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:01:15,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:15,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:15,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:15,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 13:01:15,960 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-15 13:01:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:15,960 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 13:01:15,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:15,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 13:01:15,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:01:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:01:15,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:15,980 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:15,980 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:01:15,982 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:15,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1059749499, now seen corresponding path program 1 times [2022-04-15 13:01:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:15,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1463285192] [2022-04-15 13:01:16,254 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:16,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1150048112, now seen corresponding path program 1 times [2022-04-15 13:01:16,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:16,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804903678] [2022-04-15 13:01:16,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:16,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:01:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:16,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:01:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1059749499, now seen corresponding path program 2 times [2022-04-15 13:01:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:16,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859099541] [2022-04-15 13:01:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:16,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:16,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-15 13:01:16,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 13:01:16,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 13:01:16,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:16,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-15 13:01:16,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 13:01:16,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 13:01:16,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-15 13:01:16,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0; {395#(= main_~x~0 0)} is VALID [2022-04-15 13:01:16,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {395#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {395#(= main_~x~0 0)} is VALID [2022-04-15 13:01:16,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {395#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {396#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:01:16,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {396#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:01:16,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {396#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {391#false} is VALID [2022-04-15 13:01:16,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {391#false} assume !(~x~0 % 4294967296 < 100000000); {391#false} is VALID [2022-04-15 13:01:16,419 INFO L272 TraceCheckUtils]: 11: Hoare triple {391#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {391#false} is VALID [2022-04-15 13:01:16,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2022-04-15 13:01:16,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume 0 == ~cond; {391#false} is VALID [2022-04-15 13:01:16,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-15 13:01:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:16,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:16,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859099541] [2022-04-15 13:01:16,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859099541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:16,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62387449] [2022-04-15 13:01:16,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:01:16,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:16,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:16,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:16,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:01:16,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:01:16,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:16,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 13:01:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:16,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:16,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-15 13:01:16,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-15 13:01:16,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 13:01:16,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 13:01:16,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-15 13:01:16,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0; {395#(= main_~x~0 0)} is VALID [2022-04-15 13:01:16,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {395#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {395#(= main_~x~0 0)} is VALID [2022-04-15 13:01:16,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {395#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {422#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 13:01:16,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(= (+ (- 1) main_~x~0) 0)} assume !!(~x~0 % 4294967296 < 100000000); {422#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 13:01:16,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {391#false} is VALID [2022-04-15 13:01:16,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {391#false} assume !(~x~0 % 4294967296 < 100000000); {391#false} is VALID [2022-04-15 13:01:16,518 INFO L272 TraceCheckUtils]: 11: Hoare triple {391#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {391#false} is VALID [2022-04-15 13:01:16,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2022-04-15 13:01:16,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume 0 == ~cond; {391#false} is VALID [2022-04-15 13:01:16,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-15 13:01:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:16,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:16,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-15 13:01:16,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume 0 == ~cond; {391#false} is VALID [2022-04-15 13:01:16,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2022-04-15 13:01:16,621 INFO L272 TraceCheckUtils]: 11: Hoare triple {391#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {391#false} is VALID [2022-04-15 13:01:16,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {391#false} assume !(~x~0 % 4294967296 < 100000000); {391#false} is VALID [2022-04-15 13:01:16,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {391#false} is VALID [2022-04-15 13:01:16,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {459#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 13:01:16,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {467#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {463#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 13:01:16,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {467#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {467#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 13:01:16,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0; {467#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 13:01:16,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-15 13:01:16,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 13:01:16,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 13:01:16,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-15 13:01:16,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-15 13:01:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:16,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62387449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:16,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:16,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2022-04-15 13:01:16,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:16,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1463285192] [2022-04-15 13:01:16,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1463285192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:16,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:16,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:01:16,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372945860] [2022-04-15 13:01:16,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:01:16,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:16,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:16,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:16,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:01:16,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:16,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:01:16,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:01:16,637 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:16,727 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 13:01:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:01:16,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:01:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 13:01:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 13:01:16,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-15 13:01:16,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:16,758 INFO L225 Difference]: With dead ends: 26 [2022-04-15 13:01:16,758 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 13:01:16,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:01:16,759 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:16,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 13:01:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 13:01:16,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:16,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:16,771 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:16,771 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:16,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:16,772 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 13:01:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 13:01:16,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:16,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:16,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 13:01:16,773 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 13:01:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:16,773 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 13:01:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 13:01:16,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:16,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:16,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:16,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 13:01:16,775 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-15 13:01:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:16,775 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 13:01:16,775 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:16,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 13:01:16,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 13:01:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:01:16,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:16,814 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:16,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 13:01:17,029 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:17,030 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:17,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:17,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1870563496, now seen corresponding path program 3 times [2022-04-15 13:01:17,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:17,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1932237132] [2022-04-15 13:01:17,195 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1090942768, now seen corresponding path program 1 times [2022-04-15 13:01:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:17,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449670043] [2022-04-15 13:01:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:17,237 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:01:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:17,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:01:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1870563496, now seen corresponding path program 4 times [2022-04-15 13:01:17,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:17,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571107451] [2022-04-15 13:01:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:17,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:17,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:17,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-15 13:01:17,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 13:01:17,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {623#true} {623#true} #41#return; {623#true} is VALID [2022-04-15 13:01:17,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:17,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-15 13:01:17,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 13:01:17,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #41#return; {623#true} is VALID [2022-04-15 13:01:17,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret5 := main(); {623#true} is VALID [2022-04-15 13:01:17,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} ~x~0 := 0; {628#(= main_~x~0 0)} is VALID [2022-04-15 13:01:17,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {628#(= main_~x~0 0)} is VALID [2022-04-15 13:01:17,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {629#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:17,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {629#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {629#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:17,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {630#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:17,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {630#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {630#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:17,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {630#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {624#false} is VALID [2022-04-15 13:01:17,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {624#false} assume !(~x~0 % 4294967296 < 100000000); {624#false} is VALID [2022-04-15 13:01:17,376 INFO L272 TraceCheckUtils]: 13: Hoare triple {624#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {624#false} is VALID [2022-04-15 13:01:17,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {624#false} ~cond := #in~cond; {624#false} is VALID [2022-04-15 13:01:17,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {624#false} assume 0 == ~cond; {624#false} is VALID [2022-04-15 13:01:17,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-15 13:01:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:17,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:17,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571107451] [2022-04-15 13:01:17,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571107451] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:17,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767426074] [2022-04-15 13:01:17,377 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:01:17,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:17,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:17,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:17,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 13:01:17,417 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:01:17,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:17,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 13:01:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:17,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:17,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-15 13:01:17,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-15 13:01:17,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 13:01:17,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #41#return; {623#true} is VALID [2022-04-15 13:01:17,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret5 := main(); {623#true} is VALID [2022-04-15 13:01:17,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} ~x~0 := 0; {628#(= main_~x~0 0)} is VALID [2022-04-15 13:01:17,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {628#(= main_~x~0 0)} is VALID [2022-04-15 13:01:17,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {629#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:17,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {629#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {629#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:17,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {662#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:17,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {662#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {662#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:17,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {662#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {669#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 13:01:17,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {669#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {669#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 13:01:17,660 INFO L272 TraceCheckUtils]: 13: Hoare triple {669#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:01:17,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:01:17,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {680#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-15 13:01:17,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-15 13:01:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:17,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:17,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-15 13:01:17,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {680#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-15 13:01:17,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:01:17,751 INFO L272 TraceCheckUtils]: 13: Hoare triple {696#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:01:17,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {696#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 100000000); {696#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:17,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {696#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {696#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:17,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {696#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {696#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:17,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {696#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:17,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {709#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {709#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 13:01:17,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {696#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {709#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 13:01:17,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {696#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {696#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:17,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} ~x~0 := 0; {696#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:17,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret5 := main(); {623#true} is VALID [2022-04-15 13:01:17,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #41#return; {623#true} is VALID [2022-04-15 13:01:17,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 13:01:17,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-15 13:01:17,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-15 13:01:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 13:01:17,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767426074] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:17,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:17,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-04-15 13:01:17,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:17,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1932237132] [2022-04-15 13:01:17,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1932237132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:17,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:17,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:01:17,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157142803] [2022-04-15 13:01:17,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:17,759 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:01:17,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:17,759 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:17,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:17,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:01:17,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:17,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:01:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-15 13:01:17,771 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:17,866 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 13:01:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:01:17,866 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:01:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:17,866 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 13:01:17,867 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 13:01:17,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-04-15 13:01:17,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:17,891 INFO L225 Difference]: With dead ends: 28 [2022-04-15 13:01:17,891 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 13:01:17,891 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:01:17,892 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:17,892 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 13:01:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 13:01:17,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:17,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:17,908 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:17,909 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:17,910 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 13:01:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 13:01:17,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:17,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:17,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 13:01:17,910 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 13:01:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:17,911 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 13:01:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 13:01:17,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:17,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:17,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:17,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 13:01:17,912 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-15 13:01:17,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:17,913 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 13:01:17,913 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:17,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 13:01:17,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 13:01:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:01:17,940 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:17,940 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:17,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:18,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2022-04-15 13:01:18,156 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:18,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash -402805515, now seen corresponding path program 5 times [2022-04-15 13:01:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:18,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2116936970] [2022-04-15 13:01:18,349 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:18,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1031837424, now seen corresponding path program 1 times [2022-04-15 13:01:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:18,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191019705] [2022-04-15 13:01:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:18,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:18,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:01:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:18,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:01:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash -402805515, now seen corresponding path program 6 times [2022-04-15 13:01:18,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:18,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620823330] [2022-04-15 13:01:18,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:18,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:18,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {885#true} is VALID [2022-04-15 13:01:18,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#true} assume true; {885#true} is VALID [2022-04-15 13:01:18,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {885#true} {885#true} #41#return; {885#true} is VALID [2022-04-15 13:01:18,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:18,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {885#true} is VALID [2022-04-15 13:01:18,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2022-04-15 13:01:18,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #41#return; {885#true} is VALID [2022-04-15 13:01:18,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret5 := main(); {885#true} is VALID [2022-04-15 13:01:18,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {885#true} ~x~0 := 0; {890#(= main_~x~0 0)} is VALID [2022-04-15 13:01:18,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {890#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {890#(= main_~x~0 0)} is VALID [2022-04-15 13:01:18,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {890#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {891#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:18,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {891#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {891#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:18,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {891#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:18,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:18,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {893#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-15 13:01:18,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {893#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !!(~x~0 % 4294967296 < 100000000); {893#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-15 13:01:18,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {893#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {886#false} is VALID [2022-04-15 13:01:18,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {886#false} assume !(~x~0 % 4294967296 < 100000000); {886#false} is VALID [2022-04-15 13:01:18,445 INFO L272 TraceCheckUtils]: 15: Hoare triple {886#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {886#false} is VALID [2022-04-15 13:01:18,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {886#false} ~cond := #in~cond; {886#false} is VALID [2022-04-15 13:01:18,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {886#false} assume 0 == ~cond; {886#false} is VALID [2022-04-15 13:01:18,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {886#false} assume !false; {886#false} is VALID [2022-04-15 13:01:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:18,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:18,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620823330] [2022-04-15 13:01:18,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620823330] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:18,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113317657] [2022-04-15 13:01:18,446 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:01:18,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:18,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:18,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:18,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 13:01:18,511 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 13:01:18,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:18,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 13:01:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:18,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:18,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {885#true} is VALID [2022-04-15 13:01:18,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {885#true} is VALID [2022-04-15 13:01:18,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2022-04-15 13:01:18,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #41#return; {885#true} is VALID [2022-04-15 13:01:18,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret5 := main(); {885#true} is VALID [2022-04-15 13:01:18,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {885#true} ~x~0 := 0; {885#true} is VALID [2022-04-15 13:01:18,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#true} assume !!(~x~0 % 4294967296 < 100000000); {885#true} is VALID [2022-04-15 13:01:18,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {885#true} is VALID [2022-04-15 13:01:18,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#true} assume !!(~x~0 % 4294967296 < 100000000); {885#true} is VALID [2022-04-15 13:01:18,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {885#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {925#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 13:01:18,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {925#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {925#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 13:01:18,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {925#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {932#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} is VALID [2022-04-15 13:01:18,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {932#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {932#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} is VALID [2022-04-15 13:01:18,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {932#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {939#(< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-15 13:01:18,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {939#(< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {886#false} is VALID [2022-04-15 13:01:18,745 INFO L272 TraceCheckUtils]: 15: Hoare triple {886#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {886#false} is VALID [2022-04-15 13:01:18,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {886#false} ~cond := #in~cond; {886#false} is VALID [2022-04-15 13:01:18,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {886#false} assume 0 == ~cond; {886#false} is VALID [2022-04-15 13:01:18,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {886#false} assume !false; {886#false} is VALID [2022-04-15 13:01:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 13:01:18,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:18,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {886#false} assume !false; {886#false} is VALID [2022-04-15 13:01:18,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {886#false} assume 0 == ~cond; {886#false} is VALID [2022-04-15 13:01:18,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {886#false} ~cond := #in~cond; {886#false} is VALID [2022-04-15 13:01:18,970 INFO L272 TraceCheckUtils]: 15: Hoare triple {886#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {886#false} is VALID [2022-04-15 13:01:18,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {886#false} is VALID [2022-04-15 13:01:18,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {971#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {967#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 13:01:18,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {971#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {971#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 13:01:18,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {978#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {971#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 13:01:18,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {978#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {978#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 13:01:18,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {885#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {978#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 13:01:18,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#true} assume !!(~x~0 % 4294967296 < 100000000); {885#true} is VALID [2022-04-15 13:01:18,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {885#true} is VALID [2022-04-15 13:01:18,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#true} assume !!(~x~0 % 4294967296 < 100000000); {885#true} is VALID [2022-04-15 13:01:18,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {885#true} ~x~0 := 0; {885#true} is VALID [2022-04-15 13:01:18,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret5 := main(); {885#true} is VALID [2022-04-15 13:01:18,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #41#return; {885#true} is VALID [2022-04-15 13:01:18,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2022-04-15 13:01:18,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {885#true} is VALID [2022-04-15 13:01:18,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {885#true} is VALID [2022-04-15 13:01:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 13:01:18,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113317657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:18,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:18,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-15 13:01:18,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:18,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2116936970] [2022-04-15 13:01:18,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2116936970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:18,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:18,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:01:18,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755309603] [2022-04-15 13:01:18,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:18,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:01:18,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:18,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:18,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:18,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:01:18,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:18,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:01:18,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:01:18,991 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:19,185 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 13:01:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:01:19,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:01:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 13:01:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 13:01:19,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-15 13:01:19,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:19,210 INFO L225 Difference]: With dead ends: 30 [2022-04-15 13:01:19,210 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 13:01:19,210 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-04-15 13:01:19,212 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:19,212 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 13:01:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 13:01:19,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:19,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:19,234 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:19,234 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:19,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:19,235 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 13:01:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 13:01:19,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:19,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:19,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 13:01:19,237 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 13:01:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:19,242 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 13:01:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 13:01:19,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:19,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:19,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:19,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-15 13:01:19,244 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2022-04-15 13:01:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:19,244 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-15 13:01:19,244 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:19,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-15 13:01:19,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 13:01:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:01:19,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:19,281 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:19,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 13:01:19,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:19,485 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1363341138, now seen corresponding path program 7 times [2022-04-15 13:01:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:19,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [407958994] [2022-04-15 13:01:19,677 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:19,679 INFO L85 PathProgramCache]: Analyzing trace with hash -972732080, now seen corresponding path program 1 times [2022-04-15 13:01:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:19,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416854266] [2022-04-15 13:01:19,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:19,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:19,690 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:01:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:19,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:01:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1363341138, now seen corresponding path program 8 times [2022-04-15 13:01:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:19,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597880470] [2022-04-15 13:01:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:19,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:19,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-15 13:01:19,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 13:01:19,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1174#true} {1174#true} #41#return; {1174#true} is VALID [2022-04-15 13:01:19,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:19,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-15 13:01:19,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 13:01:19,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #41#return; {1174#true} is VALID [2022-04-15 13:01:19,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret5 := main(); {1174#true} is VALID [2022-04-15 13:01:19,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~x~0 := 0; {1179#(= main_~x~0 0)} is VALID [2022-04-15 13:01:19,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {1179#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1179#(= main_~x~0 0)} is VALID [2022-04-15 13:01:19,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:19,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:19,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:19,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:19,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 13:01:19,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 13:01:19,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1183#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:01:19,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {1183#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:01:19,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {1183#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1175#false} is VALID [2022-04-15 13:01:19,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {1175#false} assume !(~x~0 % 4294967296 < 100000000); {1175#false} is VALID [2022-04-15 13:01:19,787 INFO L272 TraceCheckUtils]: 17: Hoare triple {1175#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1175#false} is VALID [2022-04-15 13:01:19,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {1175#false} ~cond := #in~cond; {1175#false} is VALID [2022-04-15 13:01:19,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#false} assume 0 == ~cond; {1175#false} is VALID [2022-04-15 13:01:19,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-15 13:01:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:19,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:19,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597880470] [2022-04-15 13:01:19,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597880470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:19,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443215913] [2022-04-15 13:01:19,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:01:19,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:19,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:19,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:19,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 13:01:19,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:01:19,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:19,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 13:01:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:19,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:20,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2022-04-15 13:01:20,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-15 13:01:20,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 13:01:20,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #41#return; {1174#true} is VALID [2022-04-15 13:01:20,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret5 := main(); {1174#true} is VALID [2022-04-15 13:01:20,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~x~0 := 0; {1179#(= main_~x~0 0)} is VALID [2022-04-15 13:01:20,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {1179#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1179#(= main_~x~0 0)} is VALID [2022-04-15 13:01:20,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:20,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:20,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:20,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:20,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 13:01:20,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 13:01:20,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1227#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 13:01:20,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {1227#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1227#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 13:01:20,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1234#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 13:01:20,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {1234#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 100000000); {1234#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 13:01:20,030 INFO L272 TraceCheckUtils]: 17: Hoare triple {1234#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1241#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:01:20,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {1241#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1245#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:01:20,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {1245#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1175#false} is VALID [2022-04-15 13:01:20,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-15 13:01:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:20,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:20,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-15 13:01:20,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {1245#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1175#false} is VALID [2022-04-15 13:01:20,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {1241#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1245#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:01:20,126 INFO L272 TraceCheckUtils]: 17: Hoare triple {1261#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1241#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:01:20,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {1261#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 100000000); {1261#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:20,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {1261#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1261#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:20,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {1261#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1261#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:20,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {1274#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1261#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:20,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {1274#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1274#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 13:01:20,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {1261#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1274#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 13:01:20,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {1261#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1261#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:20,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {1274#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1261#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:20,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {1274#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1274#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 13:01:20,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {1261#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1274#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 13:01:20,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {1261#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1261#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:20,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~x~0 := 0; {1261#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:20,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret5 := main(); {1174#true} is VALID [2022-04-15 13:01:20,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #41#return; {1174#true} is VALID [2022-04-15 13:01:20,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 13:01:20,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-15 13:01:20,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2022-04-15 13:01:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 13:01:20,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443215913] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:20,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:20,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 14 [2022-04-15 13:01:20,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:20,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [407958994] [2022-04-15 13:01:20,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [407958994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:20,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:20,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:01:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661084464] [2022-04-15 13:01:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:20,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 13:01:20,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:20,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:20,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:20,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:01:20,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:20,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:01:20,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:01:20,156 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:20,322 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 13:01:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:01:20,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 13:01:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 13:01:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 13:01:20,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-15 13:01:20,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:20,357 INFO L225 Difference]: With dead ends: 32 [2022-04-15 13:01:20,357 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 13:01:20,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-04-15 13:01:20,358 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:20,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 13:01:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 13:01:20,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:20,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:20,381 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:20,381 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:20,382 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 13:01:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 13:01:20,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:20,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:20,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 13:01:20,383 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 13:01:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:20,384 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 13:01:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 13:01:20,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:20,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:20,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:20,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 13:01:20,385 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-15 13:01:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:20,385 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 13:01:20,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:20,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 13:01:20,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 13:01:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 13:01:20,438 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:20,438 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:20,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 13:01:20,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:20,669 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:20,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:20,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2118192751, now seen corresponding path program 9 times [2022-04-15 13:01:20,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:20,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1757838942] [2022-04-15 13:01:20,880 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash -913626736, now seen corresponding path program 1 times [2022-04-15 13:01:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:20,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936964562] [2022-04-15 13:01:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:20,901 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:01:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:20,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:01:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2118192751, now seen corresponding path program 10 times [2022-04-15 13:01:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:20,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615215736] [2022-04-15 13:01:20,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:20,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:21,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:21,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {1501#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1490#true} is VALID [2022-04-15 13:01:21,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-15 13:01:21,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1490#true} {1490#true} #41#return; {1490#true} is VALID [2022-04-15 13:01:21,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1501#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:21,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {1501#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1490#true} is VALID [2022-04-15 13:01:21,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-15 13:01:21,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #41#return; {1490#true} is VALID [2022-04-15 13:01:21,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret5 := main(); {1490#true} is VALID [2022-04-15 13:01:21,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {1490#true} ~x~0 := 0; {1495#(= main_~x~0 0)} is VALID [2022-04-15 13:01:21,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {1495#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1495#(= main_~x~0 0)} is VALID [2022-04-15 13:01:21,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {1495#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1496#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:21,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {1496#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1496#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:21,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {1496#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:21,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:21,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1498#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 13:01:21,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {1498#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1498#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 13:01:21,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {1498#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1499#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 13:01:21,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1499#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 13:01:21,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {1499#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1500#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-15 13:01:21,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {1500#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1500#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-15 13:01:21,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {1500#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1491#false} is VALID [2022-04-15 13:01:21,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {1491#false} assume !(~x~0 % 4294967296 < 100000000); {1491#false} is VALID [2022-04-15 13:01:21,113 INFO L272 TraceCheckUtils]: 19: Hoare triple {1491#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1491#false} is VALID [2022-04-15 13:01:21,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2022-04-15 13:01:21,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2022-04-15 13:01:21,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-04-15 13:01:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:21,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:21,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615215736] [2022-04-15 13:01:21,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615215736] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:21,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492783600] [2022-04-15 13:01:21,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:01:21,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:21,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:21,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:21,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 13:01:21,143 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:01:21,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:21,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 13:01:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:21,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:21,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1490#true} is VALID [2022-04-15 13:01:21,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1490#true} is VALID [2022-04-15 13:01:21,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-15 13:01:21,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #41#return; {1490#true} is VALID [2022-04-15 13:01:21,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret5 := main(); {1490#true} is VALID [2022-04-15 13:01:21,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {1490#true} ~x~0 := 0; {1495#(= main_~x~0 0)} is VALID [2022-04-15 13:01:21,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {1495#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1495#(= main_~x~0 0)} is VALID [2022-04-15 13:01:21,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {1495#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1496#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:21,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {1496#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1496#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:21,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {1496#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:21,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:21,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1498#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 13:01:21,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {1498#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1498#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 13:01:21,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {1498#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1499#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 13:01:21,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1499#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 13:01:21,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {1499#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 13:01:21,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {1550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 13:01:21,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {1550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1491#false} is VALID [2022-04-15 13:01:21,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {1491#false} assume !(~x~0 % 4294967296 < 100000000); {1491#false} is VALID [2022-04-15 13:01:21,331 INFO L272 TraceCheckUtils]: 19: Hoare triple {1491#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1491#false} is VALID [2022-04-15 13:01:21,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2022-04-15 13:01:21,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2022-04-15 13:01:21,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-04-15 13:01:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:21,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:21,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-04-15 13:01:21,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2022-04-15 13:01:21,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2022-04-15 13:01:21,591 INFO L272 TraceCheckUtils]: 19: Hoare triple {1491#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1491#false} is VALID [2022-04-15 13:01:21,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {1491#false} assume !(~x~0 % 4294967296 < 100000000); {1491#false} is VALID [2022-04-15 13:01:21,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {1587#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1491#false} is VALID [2022-04-15 13:01:21,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {1591#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1587#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 13:01:21,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {1595#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1591#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 13:01:21,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {1595#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1595#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 13:01:21,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {1602#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1595#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 13:01:21,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {1602#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1602#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 13:01:21,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1602#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 13:01:21,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1609#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 13:01:21,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {1616#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1609#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 13:01:21,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {1616#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1616#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 13:01:21,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1623#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1616#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 13:01:21,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {1623#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1623#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 13:01:21,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {1490#true} ~x~0 := 0; {1623#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 13:01:21,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret5 := main(); {1490#true} is VALID [2022-04-15 13:01:21,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #41#return; {1490#true} is VALID [2022-04-15 13:01:21,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-15 13:01:21,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1490#true} is VALID [2022-04-15 13:01:21,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1490#true} is VALID [2022-04-15 13:01:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:21,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492783600] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:21,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:21,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-04-15 13:01:21,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:21,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1757838942] [2022-04-15 13:01:21,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1757838942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:21,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:21,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:01:21,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767146724] [2022-04-15 13:01:21,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:21,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 13:01:21,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:21,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:21,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:21,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:01:21,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:21,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:01:21,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-04-15 13:01:21,619 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:21,865 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 13:01:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:01:21,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 13:01:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 13:01:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 13:01:21,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-15 13:01:21,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:21,893 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:01:21,893 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:01:21,894 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2022-04-15 13:01:21,894 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:21,894 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 44 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:01:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:01:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 13:01:21,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:21,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:21,928 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:21,928 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:21,929 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 13:01:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 13:01:21,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:21,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:21,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 13:01:21,929 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 13:01:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:21,931 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 13:01:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 13:01:21,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:21,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:21,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:21,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 13:01:21,932 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2022-04-15 13:01:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:21,932 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 13:01:21,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:21,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 13:01:21,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 13:01:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:01:21,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:21,975 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:21,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:22,176 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2022-04-15 13:01:22,176 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:22,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:22,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1681119820, now seen corresponding path program 11 times [2022-04-15 13:01:22,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:22,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1857535239] [2022-04-15 13:01:22,347 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash -854521392, now seen corresponding path program 1 times [2022-04-15 13:01:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:22,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105316443] [2022-04-15 13:01:22,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:22,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:22,359 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:01:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:01:22,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:01:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1681119820, now seen corresponding path program 12 times [2022-04-15 13:01:22,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:22,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686071325] [2022-04-15 13:01:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:22,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:22,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:22,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {1847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1835#true} is VALID [2022-04-15 13:01:22,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {1835#true} assume true; {1835#true} is VALID [2022-04-15 13:01:22,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1835#true} {1835#true} #41#return; {1835#true} is VALID [2022-04-15 13:01:22,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {1835#true} call ULTIMATE.init(); {1847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:22,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1835#true} is VALID [2022-04-15 13:01:22,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {1835#true} assume true; {1835#true} is VALID [2022-04-15 13:01:22,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1835#true} {1835#true} #41#return; {1835#true} is VALID [2022-04-15 13:01:22,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {1835#true} call #t~ret5 := main(); {1835#true} is VALID [2022-04-15 13:01:22,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {1835#true} ~x~0 := 0; {1840#(= main_~x~0 0)} is VALID [2022-04-15 13:01:22,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {1840#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1840#(= main_~x~0 0)} is VALID [2022-04-15 13:01:22,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {1840#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1841#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:22,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {1841#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1841#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 13:01:22,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {1841#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:22,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 13:01:22,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1843#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 13:01:22,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {1843#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1843#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 13:01:22,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {1843#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1844#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 13:01:22,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {1844#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1844#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 13:01:22,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {1844#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1845#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 13:01:22,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {1845#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1845#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 13:01:22,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {1845#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1846#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 13:01:22,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {1846#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 13:01:22,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {1846#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1836#false} is VALID [2022-04-15 13:01:22,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {1836#false} assume !(~x~0 % 4294967296 < 100000000); {1836#false} is VALID [2022-04-15 13:01:22,493 INFO L272 TraceCheckUtils]: 21: Hoare triple {1836#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1836#false} is VALID [2022-04-15 13:01:22,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {1836#false} ~cond := #in~cond; {1836#false} is VALID [2022-04-15 13:01:22,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {1836#false} assume 0 == ~cond; {1836#false} is VALID [2022-04-15 13:01:22,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {1836#false} assume !false; {1836#false} is VALID [2022-04-15 13:01:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:22,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:22,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686071325] [2022-04-15 13:01:22,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686071325] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:22,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920072717] [2022-04-15 13:01:22,494 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:01:22,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:22,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:22,495 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:22,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 13:01:22,532 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 13:01:22,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:01:22,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 13:01:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:22,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:22,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {1835#true} call ULTIMATE.init(); {1835#true} is VALID [2022-04-15 13:01:22,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {1835#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1835#true} is VALID [2022-04-15 13:01:22,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {1835#true} assume true; {1835#true} is VALID [2022-04-15 13:01:22,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1835#true} {1835#true} #41#return; {1835#true} is VALID [2022-04-15 13:01:22,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {1835#true} call #t~ret5 := main(); {1835#true} is VALID [2022-04-15 13:01:22,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {1835#true} ~x~0 := 0; {1835#true} is VALID [2022-04-15 13:01:22,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:22,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1835#true} is VALID [2022-04-15 13:01:22,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:22,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1835#true} is VALID [2022-04-15 13:01:22,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:22,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1835#true} is VALID [2022-04-15 13:01:22,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:22,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1835#true} is VALID [2022-04-15 13:01:22,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:22,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1835#true} is VALID [2022-04-15 13:01:22,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:22,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1902#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 13:01:22,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {1902#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {1902#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 13:01:22,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {1902#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1909#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 13:01:22,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {1909#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {1909#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 13:01:22,964 INFO L272 TraceCheckUtils]: 21: Hoare triple {1909#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1916#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:01:22,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {1916#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1920#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:01:22,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {1920#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1836#false} is VALID [2022-04-15 13:01:22,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {1836#false} assume !false; {1836#false} is VALID [2022-04-15 13:01:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 13:01:22,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:23,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {1836#false} assume !false; {1836#false} is VALID [2022-04-15 13:01:23,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {1920#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1836#false} is VALID [2022-04-15 13:01:23,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {1916#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1920#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:01:23,759 INFO L272 TraceCheckUtils]: 21: Hoare triple {1936#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1916#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:01:23,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 100000000); {1936#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:23,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#(or (< (mod main_~x~0 4294967296) 10000000) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1936#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 13:01:23,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {1947#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 100000000); {1943#(or (< (mod main_~x~0 4294967296) 10000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 13:01:23,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1947#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 13:01:23,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:23,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1835#true} is VALID [2022-04-15 13:01:23,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:23,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1835#true} is VALID [2022-04-15 13:01:23,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:23,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1835#true} is VALID [2022-04-15 13:01:23,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:23,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1835#true} is VALID [2022-04-15 13:01:23,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:23,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {1835#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1835#true} is VALID [2022-04-15 13:01:23,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {1835#true} assume !!(~x~0 % 4294967296 < 100000000); {1835#true} is VALID [2022-04-15 13:01:23,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {1835#true} ~x~0 := 0; {1835#true} is VALID [2022-04-15 13:01:23,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {1835#true} call #t~ret5 := main(); {1835#true} is VALID [2022-04-15 13:01:23,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1835#true} {1835#true} #41#return; {1835#true} is VALID [2022-04-15 13:01:23,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1835#true} assume true; {1835#true} is VALID [2022-04-15 13:01:23,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1835#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1835#true} is VALID [2022-04-15 13:01:23,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {1835#true} call ULTIMATE.init(); {1835#true} is VALID [2022-04-15 13:01:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 13:01:23,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920072717] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:23,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 13:01:23,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 6] total 17 [2022-04-15 13:01:23,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:23,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1857535239] [2022-04-15 13:01:23,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1857535239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:23,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:23,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:01:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358217489] [2022-04-15 13:01:23,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:23,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 13:01:23,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:23,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:23,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:01:23,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:23,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:01:23,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-15 13:01:23,779 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:23,887 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 13:01:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:01:23,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 13:01:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-15 13:01:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-15 13:01:23,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-15 13:01:23,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:23,905 INFO L225 Difference]: With dead ends: 29 [2022-04-15 13:01:23,905 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 13:01:23,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-15 13:01:23,906 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:23,906 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 24 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 13:01:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 13:01:23,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:23,907 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-15 13:01:23,907 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-15 13:01:23,907 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-15 13:01:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:23,907 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 13:01:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:01:23,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:23,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:23,907 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-15 13:01:23,908 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-15 13:01:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:23,908 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 13:01:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:01:23,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:23,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:23,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:23,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:23,908 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-15 13:01:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 13:01:23,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-04-15 13:01:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:23,908 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 13:01:23,909 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 13:01:23,909 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-15 13:01:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:01:23,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:23,911 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 13:01:23,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:24,119 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 13:01:24,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 13:01:24,270 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 13:01:24,270 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 13:01:24,270 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 13:01:24,271 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 13:01:24,271 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 13:01:24,271 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 13:01:24,271 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 13:01:24,271 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 13:01:24,271 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 13:01:24,271 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 13:01:24,271 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 5 18) the Hoare annotation is: true [2022-04-15 13:01:24,271 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 5 18) the Hoare annotation is: true [2022-04-15 13:01:24,271 INFO L885 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: true [2022-04-15 13:01:24,271 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 5 18) the Hoare annotation is: true [2022-04-15 13:01:24,271 INFO L878 garLoopResultBuilder]: At program point L9(lines 9 13) the Hoare annotation is: (or (< (mod main_~x~0 4294967296) 10000000) (= (mod main_~x~0 2) 0)) [2022-04-15 13:01:24,271 INFO L878 garLoopResultBuilder]: At program point L9-2(lines 8 14) the Hoare annotation is: (or (< (mod main_~x~0 4294967296) 10000000) (= (mod main_~x~0 2) 0)) [2022-04-15 13:01:24,271 INFO L878 garLoopResultBuilder]: At program point L8-2(lines 8 14) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-15 13:01:24,272 INFO L885 garLoopResultBuilder]: At program point L4-3(line 4) the Hoare annotation is: true [2022-04-15 13:01:24,272 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2022-04-15 13:01:24,272 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(line 4) the Hoare annotation is: true [2022-04-15 13:01:24,272 INFO L878 garLoopResultBuilder]: At program point L4(line 4) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 13:01:24,272 INFO L878 garLoopResultBuilder]: At program point L4-1(line 4) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 13:01:24,272 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 13:01:24,274 INFO L719 BasicCegarLoop]: Path program histogram: [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:24,275 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 13:01:24,277 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 13:01:24,278 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 13:01:24,284 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 13:01:24,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:01:24 BoogieIcfgContainer [2022-04-15 13:01:24,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 13:01:24,295 INFO L158 Benchmark]: Toolchain (without parser) took 10202.32ms. Allocated memory was 228.6MB in the beginning and 333.4MB in the end (delta: 104.9MB). Free memory was 178.7MB in the beginning and 237.6MB in the end (delta: -58.8MB). Peak memory consumption was 45.9MB. Max. memory is 8.0GB. [2022-04-15 13:01:24,295 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 228.6MB. Free memory was 194.9MB in the beginning and 194.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:01:24,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.38ms. Allocated memory is still 228.6MB. Free memory was 178.6MB in the beginning and 205.1MB in the end (delta: -26.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:01:24,296 INFO L158 Benchmark]: Boogie Preprocessor took 44.55ms. Allocated memory is still 228.6MB. Free memory was 204.9MB in the beginning and 203.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 13:01:24,296 INFO L158 Benchmark]: RCFGBuilder took 221.17ms. Allocated memory is still 228.6MB. Free memory was 203.4MB in the beginning and 193.6MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 13:01:24,296 INFO L158 Benchmark]: TraceAbstraction took 9699.50ms. Allocated memory was 228.6MB in the beginning and 333.4MB in the end (delta: 104.9MB). Free memory was 193.0MB in the beginning and 237.6MB in the end (delta: -44.6MB). Peak memory consumption was 60.7MB. Max. memory is 8.0GB. [2022-04-15 13:01:24,298 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.15ms. Allocated memory is still 228.6MB. Free memory was 194.9MB in the beginning and 194.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.38ms. Allocated memory is still 228.6MB. Free memory was 178.6MB in the beginning and 205.1MB in the end (delta: -26.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.55ms. Allocated memory is still 228.6MB. Free memory was 204.9MB in the beginning and 203.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 221.17ms. Allocated memory is still 228.6MB. Free memory was 203.4MB in the beginning and 193.6MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9699.50ms. Allocated memory was 228.6MB in the beginning and 333.4MB in the end (delta: 104.9MB). Free memory was 193.0MB in the beginning and 237.6MB in the end (delta: -44.6MB). Peak memory consumption was 60.7MB. 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: 4]: 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 9, TraceHistogramMax: 7, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 110 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 222 SyntacticMatches, 15 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=8, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 68 PreInvPairs, 108 NumberOfFragments, 63 HoareAnnotationTreeSize, 68 FomulaSimplifications, 108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 516 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: 8]: Loop Invariant Derived loop invariant: x % 4294967296 < 10000000 || x % 2 == 0 - ProcedureContractResult [Line: 5]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 13:01:24,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...