/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/in-de62.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:58:25,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:58:25,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:58:25,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:58:25,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:58:25,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:58:25,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:58:25,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:58:25,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:58:25,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:58:25,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:58:25,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:58:25,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:58:25,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:58:25,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:58:25,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:58:25,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:58:25,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:58:25,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:58:25,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:58:25,277 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:58:25,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:58:25,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:58:25,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:58:25,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:58:25,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:58:25,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:58:25,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:58:25,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:58:25,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:58:25,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:58:25,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:58:25,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:58:25,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:58:25,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:58:25,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:58:25,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:58:25,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:58:25,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:58:25,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:58:25,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:58:25,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:58:25,300 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 12:58:25,307 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:58:25,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:58:25,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:58:25,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:58:25,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:58:25,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:58:25,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:58:25,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:58:25,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:58:25,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:58:25,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:58:25,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:58:25,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:58:25,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:58:25,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:58:25,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:58:25,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:58:25,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:58:25,310 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:58:25,310 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:58:25,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:58:25,311 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:58:25,311 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 12:58:25,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:58:25,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:58:25,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:58:25,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:58:25,500 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:58:25,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-04-15 12:58:25,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b44c505/671a0631fd314931820f8cc99b54075d/FLAGda8ba6995 [2022-04-15 12:58:25,870 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:58:25,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-04-15 12:58:25,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b44c505/671a0631fd314931820f8cc99b54075d/FLAGda8ba6995 [2022-04-15 12:58:26,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b44c505/671a0631fd314931820f8cc99b54075d [2022-04-15 12:58:26,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:58:26,325 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:58:26,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:58:26,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:58:26,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:58:26,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:58:26" (1/1) ... [2022-04-15 12:58:26,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7672cff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:58:26, skipping insertion in model container [2022-04-15 12:58:26,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:58:26" (1/1) ... [2022-04-15 12:58:26,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:58:26,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:58:26,456 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/in-de62.c[368,381] [2022-04-15 12:58:26,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:58:26,488 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:58:26,496 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/in-de62.c[368,381] [2022-04-15 12:58:26,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:58:26,510 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:58:26,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:58:26 WrapperNode [2022-04-15 12:58:26,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:58:26,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:58:26,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:58:26,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:58:26,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:58:26" (1/1) ... [2022-04-15 12:58:26,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:58:26" (1/1) ... [2022-04-15 12:58:26,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:58:26" (1/1) ... [2022-04-15 12:58:26,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:58:26" (1/1) ... [2022-04-15 12:58:26,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:58:26" (1/1) ... [2022-04-15 12:58:26,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:58:26" (1/1) ... [2022-04-15 12:58:26,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:58:26" (1/1) ... [2022-04-15 12:58:26,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:58:26,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:58:26,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:58:26,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:58:26,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:58:26" (1/1) ... [2022-04-15 12:58:26,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:58:26,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:58:26,567 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 12:58:26,574 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 12:58:26,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:58:26,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:58:26,592 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:58:26,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:58:26,593 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:58:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:58:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:58:26,633 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:58:26,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:58:26,796 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:58:26,803 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:58:26,803 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-15 12:58:26,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:58:26 BoogieIcfgContainer [2022-04-15 12:58:26,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:58:26,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:58:26,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:58:26,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:58:26,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:58:26" (1/3) ... [2022-04-15 12:58:26,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc52d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:58:26, skipping insertion in model container [2022-04-15 12:58:26,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:58:26" (2/3) ... [2022-04-15 12:58:26,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc52d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:58:26, skipping insertion in model container [2022-04-15 12:58:26,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:58:26" (3/3) ... [2022-04-15 12:58:26,815 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de62.c [2022-04-15 12:58:26,818 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:58:26,818 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:58:26,843 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:58:26,847 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 12:58:26,847 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:58:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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 12:58:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:58:26,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:26,870 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:26,870 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-04-15 12:58:26,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:26,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1654653459] [2022-04-15 12:58:26,885 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:58:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 2 times [2022-04-15 12:58:26,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:26,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789336056] [2022-04-15 12:58:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:26,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:27,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:27,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-15 12:58:27,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 12:58:27,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-15 12:58:27,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:27,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-15 12:58:27,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 12:58:27,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-15 12:58:27,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret17 := main(); {28#true} is VALID [2022-04-15 12:58:27,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28#true} is VALID [2022-04-15 12:58:27,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !(~x~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 12:58:27,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} ~z~0 := ~y~0; {28#true} is VALID [2022-04-15 12:58:27,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !(~z~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 12:58:27,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume !(~y~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 12:58:27,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-15 12:58:27,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !(~z~0 % 4294967296 > 0); {29#false} is VALID [2022-04-15 12:58:27,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !(~y~0 % 4294967296 > 0); {29#false} is VALID [2022-04-15 12:58:27,030 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-15 12:58:27,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 12:58:27,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 12:58:27,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 12:58:27,031 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 12:58:27,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:27,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789336056] [2022-04-15 12:58:27,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789336056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:27,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:27,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:58:27,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:27,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1654653459] [2022-04-15 12:58:27,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1654653459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:27,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:27,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:58:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131202496] [2022-04-15 12:58:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:27,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 12:58:27,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:27,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 12:58:27,072 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 12:58:27,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:58:27,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:27,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:58:27,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:58:27,093 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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 4.333333333333333) internal successors, (13), 2 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 12:58:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:27,168 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-15 12:58:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:58:27,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 12:58:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 12:58:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 12:58:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 12:58:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 12:58:27,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-15 12:58:27,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:27,238 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:58:27,238 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:58:27,240 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 12:58:27,243 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 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 12:58:27,245 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:58:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:58:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:58:27,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:27,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 12:58:27,265 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 12:58:27,266 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 12:58:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:27,267 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-15 12:58:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 12:58:27,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:27,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:27,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 18 states. [2022-04-15 12:58:27,268 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 18 states. [2022-04-15 12:58:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:27,270 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-15 12:58:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 12:58:27,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:27,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:27,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:27,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 12:58:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-15 12:58:27,272 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-15 12:58:27,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:27,272 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-15 12:58:27,273 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 12:58:27,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 23 transitions. [2022-04-15 12:58:27,289 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 12:58:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 12:58:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:58:27,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:27,290 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:27,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:58:27,290 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-04-15 12:58:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:27,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2089232690] [2022-04-15 12:58:27,291 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:58:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 2 times [2022-04-15 12:58:27,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:27,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779033618] [2022-04-15 12:58:27,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:27,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:27,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#(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(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-15 12:58:27,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 12:58:27,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-15 12:58:27,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:27,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#(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(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-15 12:58:27,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 12:58:27,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-15 12:58:27,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret17 := main(); {194#true} is VALID [2022-04-15 12:58:27,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {194#true} is VALID [2022-04-15 12:58:27,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !(~x~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 12:58:27,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} ~z~0 := ~y~0; {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 12:58:27,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 12:58:27,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 12:58:27,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~x~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 12:58:27,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 12:58:27,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 12:58:27,405 INFO L272 TraceCheckUtils]: 13: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:58:27,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {200#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {201#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:58:27,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {201#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {195#false} is VALID [2022-04-15 12:58:27,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-15 12:58:27,407 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 12:58:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:27,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779033618] [2022-04-15 12:58:27,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779033618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:27,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:27,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:58:27,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:27,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2089232690] [2022-04-15 12:58:27,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2089232690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:27,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:27,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:58:27,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856005929] [2022-04-15 12:58:27,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:27,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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 12:58:27,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:27,415 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), 4 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 12:58:27,428 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 12:58:27,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:58:27,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:27,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:58:27,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:58:27,429 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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 12:58:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:27,605 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-15 12:58:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:58:27,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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 12:58:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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 12:58:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 12:58:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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 12:58:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 12:58:27,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-15 12:58:27,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:27,655 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:58:27,656 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:58:27,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:58:27,658 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:27,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:58:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:58:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:58:27,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:27,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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 12:58:27,671 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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 12:58:27,672 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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 12:58:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:27,673 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-15 12:58:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 12:58:27,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:27,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:27,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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 12:58:27,675 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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 12:58:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:27,676 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-15 12:58:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 12:58:27,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:27,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:27,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:27,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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 12:58:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-15 12:58:27,679 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 17 [2022-04-15 12:58:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:27,680 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-15 12:58:27,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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 12:58:27,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 31 transitions. [2022-04-15 12:58:27,707 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 12:58:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 12:58:27,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:58:27,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:27,708 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:27,708 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:58:27,709 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1181238037, now seen corresponding path program 1 times [2022-04-15 12:58:27,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:27,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152612764] [2022-04-15 12:58:27,712 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:58:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1181238037, now seen corresponding path program 2 times [2022-04-15 12:58:27,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:27,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222110494] [2022-04-15 12:58:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:27,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:27,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:27,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(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(10, 2);call #Ultimate.allocInit(12, 3); {371#true} is VALID [2022-04-15 12:58:27,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-15 12:58:27,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #94#return; {371#true} is VALID [2022-04-15 12:58:27,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:27,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(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(10, 2);call #Ultimate.allocInit(12, 3); {371#true} is VALID [2022-04-15 12:58:27,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-15 12:58:27,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #94#return; {371#true} is VALID [2022-04-15 12:58:27,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret17 := main(); {371#true} is VALID [2022-04-15 12:58:27,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {371#true} is VALID [2022-04-15 12:58:27,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~x~0 % 4294967296 > 0); {371#true} is VALID [2022-04-15 12:58:27,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#true} ~z~0 := ~y~0; {371#true} is VALID [2022-04-15 12:58:27,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} assume !(~z~0 % 4294967296 > 0); {371#true} is VALID [2022-04-15 12:58:27,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} assume !(~y~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:58:27,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:58:27,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:58:27,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {372#false} is VALID [2022-04-15 12:58:27,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {372#false} assume !(~y~0 % 4294967296 > 0); {372#false} is VALID [2022-04-15 12:58:27,765 INFO L272 TraceCheckUtils]: 14: Hoare triple {372#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {372#false} is VALID [2022-04-15 12:58:27,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {372#false} ~cond := #in~cond; {372#false} is VALID [2022-04-15 12:58:27,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} assume 0 == ~cond; {372#false} is VALID [2022-04-15 12:58:27,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-04-15 12:58:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:58:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:27,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222110494] [2022-04-15 12:58:27,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222110494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:27,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:27,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:58:27,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:27,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152612764] [2022-04-15 12:58:27,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152612764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:27,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:27,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:58:27,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332671900] [2022-04-15 12:58:27,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:27,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2022-04-15 12:58:27,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:27,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 12:58:27,780 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 12:58:27,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:58:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:27,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:58:27,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:58:27,781 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 12:58:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:27,895 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2022-04-15 12:58:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:58:27,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2022-04-15 12:58:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 12:58:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-15 12:58:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 12:58:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-15 12:58:27,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-04-15 12:58:27,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:27,934 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:58:27,934 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:58:27,935 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 12:58:27,937 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:27,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:58:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:58:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 12:58:27,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:27,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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 12:58:27,956 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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 12:58:27,956 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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 12:58:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:27,958 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-04-15 12:58:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-15 12:58:27,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:27,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:27,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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 33 states. [2022-04-15 12:58:27,960 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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 33 states. [2022-04-15 12:58:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:27,965 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-04-15 12:58:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-15 12:58:27,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:27,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:27,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:27,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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 12:58:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2022-04-15 12:58:27,968 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 18 [2022-04-15 12:58:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:27,968 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-04-15 12:58:27,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 12:58:27,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 46 transitions. [2022-04-15 12:58:28,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-15 12:58:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:58:28,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:28,008 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:28,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:58:28,008 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:28,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:28,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1710900860, now seen corresponding path program 1 times [2022-04-15 12:58:28,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:28,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408867077] [2022-04-15 12:58:28,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:58:28,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1710900860, now seen corresponding path program 2 times [2022-04-15 12:58:28,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:28,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023991134] [2022-04-15 12:58:28,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:28,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:28,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:28,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {615#(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(10, 2);call #Ultimate.allocInit(12, 3); {609#true} is VALID [2022-04-15 12:58:28,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume true; {609#true} is VALID [2022-04-15 12:58:28,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {609#true} {609#true} #94#return; {609#true} is VALID [2022-04-15 12:58:28,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {609#true} call ULTIMATE.init(); {615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:28,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {615#(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(10, 2);call #Ultimate.allocInit(12, 3); {609#true} is VALID [2022-04-15 12:58:28,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {609#true} assume true; {609#true} is VALID [2022-04-15 12:58:28,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {609#true} {609#true} #94#return; {609#true} is VALID [2022-04-15 12:58:28,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {609#true} call #t~ret17 := main(); {609#true} is VALID [2022-04-15 12:58:28,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {609#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {609#true} is VALID [2022-04-15 12:58:28,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {609#true} assume !(~x~0 % 4294967296 > 0); {609#true} is VALID [2022-04-15 12:58:28,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#true} ~z~0 := ~y~0; {609#true} is VALID [2022-04-15 12:58:28,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#true} assume !(~z~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:58:28,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:58:28,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:58:28,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {610#false} is VALID [2022-04-15 12:58:28,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#false} assume !(~z~0 % 4294967296 > 0); {610#false} is VALID [2022-04-15 12:58:28,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {610#false} assume !(~y~0 % 4294967296 > 0); {610#false} is VALID [2022-04-15 12:58:28,060 INFO L272 TraceCheckUtils]: 14: Hoare triple {610#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {610#false} is VALID [2022-04-15 12:58:28,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#false} ~cond := #in~cond; {610#false} is VALID [2022-04-15 12:58:28,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {610#false} assume 0 == ~cond; {610#false} is VALID [2022-04-15 12:58:28,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#false} assume !false; {610#false} is VALID [2022-04-15 12:58:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:58:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:28,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023991134] [2022-04-15 12:58:28,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023991134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:28,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:28,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:58:28,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:28,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408867077] [2022-04-15 12:58:28,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408867077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:28,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:28,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:58:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241223343] [2022-04-15 12:58:28,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:28,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2022-04-15 12:58:28,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:28,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 12:58:28,073 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 12:58:28,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:58:28,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:28,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:58:28,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:58:28,074 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 12:58:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:28,149 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2022-04-15 12:58:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:58:28,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2022-04-15 12:58:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 12:58:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 12:58:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 12:58:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 12:58:28,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-15 12:58:28,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:28,175 INFO L225 Difference]: With dead ends: 49 [2022-04-15 12:58:28,175 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:58:28,176 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:58:28,176 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:28,176 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:58:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:58:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 12:58:28,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:28,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 12:58:28,208 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 12:58:28,208 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 12:58:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:28,209 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-15 12:58:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-15 12:58:28,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:28,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:28,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 37 states. [2022-04-15 12:58:28,210 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 37 states. [2022-04-15 12:58:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:28,211 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-15 12:58:28,211 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-15 12:58:28,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:28,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:28,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:28,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 12:58:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 12:58:28,212 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 18 [2022-04-15 12:58:28,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:28,213 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-04-15 12:58:28,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 12:58:28,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-15 12:58:28,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-15 12:58:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:58:28,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:28,252 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:28,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:58:28,252 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:28,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash 375506293, now seen corresponding path program 1 times [2022-04-15 12:58:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:28,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931716393] [2022-04-15 12:58:28,406 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash -289672842, now seen corresponding path program 1 times [2022-04-15 12:58:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:28,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201886697] [2022-04-15 12:58:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:28,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {876#(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(10, 2);call #Ultimate.allocInit(12, 3); {866#true} is VALID [2022-04-15 12:58:28,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 12:58:28,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {866#true} {866#true} #94#return; {866#true} is VALID [2022-04-15 12:58:28,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:28,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {876#(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(10, 2);call #Ultimate.allocInit(12, 3); {866#true} is VALID [2022-04-15 12:58:28,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 12:58:28,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #94#return; {866#true} is VALID [2022-04-15 12:58:28,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret17 := main(); {866#true} is VALID [2022-04-15 12:58:28,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {871#(= main_~y~0 0)} is VALID [2022-04-15 12:58:28,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {872#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:58:28,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {873#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:58:28,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [98] L23-2-->L29-1_primed: Formula: (or (and (= v_main_~z~0_In_1 v_main_~z~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post8_Out_2| 0) (= (+ v_main_~x~0_Out_2 v_main_~z~0_Out_2) (+ v_main_~z~0_In_1 v_main_~x~0_In_1)) (< 0 (mod (+ v_main_~z~0_Out_2 1) 4294967296)) (= |v_main_#t~post7_Out_2| 0))) InVars {main_~x~0=v_main_~x~0_In_1, main_~z~0=v_main_~z~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post8=|v_main_#t~post8_Out_2|, main_~z~0=v_main_~z~0_Out_2, main_#t~post7=|v_main_#t~post7_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {874#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} is VALID [2022-04-15 12:58:28,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {874#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} [97] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {874#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} is VALID [2022-04-15 12:58:28,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {874#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} is VALID [2022-04-15 12:58:28,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {874#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {875#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:58:28,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {875#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {867#false} is VALID [2022-04-15 12:58:28,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#false} assume !(~z~0 % 4294967296 > 0); {867#false} is VALID [2022-04-15 12:58:28,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {867#false} is VALID [2022-04-15 12:58:28,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#false} assume !(~y~0 % 4294967296 > 0); {867#false} is VALID [2022-04-15 12:58:28,543 INFO L272 TraceCheckUtils]: 16: Hoare triple {867#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {867#false} is VALID [2022-04-15 12:58:28,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2022-04-15 12:58:28,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2022-04-15 12:58:28,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-15 12:58:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:58:28,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:28,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201886697] [2022-04-15 12:58:28,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201886697] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:58:28,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323443375] [2022-04-15 12:58:28,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:28,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:58:28,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:58:28,546 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 12:58:28,568 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 12:58:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:28,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:58:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:28,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:58:38,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-15 12:58:38,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#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(10, 2);call #Ultimate.allocInit(12, 3); {866#true} is VALID [2022-04-15 12:58:38,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 12:58:38,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #94#return; {866#true} is VALID [2022-04-15 12:58:38,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret17 := main(); {866#true} is VALID [2022-04-15 12:58:38,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {871#(= main_~y~0 0)} is VALID [2022-04-15 12:58:38,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {872#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:58:38,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {873#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:58:38,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [98] L23-2-->L29-1_primed: Formula: (or (and (= v_main_~z~0_In_1 v_main_~z~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post8_Out_2| 0) (= (+ v_main_~x~0_Out_2 v_main_~z~0_Out_2) (+ v_main_~z~0_In_1 v_main_~x~0_In_1)) (< 0 (mod (+ v_main_~z~0_Out_2 1) 4294967296)) (= |v_main_#t~post7_Out_2| 0))) InVars {main_~x~0=v_main_~x~0_In_1, main_~z~0=v_main_~z~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post8=|v_main_#t~post8_Out_2|, main_~z~0=v_main_~z~0_Out_2, main_#t~post7=|v_main_#t~post7_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {904#(and (<= main_~z~0 0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ (* (- 1) main_~z~0) (* (- 1) main_~x~0)) (- 4294967296)) (div (+ main_~z~0 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:58:38,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {904#(and (<= main_~z~0 0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ (* (- 1) main_~z~0) (* (- 1) main_~x~0)) (- 4294967296)) (div (+ main_~z~0 main_~x~0) 4294967296)))} [97] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {908#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:58:38,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {908#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {908#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:58:38,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {908#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {867#false} is VALID [2022-04-15 12:58:38,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#false} assume !(~x~0 % 4294967296 > 0); {867#false} is VALID [2022-04-15 12:58:38,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#false} assume !(~z~0 % 4294967296 > 0); {867#false} is VALID [2022-04-15 12:58:38,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {867#false} is VALID [2022-04-15 12:58:38,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#false} assume !(~y~0 % 4294967296 > 0); {867#false} is VALID [2022-04-15 12:58:38,447 INFO L272 TraceCheckUtils]: 16: Hoare triple {867#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {867#false} is VALID [2022-04-15 12:58:38,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2022-04-15 12:58:38,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2022-04-15 12:58:38,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-15 12:58:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:58:38,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:58:38,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323443375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:38,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 12:58:38,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2022-04-15 12:58:39,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:39,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931716393] [2022-04-15 12:58:39,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931716393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:39,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:39,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:58:39,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487824453] [2022-04-15 12:58:39,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:39,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 20 [2022-04-15 12:58:39,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:39,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 12:58:39,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:39,129 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:58:39,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:39,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:58:39,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=97, Unknown=1, NotChecked=0, Total=132 [2022-04-15 12:58:39,130 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 12:58:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:39,273 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-15 12:58:39,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:58:39,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 20 [2022-04-15 12:58:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 12:58:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-15 12:58:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 12:58:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-15 12:58:39,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-15 12:58:39,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:39,337 INFO L225 Difference]: With dead ends: 49 [2022-04-15 12:58:39,337 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:58:39,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=42, Invalid=113, Unknown=1, NotChecked=0, Total=156 [2022-04-15 12:58:39,338 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:39,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2022-04-15 12:58:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:58:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 12:58:39,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:39,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 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 12:58:39,364 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 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 12:58:39,364 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 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 12:58:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:39,366 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-04-15 12:58:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2022-04-15 12:58:39,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:39,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:39,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 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 38 states. [2022-04-15 12:58:39,368 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 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 38 states. [2022-04-15 12:58:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:39,371 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-04-15 12:58:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2022-04-15 12:58:39,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:39,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:39,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:39,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 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 12:58:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 12:58:39,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 20 [2022-04-15 12:58:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:39,373 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2022-04-15 12:58:39,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 12:58:39,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-15 12:58:39,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2022-04-15 12:58:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:58:39,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:39,457 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:39,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:58:39,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:58:39,658 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:39,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1300031754, now seen corresponding path program 1 times [2022-04-15 12:58:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:39,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1045447673] [2022-04-15 12:58:43,971 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:43,972 INFO L85 PathProgramCache]: Analyzing trace with hash 313424023, now seen corresponding path program 1 times [2022-04-15 12:58:43,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:43,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445347727] [2022-04-15 12:58:43,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:43,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:44,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:44,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {1199#(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(10, 2);call #Ultimate.allocInit(12, 3); {1192#true} is VALID [2022-04-15 12:58:44,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1192#true} assume true; {1192#true} is VALID [2022-04-15 12:58:44,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1192#true} {1192#true} #94#return; {1192#true} is VALID [2022-04-15 12:58:44,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {1192#true} call ULTIMATE.init(); {1199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:44,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {1199#(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(10, 2);call #Ultimate.allocInit(12, 3); {1192#true} is VALID [2022-04-15 12:58:44,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1192#true} assume true; {1192#true} is VALID [2022-04-15 12:58:44,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1192#true} {1192#true} #94#return; {1192#true} is VALID [2022-04-15 12:58:44,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {1192#true} call #t~ret17 := main(); {1192#true} is VALID [2022-04-15 12:58:44,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1192#true} is VALID [2022-04-15 12:58:44,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {1192#true} [100] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~y~0_In_1 v_main_~y~0_Out_2)) (and (= 0 |v_main_#t~post6_Out_2|) (<= v_main_~x~0_Out_4 v_main_~x~0_In_2) (< 0 (mod (+ v_main_~x~0_Out_4 1) 4294967296)) (= |v_main_#t~post5_Out_2| 0) (= (+ v_main_~x~0_Out_4 v_main_~y~0_Out_2) (+ v_main_~x~0_In_2 v_main_~y~0_In_1)))) InVars {main_~x~0=v_main_~x~0_In_2, main_~y~0=v_main_~y~0_In_1} OutVars{main_~y~0=v_main_~y~0_Out_2, main_#t~post5=|v_main_#t~post5_Out_2|, main_~x~0=v_main_~x~0_Out_4, main_#t~post6=|v_main_#t~post6_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1192#true} is VALID [2022-04-15 12:58:44,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1192#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1192#true} is VALID [2022-04-15 12:58:44,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {1192#true} ~z~0 := ~y~0; {1197#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:58:44,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1198#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:44,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {1198#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1193#false} is VALID [2022-04-15 12:58:44,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {1193#false} assume !(~y~0 % 4294967296 > 0); {1193#false} is VALID [2022-04-15 12:58:44,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {1193#false} assume !(~x~0 % 4294967296 > 0); {1193#false} is VALID [2022-04-15 12:58:44,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {1193#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1193#false} is VALID [2022-04-15 12:58:44,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {1193#false} assume !(~z~0 % 4294967296 > 0); {1193#false} is VALID [2022-04-15 12:58:44,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {1193#false} assume !(~y~0 % 4294967296 > 0); {1193#false} is VALID [2022-04-15 12:58:44,026 INFO L272 TraceCheckUtils]: 16: Hoare triple {1193#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1193#false} is VALID [2022-04-15 12:58:44,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {1193#false} ~cond := #in~cond; {1193#false} is VALID [2022-04-15 12:58:44,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {1193#false} assume 0 == ~cond; {1193#false} is VALID [2022-04-15 12:58:44,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {1193#false} assume !false; {1193#false} is VALID [2022-04-15 12:58:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:58:44,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:44,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445347727] [2022-04-15 12:58:44,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445347727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:44,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:44,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:58:44,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:44,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1045447673] [2022-04-15 12:58:44,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1045447673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:44,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:44,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:58:44,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728740617] [2022-04-15 12:58:44,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:44,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2022-04-15 12:58:44,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:44,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 12:58:44,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:44,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:58:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:44,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:58:44,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:58:44,066 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 12:58:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:44,213 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-15 12:58:44,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:58:44,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2022-04-15 12:58:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:44,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 12:58:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 12:58:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 12:58:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 12:58:44,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-15 12:58:44,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:44,250 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:58:44,250 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:58:44,251 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:58:44,251 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:44,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 30 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:58:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:58:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 12:58:44,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:44,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 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 12:58:44,278 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 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 12:58:44,279 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 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 12:58:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:44,280 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 12:58:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 12:58:44,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:44,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:44,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 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 35 states. [2022-04-15 12:58:44,280 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 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 35 states. [2022-04-15 12:58:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:44,281 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 12:58:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 12:58:44,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:44,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:44,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:44,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 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 12:58:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-15 12:58:44,282 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 20 [2022-04-15 12:58:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:44,282 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-04-15 12:58:44,283 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 12:58:44,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2022-04-15 12:58:44,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 12:58:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:58:44,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:44,339 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:44,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:58:44,340 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash -68874311, now seen corresponding path program 2 times [2022-04-15 12:58:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:44,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [737159582] [2022-04-15 12:58:44,472 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1628787190, now seen corresponding path program 1 times [2022-04-15 12:58:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:44,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329562676] [2022-04-15 12:58:44,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:44,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:44,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {1452#(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(10, 2);call #Ultimate.allocInit(12, 3); {1442#true} is VALID [2022-04-15 12:58:44,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-15 12:58:44,630 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1442#true} {1442#true} #94#return; {1442#true} is VALID [2022-04-15 12:58:44,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {1442#true} call ULTIMATE.init(); {1452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:44,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {1452#(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(10, 2);call #Ultimate.allocInit(12, 3); {1442#true} is VALID [2022-04-15 12:58:44,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-15 12:58:44,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #94#return; {1442#true} is VALID [2022-04-15 12:58:44,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret17 := main(); {1442#true} is VALID [2022-04-15 12:58:44,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {1442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1447#(= main_~y~0 0)} is VALID [2022-04-15 12:58:44,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {1447#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {1448#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:58:44,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {1448#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {1449#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:58:44,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {1449#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [102] L23-2-->L29-1_primed: Formula: (or (and (< 0 (mod (+ v_main_~z~0_Out_4 1) 4294967296)) (= (+ v_main_~z~0_In_2 v_main_~x~0_In_3) (+ v_main_~x~0_Out_6 v_main_~z~0_Out_4)) (= |v_main_#t~post7_Out_4| 0) (= |v_main_#t~post8_Out_4| 0) (<= v_main_~x~0_In_3 v_main_~x~0_Out_6)) (and (= v_main_~x~0_In_3 v_main_~x~0_Out_6) (= v_main_~z~0_In_2 v_main_~z~0_Out_4))) InVars {main_~x~0=v_main_~x~0_In_3, main_~z~0=v_main_~z~0_In_2} OutVars{main_~x~0=v_main_~x~0_Out_6, main_#t~post8=|v_main_#t~post8_Out_4|, main_~z~0=v_main_~z~0_Out_4, main_#t~post7=|v_main_#t~post7_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {1450#(or (<= (+ 4294967296 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:58:44,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {1450#(or (<= (+ 4294967296 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [101] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {1451#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:44,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {1451#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1451#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:44,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {1451#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1443#false} is VALID [2022-04-15 12:58:44,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {1443#false} assume !(~x~0 % 4294967296 > 0); {1443#false} is VALID [2022-04-15 12:58:44,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {1443#false} assume !(~z~0 % 4294967296 > 0); {1443#false} is VALID [2022-04-15 12:58:44,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {1443#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1443#false} is VALID [2022-04-15 12:58:44,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {1443#false} assume !(~y~0 % 4294967296 > 0); {1443#false} is VALID [2022-04-15 12:58:44,638 INFO L272 TraceCheckUtils]: 16: Hoare triple {1443#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1443#false} is VALID [2022-04-15 12:58:44,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {1443#false} ~cond := #in~cond; {1443#false} is VALID [2022-04-15 12:58:44,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {1443#false} assume 0 == ~cond; {1443#false} is VALID [2022-04-15 12:58:44,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-15 12:58:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:58:44,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:44,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329562676] [2022-04-15 12:58:44,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329562676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:44,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:44,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:58:44,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:44,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [737159582] [2022-04-15 12:58:44,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [737159582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:44,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:44,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:58:44,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556539289] [2022-04-15 12:58:44,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 12:58:44,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:44,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 12:58:44,948 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 12:58:44,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:58:44,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:44,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:58:44,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:58:44,949 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 12:58:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:45,165 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-15 12:58:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:58:45,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 12:58:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 12:58:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-15 12:58:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 12:58:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-15 12:58:45,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2022-04-15 12:58:45,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:45,228 INFO L225 Difference]: With dead ends: 45 [2022-04-15 12:58:45,228 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:58:45,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:58:45,229 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:45,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 50 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 53 Invalid, 0 Unknown, 42 Unchecked, 0.0s Time] [2022-04-15 12:58:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:58:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 12:58:45,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:45,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 12:58:45,249 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 12:58:45,249 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 12:58:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:45,250 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-04-15 12:58:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-15 12:58:45,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:45,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:45,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 30 states. [2022-04-15 12:58:45,250 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 30 states. [2022-04-15 12:58:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:45,251 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-04-15 12:58:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-15 12:58:45,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:45,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:45,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:45,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 12:58:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-04-15 12:58:45,252 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 21 [2022-04-15 12:58:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:45,252 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-04-15 12:58:45,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 12:58:45,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 40 transitions. [2022-04-15 12:58:45,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-15 12:58:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:58:45,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:45,297 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:45,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:58:45,297 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:45,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash 30273528, now seen corresponding path program 1 times [2022-04-15 12:58:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:45,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063850376] [2022-04-15 12:58:45,426 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1779199497, now seen corresponding path program 1 times [2022-04-15 12:58:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:45,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461370728] [2022-04-15 12:58:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:45,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:45,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:45,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {1683#(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(10, 2);call #Ultimate.allocInit(12, 3); {1676#true} is VALID [2022-04-15 12:58:45,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {1676#true} assume true; {1676#true} is VALID [2022-04-15 12:58:45,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1676#true} {1676#true} #94#return; {1676#true} is VALID [2022-04-15 12:58:45,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:45,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {1683#(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(10, 2);call #Ultimate.allocInit(12, 3); {1676#true} is VALID [2022-04-15 12:58:45,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2022-04-15 12:58:45,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #94#return; {1676#true} is VALID [2022-04-15 12:58:45,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret17 := main(); {1676#true} is VALID [2022-04-15 12:58:45,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {1676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1676#true} is VALID [2022-04-15 12:58:45,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {1676#true} [104] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~y~0_In_2 v_main_~y~0_Out_4)) (and (= (+ v_main_~x~0_Out_8 v_main_~y~0_Out_4) (+ v_main_~x~0_In_4 v_main_~y~0_In_2)) (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= |v_main_#t~post5_Out_4| 0) (= 0 |v_main_#t~post6_Out_4|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1676#true} is VALID [2022-04-15 12:58:45,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1676#true} is VALID [2022-04-15 12:58:45,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {1676#true} ~z~0 := ~y~0; {1681#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:58:45,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {1681#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:58:45,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:58:45,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {1677#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1677#false} is VALID [2022-04-15 12:58:45,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#false} assume !(~x~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#false} assume !(~z~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1677#false} is VALID [2022-04-15 12:58:45,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {1677#false} assume !(~y~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,491 INFO L272 TraceCheckUtils]: 17: Hoare triple {1677#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1677#false} is VALID [2022-04-15 12:58:45,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2022-04-15 12:58:45,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2022-04-15 12:58:45,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2022-04-15 12:58:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:58:45,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:45,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461370728] [2022-04-15 12:58:45,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461370728] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:58:45,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789197546] [2022-04-15 12:58:45,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:45,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:58:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:58:45,493 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 12:58:45,494 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 12:58:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:45,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:58:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:45,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:58:45,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2022-04-15 12:58:45,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {1676#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(10, 2);call #Ultimate.allocInit(12, 3); {1676#true} is VALID [2022-04-15 12:58:45,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2022-04-15 12:58:45,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #94#return; {1676#true} is VALID [2022-04-15 12:58:45,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret17 := main(); {1676#true} is VALID [2022-04-15 12:58:45,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {1676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1676#true} is VALID [2022-04-15 12:58:45,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {1676#true} [104] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~y~0_In_2 v_main_~y~0_Out_4)) (and (= (+ v_main_~x~0_Out_8 v_main_~y~0_Out_4) (+ v_main_~x~0_In_4 v_main_~y~0_In_2)) (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= |v_main_#t~post5_Out_4| 0) (= 0 |v_main_#t~post6_Out_4|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1676#true} is VALID [2022-04-15 12:58:45,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1676#true} is VALID [2022-04-15 12:58:45,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {1676#true} ~z~0 := ~y~0; {1681#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:58:45,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {1681#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:58:45,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:58:45,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {1677#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1677#false} is VALID [2022-04-15 12:58:45,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#false} assume !(~x~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#false} assume !(~z~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1677#false} is VALID [2022-04-15 12:58:45,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {1677#false} assume !(~y~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,721 INFO L272 TraceCheckUtils]: 17: Hoare triple {1677#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1677#false} is VALID [2022-04-15 12:58:45,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2022-04-15 12:58:45,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2022-04-15 12:58:45,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2022-04-15 12:58:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:58:45,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:58:45,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2022-04-15 12:58:45,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2022-04-15 12:58:45,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2022-04-15 12:58:45,921 INFO L272 TraceCheckUtils]: 17: Hoare triple {1677#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1677#false} is VALID [2022-04-15 12:58:45,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {1677#false} assume !(~y~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1677#false} is VALID [2022-04-15 12:58:45,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#false} assume !(~z~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#false} assume !(~x~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {1677#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1677#false} is VALID [2022-04-15 12:58:45,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-15 12:58:45,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:58:45,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {1780#(or (not (< 0 (mod main_~z~0 4294967296))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1682#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:58:45,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {1676#true} ~z~0 := ~y~0; {1780#(or (not (< 0 (mod main_~z~0 4294967296))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 12:58:45,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1676#true} is VALID [2022-04-15 12:58:45,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {1676#true} [104] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~y~0_In_2 v_main_~y~0_Out_4)) (and (= (+ v_main_~x~0_Out_8 v_main_~y~0_Out_4) (+ v_main_~x~0_In_4 v_main_~y~0_In_2)) (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= |v_main_#t~post5_Out_4| 0) (= 0 |v_main_#t~post6_Out_4|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1676#true} is VALID [2022-04-15 12:58:45,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {1676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1676#true} is VALID [2022-04-15 12:58:45,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret17 := main(); {1676#true} is VALID [2022-04-15 12:58:45,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #94#return; {1676#true} is VALID [2022-04-15 12:58:45,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2022-04-15 12:58:45,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {1676#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(10, 2);call #Ultimate.allocInit(12, 3); {1676#true} is VALID [2022-04-15 12:58:45,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2022-04-15 12:58:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:58:45,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789197546] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 12:58:45,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:58:45,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 6 [2022-04-15 12:58:45,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:45,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063850376] [2022-04-15 12:58:45,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063850376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:45,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:45,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:58:45,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7428605] [2022-04-15 12:58:45,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:45,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 21 [2022-04-15 12:58:45,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:45,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 12:58:45,969 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 12:58:45,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:58:45,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:45,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:58:45,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:58:45,970 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 12:58:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:46,104 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 12:58:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:58:46,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 21 [2022-04-15 12:58:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 12:58:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 12:58:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 12:58:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 12:58:46,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 12:58:46,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:46,148 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:58:46,148 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:58:46,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:58:46,149 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:46,149 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:58:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:58:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-15 12:58:46,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:46,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 12:58:46,173 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 12:58:46,173 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 12:58:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:46,174 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-15 12:58:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-15 12:58:46,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:46,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:46,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 29 states. [2022-04-15 12:58:46,174 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 29 states. [2022-04-15 12:58:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:46,175 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-15 12:58:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-15 12:58:46,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:46,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:46,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:46,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 12:58:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-04-15 12:58:46,176 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 21 [2022-04-15 12:58:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:46,176 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-04-15 12:58:46,176 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 12:58:46,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 35 transitions. [2022-04-15 12:58:46,218 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 12:58:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 12:58:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:58:46,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:46,219 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:46,236 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 12:58:46,427 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,SelfDestructingSolverStorable7 [2022-04-15 12:58:46,427 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:46,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1232820840, now seen corresponding path program 1 times [2022-04-15 12:58:46,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:46,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [934167067] [2022-04-15 12:58:46,565 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:46,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1038307497, now seen corresponding path program 1 times [2022-04-15 12:58:46,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:46,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372958704] [2022-04-15 12:58:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:46,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:46,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {2013#(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(10, 2);call #Ultimate.allocInit(12, 3); {2003#true} is VALID [2022-04-15 12:58:46,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {2003#true} assume true; {2003#true} is VALID [2022-04-15 12:58:46,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2003#true} {2003#true} #94#return; {2003#true} is VALID [2022-04-15 12:58:46,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {2003#true} call ULTIMATE.init(); {2013#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:46,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {2013#(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(10, 2);call #Ultimate.allocInit(12, 3); {2003#true} is VALID [2022-04-15 12:58:46,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {2003#true} assume true; {2003#true} is VALID [2022-04-15 12:58:46,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2003#true} {2003#true} #94#return; {2003#true} is VALID [2022-04-15 12:58:46,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {2003#true} call #t~ret17 := main(); {2003#true} is VALID [2022-04-15 12:58:46,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {2003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2008#(= main_~y~0 0)} is VALID [2022-04-15 12:58:46,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {2008#(= main_~y~0 0)} [106] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= |v_main_#t~post5_Out_6| 0) (= 0 |v_main_#t~post6_Out_6|) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_3) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_6)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2009#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:58:46,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {2009#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2009#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:58:46,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {2009#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} ~z~0 := ~y~0; {2010#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:58:46,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {2010#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2011#(and (not (= main_~y~0 0)) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} is VALID [2022-04-15 12:58:46,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {2011#(and (not (= main_~y~0 0)) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {2011#(and (not (= main_~y~0 0)) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} is VALID [2022-04-15 12:58:46,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {2011#(and (not (= main_~y~0 0)) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2012#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:58:46,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {2012#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2012#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:58:46,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {2012#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2004#false} is VALID [2022-04-15 12:58:46,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {2004#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2004#false} is VALID [2022-04-15 12:58:46,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {2004#false} assume !(~z~0 % 4294967296 > 0); {2004#false} is VALID [2022-04-15 12:58:46,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {2004#false} assume !(~y~0 % 4294967296 > 0); {2004#false} is VALID [2022-04-15 12:58:46,678 INFO L272 TraceCheckUtils]: 17: Hoare triple {2004#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2004#false} is VALID [2022-04-15 12:58:46,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {2004#false} ~cond := #in~cond; {2004#false} is VALID [2022-04-15 12:58:46,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {2004#false} assume 0 == ~cond; {2004#false} is VALID [2022-04-15 12:58:46,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {2004#false} assume !false; {2004#false} is VALID [2022-04-15 12:58:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:58:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:46,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372958704] [2022-04-15 12:58:46,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372958704] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:58:46,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408605576] [2022-04-15 12:58:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:46,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:58:46,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:58:46,680 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 12:58:46,681 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 12:58:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:46,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:58:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:46,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:58:47,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {2003#true} call ULTIMATE.init(); {2003#true} is VALID [2022-04-15 12:58:47,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {2003#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(10, 2);call #Ultimate.allocInit(12, 3); {2003#true} is VALID [2022-04-15 12:58:47,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {2003#true} assume true; {2003#true} is VALID [2022-04-15 12:58:47,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2003#true} {2003#true} #94#return; {2003#true} is VALID [2022-04-15 12:58:47,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {2003#true} call #t~ret17 := main(); {2003#true} is VALID [2022-04-15 12:58:47,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {2003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2008#(= main_~y~0 0)} is VALID [2022-04-15 12:58:47,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {2008#(= main_~y~0 0)} [106] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= |v_main_#t~post5_Out_6| 0) (= 0 |v_main_#t~post6_Out_6|) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_3) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_6)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2035#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:58:47,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {2035#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2035#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:58:47,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {2035#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {2042#(or (= main_~z~0 0) (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= 0 main_~z~0)))} is VALID [2022-04-15 12:58:47,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {2042#(or (= main_~z~0 0) (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2046#(or (and (<= 0 (+ main_~z~0 1)) (< 0 (mod main_~x~0 4294967296))) (= (+ main_~z~0 1) 0))} is VALID [2022-04-15 12:58:47,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {2046#(or (and (<= 0 (+ main_~z~0 1)) (< 0 (mod main_~x~0 4294967296))) (= (+ main_~z~0 1) 0))} assume !(~z~0 % 4294967296 > 0); {2012#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:58:47,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {2012#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2012#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:58:47,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {2012#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2012#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:58:47,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {2012#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2004#false} is VALID [2022-04-15 12:58:47,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {2004#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2004#false} is VALID [2022-04-15 12:58:47,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {2004#false} assume !(~z~0 % 4294967296 > 0); {2004#false} is VALID [2022-04-15 12:58:47,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {2004#false} assume !(~y~0 % 4294967296 > 0); {2004#false} is VALID [2022-04-15 12:58:47,079 INFO L272 TraceCheckUtils]: 17: Hoare triple {2004#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2004#false} is VALID [2022-04-15 12:58:47,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {2004#false} ~cond := #in~cond; {2004#false} is VALID [2022-04-15 12:58:47,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {2004#false} assume 0 == ~cond; {2004#false} is VALID [2022-04-15 12:58:47,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {2004#false} assume !false; {2004#false} is VALID [2022-04-15 12:58:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:58:47,080 INFO L328 TraceCheckSpWp]: Computing backward predicates...