/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested3-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:54:19,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:54:19,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:54:19,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:54:19,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:54:19,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:54:19,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:54:19,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:54:19,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:54:19,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:54:19,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:54:19,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:54:19,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:54:19,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:54:19,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:54:19,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:54:19,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:54:19,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:54:19,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:54:19,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:54:19,860 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:54:19,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:54:19,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:54:19,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:54:19,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:54:19,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:54:19,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:54:19,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:54:19,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:54:19,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:54:19,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:54:19,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:54:19,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:54:19,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:54:19,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:54:19,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:54:19,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:54:19,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:54:19,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:54:19,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:54:19,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:54:19,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:54:19,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:54:19,892 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:54:19,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:54:19,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:54:19,894 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:54:19,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:54:19,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:54:19,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:54:19,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:54:19,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:54:19,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:54:19,896 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:54:19,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:54:19,896 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:54:19,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:54:19,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:54:19,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:54:19,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:54:19,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:54:19,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:54:19,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:54:19,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:54:19,897 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:54:19,897 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:54:19,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:54:19,897 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:54:19,897 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 06:54:20,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:54:20,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:54:20,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:54:20,155 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:54:20,156 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:54:20,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-1.c [2022-04-15 06:54:20,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd3b4dcf/7cef35ad52f64ac9a811b281ff153788/FLAG1a900b7b2 [2022-04-15 06:54:20,579 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:54:20,580 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-1.c [2022-04-15 06:54:20,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd3b4dcf/7cef35ad52f64ac9a811b281ff153788/FLAG1a900b7b2 [2022-04-15 06:54:21,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd3b4dcf/7cef35ad52f64ac9a811b281ff153788 [2022-04-15 06:54:21,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:54:21,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:54:21,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:54:21,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:54:21,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:54:21,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:54:21" (1/1) ... [2022-04-15 06:54:21,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1991250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:21, skipping insertion in model container [2022-04-15 06:54:21,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:54:21" (1/1) ... [2022-04-15 06:54:21,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:54:21,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:54:21,174 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/nested3-1.c[321,334] [2022-04-15 06:54:21,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:54:21,195 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:54:21,205 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/nested3-1.c[321,334] [2022-04-15 06:54:21,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:54:21,220 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:54:21,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:21 WrapperNode [2022-04-15 06:54:21,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:54:21,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:54:21,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:54:21,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:54:21,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:21" (1/1) ... [2022-04-15 06:54:21,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:21" (1/1) ... [2022-04-15 06:54:21,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:21" (1/1) ... [2022-04-15 06:54:21,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:21" (1/1) ... [2022-04-15 06:54:21,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:21" (1/1) ... [2022-04-15 06:54:21,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:21" (1/1) ... [2022-04-15 06:54:21,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:21" (1/1) ... [2022-04-15 06:54:21,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:54:21,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:54:21,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:54:21,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:54:21,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:21" (1/1) ... [2022-04-15 06:54:21,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:54:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:21,285 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 06:54:21,286 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 06:54:21,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:54:21,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:54:21,314 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:54:21,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:54:21,314 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:54:21,314 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:54:21,314 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:54:21,314 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:54:21,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:54:21,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:54:21,315 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:54:21,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:54:21,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:54:21,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:54:21,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:54:21,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:54:21,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:54:21,364 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:54:21,365 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:54:21,521 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:54:21,540 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:54:21,540 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 06:54:21,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:54:21 BoogieIcfgContainer [2022-04-15 06:54:21,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:54:21,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:54:21,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:54:21,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:54:21,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:54:21" (1/3) ... [2022-04-15 06:54:21,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa03398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:54:21, skipping insertion in model container [2022-04-15 06:54:21,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:21" (2/3) ... [2022-04-15 06:54:21,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa03398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:54:21, skipping insertion in model container [2022-04-15 06:54:21,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:54:21" (3/3) ... [2022-04-15 06:54:21,556 INFO L111 eAbstractionObserver]: Analyzing ICFG nested3-1.c [2022-04-15 06:54:21,562 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:54:21,562 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:54:21,595 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:54:21,601 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 06:54:21,601 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:54:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:54:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:54:21,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:21,621 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:21,621 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:21,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1794590667, now seen corresponding path program 1 times [2022-04-15 06:54:21,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:21,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1431864899] [2022-04-15 06:54:21,643 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:54:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1794590667, now seen corresponding path program 2 times [2022-04-15 06:54:21,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:21,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117560406] [2022-04-15 06:54:21,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:21,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:21,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:21,855 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(12, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-15 06:54:21,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 06:54:21,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-15 06:54:21,858 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 06:54:21,858 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(12, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-15 06:54:21,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 06:54:21,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-15 06:54:21,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret7 := main(); {28#true} is VALID [2022-04-15 06:54:21,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {28#true} is VALID [2022-04-15 06:54:21,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-15 06:54:21,864 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {29#false} is VALID [2022-04-15 06:54:21,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 06:54:21,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 06:54:21,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 06:54:21,866 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 06:54:21,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:21,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117560406] [2022-04-15 06:54:21,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117560406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:21,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:21,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:54:21,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:21,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1431864899] [2022-04-15 06:54:21,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1431864899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:21,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:21,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:54:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008606663] [2022-04-15 06:54:21,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:21,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:54:21,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:21,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:21,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:21,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:54:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:21,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:54:21,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:54:21,931 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:22,078 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-15 06:54:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:54:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:54:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-15 06:54:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-15 06:54:22,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-15 06:54:22,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:22,200 INFO L225 Difference]: With dead ends: 44 [2022-04-15 06:54:22,200 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 06:54:22,203 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 06:54:22,207 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:22,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:54:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 06:54:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 06:54:22,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:22,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:22,245 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:22,245 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:22,248 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 06:54:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 06:54:22,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:22,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:22,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-15 06:54:22,250 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-15 06:54:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:22,256 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 06:54:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 06:54:22,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:22,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:22,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:22,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-15 06:54:22,262 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-04-15 06:54:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:22,263 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-15 06:54:22,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:22,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-15 06:54:22,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 06:54:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:54:22,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:22,319 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:22,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:54:22,319 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:22,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1824143339, now seen corresponding path program 1 times [2022-04-15 06:54:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:22,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1537369400] [2022-04-15 06:54:22,323 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:54:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1824143339, now seen corresponding path program 2 times [2022-04-15 06:54:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:22,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793895726] [2022-04-15 06:54:22,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:22,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#(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(12, 2);call #Ultimate.allocInit(12, 3); {204#true} is VALID [2022-04-15 06:54:22,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-15 06:54:22,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} #63#return; {204#true} is VALID [2022-04-15 06:54:22,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:22,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#(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(12, 2);call #Ultimate.allocInit(12, 3); {204#true} is VALID [2022-04-15 06:54:22,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-15 06:54:22,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #63#return; {204#true} is VALID [2022-04-15 06:54:22,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret7 := main(); {204#true} is VALID [2022-04-15 06:54:22,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {209#(= main_~x~0 0)} is VALID [2022-04-15 06:54:22,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {205#false} is VALID [2022-04-15 06:54:22,489 INFO L272 TraceCheckUtils]: 7: Hoare triple {205#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {205#false} is VALID [2022-04-15 06:54:22,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {205#false} ~cond := #in~cond; {205#false} is VALID [2022-04-15 06:54:22,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {205#false} assume 0 == ~cond; {205#false} is VALID [2022-04-15 06:54:22,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {205#false} assume !false; {205#false} is VALID [2022-04-15 06:54:22,490 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 06:54:22,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:22,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793895726] [2022-04-15 06:54:22,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793895726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:22,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:22,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:22,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:22,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1537369400] [2022-04-15 06:54:22,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1537369400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:22,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:22,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714088607] [2022-04-15 06:54:22,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:22,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:54:22,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:22,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:22,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:22,508 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:54:22,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:22,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:54:22,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:54:22,510 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:22,652 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 06:54:22,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:54:22,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:54:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-15 06:54:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-15 06:54:22,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-15 06:54:22,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:22,706 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:54:22,706 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:54:22,708 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 06:54:22,711 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:22,712 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:54:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:54:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-04-15 06:54:22,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:22,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:22,720 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:22,720 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:22,723 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-15 06:54:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 06:54:22,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:22,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:22,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 06:54:22,724 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 06:54:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:22,726 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-15 06:54:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 06:54:22,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:22,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:22,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:22,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-15 06:54:22,729 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2022-04-15 06:54:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:22,730 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-15 06:54:22,730 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:22,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2022-04-15 06:54:22,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-15 06:54:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:54:22,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:22,765 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:22,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:54:22,766 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:22,767 INFO L85 PathProgramCache]: Analyzing trace with hash -699512288, now seen corresponding path program 1 times [2022-04-15 06:54:22,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:22,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [445743451] [2022-04-15 06:54:22,773 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:54:22,773 INFO L85 PathProgramCache]: Analyzing trace with hash -699512288, now seen corresponding path program 2 times [2022-04-15 06:54:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:22,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105480851] [2022-04-15 06:54:22,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#(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(12, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-15 06:54:22,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-15 06:54:22,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} #63#return; {379#true} is VALID [2022-04-15 06:54:22,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:22,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#(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(12, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-15 06:54:22,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-15 06:54:22,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #63#return; {379#true} is VALID [2022-04-15 06:54:22,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret7 := main(); {379#true} is VALID [2022-04-15 06:54:22,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {379#true} is VALID [2022-04-15 06:54:22,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {384#(= main_~y~0 0)} is VALID [2022-04-15 06:54:22,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#(= main_~y~0 0)} assume !(~y~0 % 4294967296 < 268435455); {380#false} is VALID [2022-04-15 06:54:22,849 INFO L272 TraceCheckUtils]: 8: Hoare triple {380#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {380#false} is VALID [2022-04-15 06:54:22,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2022-04-15 06:54:22,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {380#false} assume 0 == ~cond; {380#false} is VALID [2022-04-15 06:54:22,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-15 06:54:22,850 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 06:54:22,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:22,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105480851] [2022-04-15 06:54:22,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105480851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:22,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:22,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:22,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:22,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [445743451] [2022-04-15 06:54:22,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [445743451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:22,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:22,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:22,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754814333] [2022-04-15 06:54:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:22,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 06:54:22,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:22,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 06:54:22,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:22,863 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:54:22,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:22,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:54:22,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:54:22,864 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 06:54:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:22,975 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 06:54:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:54:22,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 06:54:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 06:54:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 06:54:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 06:54:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 06:54:22,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 06:54:23,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:23,033 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:54:23,033 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 06:54:23,034 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 06:54:23,035 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:23,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:54:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 06:54:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-15 06:54:23,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:23,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:23,040 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:23,040 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:23,042 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 06:54:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 06:54:23,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:23,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:23,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 06:54:23,043 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 06:54:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:23,045 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 06:54:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 06:54:23,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:23,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:23,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:23,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-15 06:54:23,047 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2022-04-15 06:54:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:23,047 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-15 06:54:23,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 06:54:23,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-15 06:54:23,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 06:54:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:54:23,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:23,075 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:23,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:54:23,075 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:23,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash -185588926, now seen corresponding path program 1 times [2022-04-15 06:54:23,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:23,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1535677139] [2022-04-15 06:54:23,077 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:54:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash -185588926, now seen corresponding path program 2 times [2022-04-15 06:54:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:23,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121425858] [2022-04-15 06:54:23,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:23,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:23,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#(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(12, 2);call #Ultimate.allocInit(12, 3); {563#true} is VALID [2022-04-15 06:54:23,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-15 06:54:23,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {563#true} {563#true} #63#return; {563#true} is VALID [2022-04-15 06:54:23,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {563#true} call ULTIMATE.init(); {569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:23,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#(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(12, 2);call #Ultimate.allocInit(12, 3); {563#true} is VALID [2022-04-15 06:54:23,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-15 06:54:23,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} #63#return; {563#true} is VALID [2022-04-15 06:54:23,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {563#true} call #t~ret7 := main(); {563#true} is VALID [2022-04-15 06:54:23,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {563#true} is VALID [2022-04-15 06:54:23,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {563#true} is VALID [2022-04-15 06:54:23,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {568#(= main_~z~0 0)} is VALID [2022-04-15 06:54:23,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {568#(= main_~z~0 0)} assume !(~z~0 % 4294967296 < 268435455); {564#false} is VALID [2022-04-15 06:54:23,131 INFO L272 TraceCheckUtils]: 9: Hoare triple {564#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {564#false} is VALID [2022-04-15 06:54:23,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {564#false} ~cond := #in~cond; {564#false} is VALID [2022-04-15 06:54:23,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#false} assume 0 == ~cond; {564#false} is VALID [2022-04-15 06:54:23,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#false} assume !false; {564#false} is VALID [2022-04-15 06:54:23,132 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 06:54:23,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:23,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121425858] [2022-04-15 06:54:23,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121425858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:23,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:23,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:23,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:23,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1535677139] [2022-04-15 06:54:23,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1535677139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:23,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:23,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:23,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606930275] [2022-04-15 06:54:23,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:23,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:54:23,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:23,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:23,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:23,144 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:54:23,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:23,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:54:23,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:54:23,145 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:23,218 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-15 06:54:23,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:54:23,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:54:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 06:54:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 06:54:23,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-15 06:54:23,261 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 06:54:23,262 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:54:23,262 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 06:54:23,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 06:54:23,264 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:23,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:54:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 06:54:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-15 06:54:23,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:23,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:23,268 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:23,269 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:23,270 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 06:54:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 06:54:23,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:23,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:23,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-15 06:54:23,271 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-15 06:54:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:23,272 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 06:54:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 06:54:23,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:23,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:23,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:23,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-15 06:54:23,274 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-04-15 06:54:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:23,275 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-15 06:54:23,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:23,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-15 06:54:23,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 06:54:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:54:23,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:23,303 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:23,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:54:23,303 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:23,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1431986846, now seen corresponding path program 1 times [2022-04-15 06:54:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:23,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812237833] [2022-04-15 06:54:24,727 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:24,733 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:24,735 INFO L85 PathProgramCache]: Analyzing trace with hash -278509117, now seen corresponding path program 1 times [2022-04-15 06:54:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:24,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091007266] [2022-04-15 06:54:24,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:24,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:24,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#(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(12, 2);call #Ultimate.allocInit(12, 3); {747#true} is VALID [2022-04-15 06:54:24,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-15 06:54:24,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {747#true} {747#true} #63#return; {747#true} is VALID [2022-04-15 06:54:24,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {757#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:24,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#(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(12, 2);call #Ultimate.allocInit(12, 3); {747#true} is VALID [2022-04-15 06:54:24,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-15 06:54:24,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {747#true} {747#true} #63#return; {747#true} is VALID [2022-04-15 06:54:24,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {747#true} call #t~ret7 := main(); {747#true} is VALID [2022-04-15 06:54:24,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {747#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {747#true} is VALID [2022-04-15 06:54:24,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {747#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {747#true} is VALID [2022-04-15 06:54:24,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {752#(= main_~z~0 0)} is VALID [2022-04-15 06:54:24,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {752#(= main_~z~0 0)} [73] L24-2-->L24-3_primed: Formula: (let ((.cse0 (mod v_main_~z~0_9 4294967296)) (.cse1 (= v_main_~z~0_9 v_main_~z~0_8)) (.cse2 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and (< .cse0 268435455) (<= (div (+ 268435455 (* (- 1) v_main_~z~0_8)) (- 4294967296)) (+ (div (+ v_main_~z~0_9 (- 4294967295)) 4294967296) 1)) (< v_main_~z~0_9 v_main_~z~0_8)) (and (<= 268435455 .cse0) .cse1 .cse2) (and .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~z~0=v_main_~z~0_9} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {753#(and (<= (div (+ (* (- 1) main_~z~0) 268435455) (- 4294967296)) 0) (<= 0 main_~z~0))} is VALID [2022-04-15 06:54:24,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#(and (<= (div (+ (* (- 1) main_~z~0) 268435455) (- 4294967296)) 0) (<= 0 main_~z~0))} [72] L24-3_primed-->L24-3: Formula: (not (< (mod v_main_~z~0_1 4294967296) 268435455)) InVars {main_~z~0=v_main_~z~0_1} OutVars{main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[] {754#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= (+ 268435455 (* (div (+ (* (- 1) main_~z~0) 268435455) (- 4294967296)) 4294967296) (* (div main_~z~0 4294967296) 4294967296)) main_~z~0))} is VALID [2022-04-15 06:54:24,924 INFO L272 TraceCheckUtils]: 10: Hoare triple {754#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= (+ 268435455 (* (div (+ (* (- 1) main_~z~0) 268435455) (- 4294967296)) 4294967296) (* (div main_~z~0 4294967296) 4294967296)) main_~z~0))} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {755#(or (<= 3 |__VERIFIER_assert_#in~cond|) (<= (+ |__VERIFIER_assert_#in~cond| 1) 0))} is VALID [2022-04-15 06:54:24,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {755#(or (<= 3 |__VERIFIER_assert_#in~cond|) (<= (+ |__VERIFIER_assert_#in~cond| 1) 0))} ~cond := #in~cond; {756#(or (<= 3 __VERIFIER_assert_~cond) (<= (+ __VERIFIER_assert_~cond 1) 0))} is VALID [2022-04-15 06:54:24,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {756#(or (<= 3 __VERIFIER_assert_~cond) (<= (+ __VERIFIER_assert_~cond 1) 0))} assume 0 == ~cond; {748#false} is VALID [2022-04-15 06:54:24,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-04-15 06:54:24,925 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 06:54:24,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:24,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091007266] [2022-04-15 06:54:24,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091007266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:24,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:24,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:54:24,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:24,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812237833] [2022-04-15 06:54:24,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812237833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:24,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:24,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:54:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934869814] [2022-04-15 06:54:24,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:24,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-15 06:54:24,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:24,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 06:54:25,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:25,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:54:25,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:25,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:54:25,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:54:25,021 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 06:54:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:25,425 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-15 06:54:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:54:25,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-15 06:54:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 06:54:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 06:54:25,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 06:54:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 06:54:25,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-15 06:54:25,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:25,474 INFO L225 Difference]: With dead ends: 30 [2022-04-15 06:54:25,474 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 06:54:25,475 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:54:25,475 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:25,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 42 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:54:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 06:54:25,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-15 06:54:25,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:25,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:25,518 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:25,518 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:25,519 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 06:54:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 06:54:25,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:25,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:25,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-15 06:54:25,520 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-15 06:54:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:25,522 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 06:54:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 06:54:25,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:25,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:25,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:25,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 06:54:25,523 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 14 [2022-04-15 06:54:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:25,524 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 06:54:25,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 06:54:25,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 06:54:25,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 06:54:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:54:25,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:25,572 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 06:54:25,572 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:54:25,572 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:25,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash -413054462, now seen corresponding path program 1 times [2022-04-15 06:54:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:25,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [948387469] [2022-04-15 06:54:26,193 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:26,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:26,354 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:26,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1284716088, now seen corresponding path program 1 times [2022-04-15 06:54:26,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:26,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685998704] [2022-04-15 06:54:26,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:26,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:26,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:26,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {949#(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(12, 2);call #Ultimate.allocInit(12, 3); {943#true} is VALID [2022-04-15 06:54:26,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {943#true} assume true; {943#true} is VALID [2022-04-15 06:54:26,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {943#true} {943#true} #63#return; {943#true} is VALID [2022-04-15 06:54:26,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {943#true} call ULTIMATE.init(); {949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:26,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {949#(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(12, 2);call #Ultimate.allocInit(12, 3); {943#true} is VALID [2022-04-15 06:54:26,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {943#true} assume true; {943#true} is VALID [2022-04-15 06:54:26,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {943#true} {943#true} #63#return; {943#true} is VALID [2022-04-15 06:54:26,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {943#true} call #t~ret7 := main(); {943#true} is VALID [2022-04-15 06:54:26,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {943#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {943#true} is VALID [2022-04-15 06:54:26,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {943#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {948#(= main_~y~0 0)} is VALID [2022-04-15 06:54:26,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {948#(= main_~y~0 0)} [75] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_10 v_main_~y~0_9) (= |v_main_#t~post4_15| |v_main_#t~post4_14|) (= v_main_~z~0_26 v_main_~z~0_24) (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) InVars {main_#t~post4=|v_main_#t~post4_15|, main_~y~0=v_main_~y~0_10, main_#t~post5=|v_main_#t~post5_4|, main_~z~0=v_main_~z~0_26} OutVars{main_#t~post4=|v_main_#t~post4_14|, main_#t~post5=|v_main_#t~post5_3|, main_~y~0=v_main_~y~0_9, main_~z~0=v_main_~z~0_24} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {948#(= main_~y~0 0)} is VALID [2022-04-15 06:54:26,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {948#(= main_~y~0 0)} [74] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {944#false} is VALID [2022-04-15 06:54:26,423 INFO L272 TraceCheckUtils]: 9: Hoare triple {944#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {944#false} is VALID [2022-04-15 06:54:26,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {944#false} ~cond := #in~cond; {944#false} is VALID [2022-04-15 06:54:26,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {944#false} assume 0 == ~cond; {944#false} is VALID [2022-04-15 06:54:26,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {944#false} assume !false; {944#false} is VALID [2022-04-15 06:54:26,423 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 06:54:26,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:26,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685998704] [2022-04-15 06:54:26,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685998704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:26,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:26,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:26,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:26,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [948387469] [2022-04-15 06:54:26,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [948387469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:26,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:26,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:54:26,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790019924] [2022-04-15 06:54:26,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:26,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 06:54:26,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:26,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:26,473 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 06:54:26,473 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:54:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:26,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:54:26,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:54:26,476 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:26,713 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-15 06:54:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:54:26,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 06:54:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-15 06:54:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-15 06:54:26,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-15 06:54:26,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:26,764 INFO L225 Difference]: With dead ends: 53 [2022-04-15 06:54:26,764 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 06:54:26,765 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:54:26,765 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:26,766 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:54:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 06:54:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-15 06:54:26,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:26,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:26,816 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:26,816 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:26,817 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 06:54:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-15 06:54:26,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:26,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:26,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-15 06:54:26,818 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-15 06:54:26,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:26,820 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 06:54:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-15 06:54:26,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:26,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:26,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:26,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-15 06:54:26,822 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 21 [2022-04-15 06:54:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:26,822 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-15 06:54:26,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:26,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-15 06:54:26,873 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 06:54:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 06:54:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:54:26,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:26,873 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:26,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 06:54:26,874 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:26,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:26,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1032496162, now seen corresponding path program 2 times [2022-04-15 06:54:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:26,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1940541193] [2022-04-15 06:54:27,743 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:27,883 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:27,884 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1343821432, now seen corresponding path program 1 times [2022-04-15 06:54:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:27,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271717126] [2022-04-15 06:54:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:27,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#(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(12, 2);call #Ultimate.allocInit(12, 3); {1189#true} is VALID [2022-04-15 06:54:27,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {1189#true} assume true; {1189#true} is VALID [2022-04-15 06:54:27,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1189#true} {1189#true} #63#return; {1189#true} is VALID [2022-04-15 06:54:27,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {1189#true} call ULTIMATE.init(); {1195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:27,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#(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(12, 2);call #Ultimate.allocInit(12, 3); {1189#true} is VALID [2022-04-15 06:54:27,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {1189#true} assume true; {1189#true} is VALID [2022-04-15 06:54:27,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1189#true} {1189#true} #63#return; {1189#true} is VALID [2022-04-15 06:54:27,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {1189#true} call #t~ret7 := main(); {1189#true} is VALID [2022-04-15 06:54:27,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {1189#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1189#true} is VALID [2022-04-15 06:54:27,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {1189#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1194#(= main_~y~0 0)} is VALID [2022-04-15 06:54:27,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {1194#(= main_~y~0 0)} [77] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse1 (= v_main_~z~0_43 v_main_~z~0_40)) (.cse2 (= v_main_~y~0_16 v_main_~y~0_15))) (or (and .cse0 .cse1 (= |v_main_#t~post4_27| |v_main_#t~post4_25|) .cse2) (and .cse0 .cse1 (= |v_main_#t~post4_25| |v_main_#t~post4_27|) .cse2))) InVars {main_#t~post4=|v_main_#t~post4_27|, main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_9|, main_~z~0=v_main_~z~0_43} OutVars{main_#t~post4=|v_main_#t~post4_25|, main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_40} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {1194#(= main_~y~0 0)} is VALID [2022-04-15 06:54:27,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {1194#(= main_~y~0 0)} [76] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {1190#false} is VALID [2022-04-15 06:54:27,929 INFO L272 TraceCheckUtils]: 9: Hoare triple {1190#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1190#false} is VALID [2022-04-15 06:54:27,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {1190#false} ~cond := #in~cond; {1190#false} is VALID [2022-04-15 06:54:27,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {1190#false} assume 0 == ~cond; {1190#false} is VALID [2022-04-15 06:54:27,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {1190#false} assume !false; {1190#false} is VALID [2022-04-15 06:54:27,930 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 06:54:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:27,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271717126] [2022-04-15 06:54:27,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271717126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:27,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:27,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:27,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:27,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1940541193] [2022-04-15 06:54:27,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1940541193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:27,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:27,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:54:27,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941940353] [2022-04-15 06:54:27,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:27,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-15 06:54:27,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:27,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:27,990 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 06:54:27,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:54:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:54:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:54:27,991 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:28,258 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-15 06:54:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:54:28,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-15 06:54:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 06:54:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 06:54:28,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-15 06:54:28,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:28,312 INFO L225 Difference]: With dead ends: 55 [2022-04-15 06:54:28,312 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 06:54:28,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:54:28,313 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:28,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:54:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 06:54:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-15 06:54:28,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:28,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:28,350 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:28,350 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:28,355 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 06:54:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-15 06:54:28,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:28,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:28,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-15 06:54:28,356 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-15 06:54:28,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:28,359 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 06:54:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-15 06:54:28,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:28,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:28,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:28,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-15 06:54:28,362 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2022-04-15 06:54:28,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:28,363 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-15 06:54:28,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:28,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-15 06:54:28,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 06:54:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:54:28,410 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:28,410 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:28,410 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 06:54:28,410 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:28,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1400074750, now seen corresponding path program 3 times [2022-04-15 06:54:28,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:28,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [823029277] [2022-04-15 06:54:29,694 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:29,882 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:30,012 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:30,012 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:30,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1402926776, now seen corresponding path program 1 times [2022-04-15 06:54:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:30,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151523361] [2022-04-15 06:54:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:30,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:30,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:30,075 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(12, 2);call #Ultimate.allocInit(12, 3); {1446#true} is VALID [2022-04-15 06:54:30,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-04-15 06:54:30,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1446#true} {1446#true} #63#return; {1446#true} is VALID [2022-04-15 06:54:30,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:30,076 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(12, 2);call #Ultimate.allocInit(12, 3); {1446#true} is VALID [2022-04-15 06:54:30,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-04-15 06:54:30,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #63#return; {1446#true} is VALID [2022-04-15 06:54:30,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret7 := main(); {1446#true} is VALID [2022-04-15 06:54:30,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {1446#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1446#true} is VALID [2022-04-15 06:54:30,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1451#(= main_~y~0 0)} is VALID [2022-04-15 06:54:30,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {1451#(= main_~y~0 0)} [79] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_22 v_main_~y~0_21) (= v_main_~z~0_62 v_main_~z~0_58) (= |v_main_#t~post5_14| |v_main_#t~post5_13|) (= |v_main_#t~post4_40| |v_main_#t~post4_37|)) InVars {main_#t~post4=|v_main_#t~post4_40|, main_~y~0=v_main_~y~0_22, main_#t~post5=|v_main_#t~post5_14|, main_~z~0=v_main_~z~0_62} OutVars{main_#t~post4=|v_main_#t~post4_37|, main_#t~post5=|v_main_#t~post5_13|, main_~y~0=v_main_~y~0_21, main_~z~0=v_main_~z~0_58} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {1451#(= main_~y~0 0)} is VALID [2022-04-15 06:54:30,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {1451#(= main_~y~0 0)} [78] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {1447#false} is VALID [2022-04-15 06:54:30,088 INFO L272 TraceCheckUtils]: 9: Hoare triple {1447#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1447#false} is VALID [2022-04-15 06:54:30,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {1447#false} ~cond := #in~cond; {1447#false} is VALID [2022-04-15 06:54:30,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {1447#false} assume 0 == ~cond; {1447#false} is VALID [2022-04-15 06:54:30,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2022-04-15 06:54:30,089 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 06:54:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:30,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151523361] [2022-04-15 06:54:30,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151523361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:30,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:30,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:30,163 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:30,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [823029277] [2022-04-15 06:54:30,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [823029277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:30,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:30,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:54:30,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144431617] [2022-04-15 06:54:30,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:30,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-15 06:54:30,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:30,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:30,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:30,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:54:30,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:30,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:54:30,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:54:30,187 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:30,485 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-15 06:54:30,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:54:30,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-15 06:54:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 06:54:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 06:54:30,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-15 06:54:30,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:30,549 INFO L225 Difference]: With dead ends: 57 [2022-04-15 06:54:30,549 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:54:30,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:54:30,550 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:30,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:54:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:54:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-04-15 06:54:30,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:30,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:30,591 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:30,592 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:30,593 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 06:54:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 06:54:30,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:30,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:30,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-15 06:54:30,594 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-15 06:54:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:30,595 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 06:54:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 06:54:30,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:30,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:30,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:30,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-15 06:54:30,597 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2022-04-15 06:54:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:30,597 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-15 06:54:30,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:30,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-15 06:54:30,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 06:54:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:54:30,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:30,648 INFO L499 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:30,648 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 06:54:30,648 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:30,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:30,649 INFO L85 PathProgramCache]: Analyzing trace with hash 499638306, now seen corresponding path program 4 times [2022-04-15 06:54:30,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:30,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2122222414] [2022-04-15 06:54:33,290 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:33,573 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:33,717 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:33,717 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:33,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1462032120, now seen corresponding path program 1 times [2022-04-15 06:54:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:33,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877419613] [2022-04-15 06:54:33,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:33,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:33,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:33,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {1720#(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(12, 2);call #Ultimate.allocInit(12, 3); {1714#true} is VALID [2022-04-15 06:54:33,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {1714#true} assume true; {1714#true} is VALID [2022-04-15 06:54:33,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1714#true} {1714#true} #63#return; {1714#true} is VALID [2022-04-15 06:54:33,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {1714#true} call ULTIMATE.init(); {1720#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:33,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {1720#(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(12, 2);call #Ultimate.allocInit(12, 3); {1714#true} is VALID [2022-04-15 06:54:33,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {1714#true} assume true; {1714#true} is VALID [2022-04-15 06:54:33,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1714#true} {1714#true} #63#return; {1714#true} is VALID [2022-04-15 06:54:33,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {1714#true} call #t~ret7 := main(); {1714#true} is VALID [2022-04-15 06:54:33,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {1714#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1714#true} is VALID [2022-04-15 06:54:33,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {1714#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1719#(= main_~y~0 0)} is VALID [2022-04-15 06:54:33,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {1719#(= main_~y~0 0)} [81] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post4_54| |v_main_#t~post4_50|) (= v_main_~y~0_28 v_main_~y~0_27) (= v_main_~z~0_83 v_main_~z~0_78) (= |v_main_#t~post5_19| |v_main_#t~post5_18|)) InVars {main_#t~post4=|v_main_#t~post4_54|, main_~y~0=v_main_~y~0_28, main_#t~post5=|v_main_#t~post5_19|, main_~z~0=v_main_~z~0_83} OutVars{main_#t~post4=|v_main_#t~post4_50|, main_#t~post5=|v_main_#t~post5_18|, main_~y~0=v_main_~y~0_27, main_~z~0=v_main_~z~0_78} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {1719#(= main_~y~0 0)} is VALID [2022-04-15 06:54:33,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {1719#(= main_~y~0 0)} [80] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {1715#false} is VALID [2022-04-15 06:54:33,772 INFO L272 TraceCheckUtils]: 9: Hoare triple {1715#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1715#false} is VALID [2022-04-15 06:54:33,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {1715#false} ~cond := #in~cond; {1715#false} is VALID [2022-04-15 06:54:33,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {1715#false} assume 0 == ~cond; {1715#false} is VALID [2022-04-15 06:54:33,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {1715#false} assume !false; {1715#false} is VALID [2022-04-15 06:54:33,773 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 06:54:33,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:33,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877419613] [2022-04-15 06:54:33,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877419613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:33,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:33,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:33,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:33,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2122222414] [2022-04-15 06:54:33,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2122222414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:33,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:33,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:54:33,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146670182] [2022-04-15 06:54:33,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:33,846 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 06:54:33,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:33,847 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:33,865 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 06:54:33,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:54:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:54:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:54:33,866 INFO L87 Difference]: Start difference. First operand 30 states and 33 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:34,301 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-15 06:54:34,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:54:34,301 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 06:54:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:34,302 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-15 06:54:34,303 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-15 06:54:34,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-15 06:54:34,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:34,361 INFO L225 Difference]: With dead ends: 59 [2022-04-15 06:54:34,361 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 06:54:34,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:54:34,362 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:34,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:54:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 06:54:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-04-15 06:54:34,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:34,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:34,406 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:34,406 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:34,408 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 06:54:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-15 06:54:34,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:34,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:34,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-15 06:54:34,409 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-15 06:54:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:34,410 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 06:54:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-15 06:54:34,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:34,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:34,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:34,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-15 06:54:34,411 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 24 [2022-04-15 06:54:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:34,411 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-15 06:54:34,412 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:34,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-15 06:54:34,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 06:54:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:54:34,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:34,466 INFO L499 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:34,466 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 06:54:34,466 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:34,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:34,467 INFO L85 PathProgramCache]: Analyzing trace with hash -738799102, now seen corresponding path program 5 times [2022-04-15 06:54:34,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:34,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1787331657] [2022-04-15 06:54:40,252 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:40,451 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:40,581 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:40,581 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1521137464, now seen corresponding path program 1 times [2022-04-15 06:54:40,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:40,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368435243] [2022-04-15 06:54:40,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:40,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:40,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {1999#(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(12, 2);call #Ultimate.allocInit(12, 3); {1993#true} is VALID [2022-04-15 06:54:40,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {1993#true} assume true; {1993#true} is VALID [2022-04-15 06:54:40,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1993#true} {1993#true} #63#return; {1993#true} is VALID [2022-04-15 06:54:40,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {1993#true} call ULTIMATE.init(); {1999#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:40,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {1999#(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(12, 2);call #Ultimate.allocInit(12, 3); {1993#true} is VALID [2022-04-15 06:54:40,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {1993#true} assume true; {1993#true} is VALID [2022-04-15 06:54:40,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1993#true} {1993#true} #63#return; {1993#true} is VALID [2022-04-15 06:54:40,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {1993#true} call #t~ret7 := main(); {1993#true} is VALID [2022-04-15 06:54:40,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {1993#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1993#true} is VALID [2022-04-15 06:54:40,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {1993#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1998#(= main_~y~0 0)} is VALID [2022-04-15 06:54:40,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {1998#(= main_~y~0 0)} [83] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse1 (= |v_main_#t~post4_69| |v_main_#t~post4_64|)) (.cse2 (= |v_main_#t~post5_24| |v_main_#t~post5_23|))) (or (and .cse0 .cse1 .cse2 (= v_main_~z~0_106 v_main_~z~0_100)) (and .cse0 .cse1 (= v_main_~z~0_100 v_main_~z~0_106) .cse2))) InVars {main_#t~post4=|v_main_#t~post4_69|, main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_24|, main_~z~0=v_main_~z~0_106} OutVars{main_#t~post4=|v_main_#t~post4_64|, main_#t~post5=|v_main_#t~post5_23|, main_~y~0=v_main_~y~0_33, main_~z~0=v_main_~z~0_100} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {1998#(= main_~y~0 0)} is VALID [2022-04-15 06:54:40,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {1998#(= main_~y~0 0)} [82] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {1994#false} is VALID [2022-04-15 06:54:40,631 INFO L272 TraceCheckUtils]: 9: Hoare triple {1994#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1994#false} is VALID [2022-04-15 06:54:40,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {1994#false} ~cond := #in~cond; {1994#false} is VALID [2022-04-15 06:54:40,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {1994#false} assume 0 == ~cond; {1994#false} is VALID [2022-04-15 06:54:40,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {1994#false} assume !false; {1994#false} is VALID [2022-04-15 06:54:40,632 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 06:54:40,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:40,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368435243] [2022-04-15 06:54:40,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368435243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:40,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:40,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:40,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:40,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1787331657] [2022-04-15 06:54:40,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1787331657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:40,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:40,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:54:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330386766] [2022-04-15 06:54:40,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:40,728 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 06:54:40,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:40,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:40,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:40,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:54:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:40,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:54:40,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:54:40,749 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:41,068 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-15 06:54:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:54:41,068 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 06:54:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:41,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-04-15 06:54:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-04-15 06:54:41,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2022-04-15 06:54:41,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:41,121 INFO L225 Difference]: With dead ends: 61 [2022-04-15 06:54:41,121 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 06:54:41,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:54:41,122 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:41,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 26 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:54:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 06:54:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-04-15 06:54:41,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:41,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 32 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:41,190 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 32 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:41,190 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 32 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:41,192 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 06:54:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 06:54:41,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:41,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:41,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-04-15 06:54:41,194 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-04-15 06:54:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:41,195 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 06:54:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 06:54:41,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:41,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:41,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:41,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-15 06:54:41,197 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2022-04-15 06:54:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:41,197 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-15 06:54:41,197 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:41,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-15 06:54:41,260 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 06:54:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 06:54:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:54:41,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:41,261 INFO L499 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:41,261 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 06:54:41,262 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:41,262 INFO L85 PathProgramCache]: Analyzing trace with hash -475653086, now seen corresponding path program 6 times [2022-04-15 06:54:41,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:41,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1507641109] [2022-04-15 06:54:41,747 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:41,891 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:41,892 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1580242808, now seen corresponding path program 1 times [2022-04-15 06:54:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:41,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332993289] [2022-04-15 06:54:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:41,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:41,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {2289#(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(12, 2);call #Ultimate.allocInit(12, 3); {2283#true} is VALID [2022-04-15 06:54:41,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {2283#true} assume true; {2283#true} is VALID [2022-04-15 06:54:41,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2283#true} {2283#true} #63#return; {2283#true} is VALID [2022-04-15 06:54:41,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {2283#true} call ULTIMATE.init(); {2289#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:41,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {2289#(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(12, 2);call #Ultimate.allocInit(12, 3); {2283#true} is VALID [2022-04-15 06:54:41,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {2283#true} assume true; {2283#true} is VALID [2022-04-15 06:54:41,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2283#true} {2283#true} #63#return; {2283#true} is VALID [2022-04-15 06:54:41,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {2283#true} call #t~ret7 := main(); {2283#true} is VALID [2022-04-15 06:54:41,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {2283#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2283#true} is VALID [2022-04-15 06:54:41,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {2283#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2288#(= main_~y~0 0)} is VALID [2022-04-15 06:54:41,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {2288#(= main_~y~0 0)} [85] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_85| |v_main_#t~post4_79|)) (.cse1 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= v_main_~y~0_40 v_main_~y~0_39) .cse0 (= v_main_~z~0_131 v_main_~z~0_124) .cse1) (and (= v_main_~y~0_39 v_main_~y~0_40) (= v_main_~z~0_124 v_main_~z~0_131) .cse0 .cse1))) InVars {main_#t~post4=|v_main_#t~post4_85|, main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_29|, main_~z~0=v_main_~z~0_131} OutVars{main_#t~post4=|v_main_#t~post4_79|, main_#t~post5=|v_main_#t~post5_28|, main_~y~0=v_main_~y~0_39, main_~z~0=v_main_~z~0_124} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {2288#(= main_~y~0 0)} is VALID [2022-04-15 06:54:41,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {2288#(= main_~y~0 0)} [84] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {2284#false} is VALID [2022-04-15 06:54:41,942 INFO L272 TraceCheckUtils]: 9: Hoare triple {2284#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2284#false} is VALID [2022-04-15 06:54:41,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {2284#false} ~cond := #in~cond; {2284#false} is VALID [2022-04-15 06:54:41,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {2284#false} assume 0 == ~cond; {2284#false} is VALID [2022-04-15 06:54:41,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {2284#false} assume !false; {2284#false} is VALID [2022-04-15 06:54:41,943 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 06:54:41,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:41,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332993289] [2022-04-15 06:54:41,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332993289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:41,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:41,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:42,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:42,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1507641109] [2022-04-15 06:54:42,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1507641109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:42,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:42,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:54:42,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006366692] [2022-04-15 06:54:42,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:42,048 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-15 06:54:42,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:42,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:42,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:42,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:54:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:42,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:54:42,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:54:42,067 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:42,535 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-15 06:54:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:54:42,535 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-15 06:54:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 06:54:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 06:54:42,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-15 06:54:42,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:42,587 INFO L225 Difference]: With dead ends: 63 [2022-04-15 06:54:42,587 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 06:54:42,588 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:54:42,588 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:42,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:54:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 06:54:42,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2022-04-15 06:54:42,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:42,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 33 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:42,638 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 33 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:42,638 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 33 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:42,639 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-15 06:54:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-15 06:54:42,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:42,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:42,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-15 06:54:42,640 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-15 06:54:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:42,641 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-15 06:54:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-15 06:54:42,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:42,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:42,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:42,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-15 06:54:42,648 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 26 [2022-04-15 06:54:42,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:42,648 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-15 06:54:42,648 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:42,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-15 06:54:42,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 06:54:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:54:42,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:42,724 INFO L499 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:42,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 06:54:42,724 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:42,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:42,725 INFO L85 PathProgramCache]: Analyzing trace with hash -908061182, now seen corresponding path program 7 times [2022-04-15 06:54:42,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:42,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1203424269] [2022-04-15 06:54:45,546 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:45,722 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:45,847 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:45,847 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1639348152, now seen corresponding path program 1 times [2022-04-15 06:54:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:45,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909051726] [2022-04-15 06:54:45,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:45,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {2590#(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(12, 2);call #Ultimate.allocInit(12, 3); {2584#true} is VALID [2022-04-15 06:54:45,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {2584#true} assume true; {2584#true} is VALID [2022-04-15 06:54:45,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2584#true} {2584#true} #63#return; {2584#true} is VALID [2022-04-15 06:54:45,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {2584#true} call ULTIMATE.init(); {2590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:45,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {2590#(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(12, 2);call #Ultimate.allocInit(12, 3); {2584#true} is VALID [2022-04-15 06:54:45,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {2584#true} assume true; {2584#true} is VALID [2022-04-15 06:54:45,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2584#true} {2584#true} #63#return; {2584#true} is VALID [2022-04-15 06:54:45,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {2584#true} call #t~ret7 := main(); {2584#true} is VALID [2022-04-15 06:54:45,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {2584#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2584#true} is VALID [2022-04-15 06:54:45,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {2584#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2589#(= main_~y~0 0)} is VALID [2022-04-15 06:54:45,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {2589#(= main_~y~0 0)} [87] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~z~0_158 v_main_~z~0_150)) (.cse1 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse2 (= v_main_~y~0_46 v_main_~y~0_45))) (or (and .cse0 .cse1 (= |v_main_#t~post4_102| |v_main_#t~post4_95|) .cse2) (and .cse0 (= |v_main_#t~post4_95| |v_main_#t~post4_102|) .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_102|, main_~y~0=v_main_~y~0_46, main_#t~post5=|v_main_#t~post5_34|, main_~z~0=v_main_~z~0_158} OutVars{main_#t~post4=|v_main_#t~post4_95|, main_#t~post5=|v_main_#t~post5_33|, main_~y~0=v_main_~y~0_45, main_~z~0=v_main_~z~0_150} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {2589#(= main_~y~0 0)} is VALID [2022-04-15 06:54:45,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {2589#(= main_~y~0 0)} [86] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {2585#false} is VALID [2022-04-15 06:54:45,895 INFO L272 TraceCheckUtils]: 9: Hoare triple {2585#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2585#false} is VALID [2022-04-15 06:54:45,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {2585#false} ~cond := #in~cond; {2585#false} is VALID [2022-04-15 06:54:45,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {2585#false} assume 0 == ~cond; {2585#false} is VALID [2022-04-15 06:54:45,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {2585#false} assume !false; {2585#false} is VALID [2022-04-15 06:54:45,896 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 06:54:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:45,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909051726] [2022-04-15 06:54:45,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909051726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:45,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:45,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:46,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:46,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1203424269] [2022-04-15 06:54:46,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1203424269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:46,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:46,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:54:46,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756638579] [2022-04-15 06:54:46,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:46,019 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-15 06:54:46,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:46,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:46,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:46,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:54:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:54:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:54:46,037 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:46,486 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-15 06:54:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:54:46,486 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-15 06:54:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 06:54:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 06:54:46,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-15 06:54:46,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:46,535 INFO L225 Difference]: With dead ends: 65 [2022-04-15 06:54:46,535 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 06:54:46,536 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:54:46,539 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:46,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:54:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 06:54:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-04-15 06:54:46,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:46,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 34 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:46,587 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 34 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:46,587 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 34 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:46,589 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-15 06:54:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-15 06:54:46,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:46,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:46,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-04-15 06:54:46,591 INFO L87 Difference]: Start difference. First operand has 34 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-04-15 06:54:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:46,597 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-15 06:54:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-15 06:54:46,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:46,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:46,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:46,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-15 06:54:46,599 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 27 [2022-04-15 06:54:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:46,599 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-15 06:54:46,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:46,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-15 06:54:46,649 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 06:54:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 06:54:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:54:46,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:46,650 INFO L499 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:46,650 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 06:54:46,650 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1427810270, now seen corresponding path program 8 times [2022-04-15 06:54:46,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:46,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008286326] [2022-04-15 06:54:47,624 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:47,780 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:47,780 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1698453496, now seen corresponding path program 1 times [2022-04-15 06:54:47,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:47,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275397675] [2022-04-15 06:54:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:47,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:47,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:47,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {2902#(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(12, 2);call #Ultimate.allocInit(12, 3); {2896#true} is VALID [2022-04-15 06:54:47,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {2896#true} assume true; {2896#true} is VALID [2022-04-15 06:54:47,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2896#true} {2896#true} #63#return; {2896#true} is VALID [2022-04-15 06:54:47,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {2896#true} call ULTIMATE.init(); {2902#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:47,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#(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(12, 2);call #Ultimate.allocInit(12, 3); {2896#true} is VALID [2022-04-15 06:54:47,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {2896#true} assume true; {2896#true} is VALID [2022-04-15 06:54:47,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2896#true} {2896#true} #63#return; {2896#true} is VALID [2022-04-15 06:54:47,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {2896#true} call #t~ret7 := main(); {2896#true} is VALID [2022-04-15 06:54:47,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {2896#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2896#true} is VALID [2022-04-15 06:54:47,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {2896#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2901#(= main_~y~0 0)} is VALID [2022-04-15 06:54:47,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {2901#(= main_~y~0 0)} [89] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= v_main_~z~0_187 v_main_~z~0_178))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse0 .cse1 (= |v_main_#t~post4_112| |v_main_#t~post4_120|)) (and (= |v_main_#t~post4_120| |v_main_#t~post4_112|) (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse0 .cse1))) InVars {main_#t~post4=|v_main_#t~post4_120|, main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_39|, main_~z~0=v_main_~z~0_187} OutVars{main_#t~post4=|v_main_#t~post4_112|, main_#t~post5=|v_main_#t~post5_38|, main_~y~0=v_main_~y~0_51, main_~z~0=v_main_~z~0_178} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {2901#(= main_~y~0 0)} is VALID [2022-04-15 06:54:47,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {2901#(= main_~y~0 0)} [88] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {2897#false} is VALID [2022-04-15 06:54:47,844 INFO L272 TraceCheckUtils]: 9: Hoare triple {2897#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2897#false} is VALID [2022-04-15 06:54:47,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {2897#false} ~cond := #in~cond; {2897#false} is VALID [2022-04-15 06:54:47,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {2897#false} assume 0 == ~cond; {2897#false} is VALID [2022-04-15 06:54:47,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {2897#false} assume !false; {2897#false} is VALID [2022-04-15 06:54:47,844 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 06:54:47,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:47,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275397675] [2022-04-15 06:54:47,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275397675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:47,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:47,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:47,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:47,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008286326] [2022-04-15 06:54:47,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008286326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:47,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:47,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:54:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120839460] [2022-04-15 06:54:47,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-15 06:54:47,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:47,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:47,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:47,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:54:47,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:47,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:54:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:54:47,992 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:48,632 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-04-15 06:54:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:54:48,632 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-15 06:54:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-15 06:54:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-15 06:54:48,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-15 06:54:48,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:48,689 INFO L225 Difference]: With dead ends: 67 [2022-04-15 06:54:48,689 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 06:54:48,690 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:54:48,690 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:48,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:54:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 06:54:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-04-15 06:54:48,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:48,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:48,744 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:48,744 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:48,745 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-15 06:54:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-15 06:54:48,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:48,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:48,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-15 06:54:48,746 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-15 06:54:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:48,747 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-15 06:54:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-15 06:54:48,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:48,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:48,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:48,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-15 06:54:48,749 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2022-04-15 06:54:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:48,749 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-15 06:54:48,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:48,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-15 06:54:48,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 06:54:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:54:48,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:48,821 INFO L499 BasicCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:48,821 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 06:54:48,821 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash -360162814, now seen corresponding path program 9 times [2022-04-15 06:54:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:48,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1735524202] [2022-04-15 06:54:50,450 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:50,635 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:50,805 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:50,806 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1757558840, now seen corresponding path program 1 times [2022-04-15 06:54:50,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:50,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098947711] [2022-04-15 06:54:50,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:50,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:50,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {3225#(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(12, 2);call #Ultimate.allocInit(12, 3); {3219#true} is VALID [2022-04-15 06:54:50,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {3219#true} assume true; {3219#true} is VALID [2022-04-15 06:54:50,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3219#true} {3219#true} #63#return; {3219#true} is VALID [2022-04-15 06:54:50,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {3219#true} call ULTIMATE.init(); {3225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:50,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {3225#(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(12, 2);call #Ultimate.allocInit(12, 3); {3219#true} is VALID [2022-04-15 06:54:50,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {3219#true} assume true; {3219#true} is VALID [2022-04-15 06:54:50,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3219#true} {3219#true} #63#return; {3219#true} is VALID [2022-04-15 06:54:50,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {3219#true} call #t~ret7 := main(); {3219#true} is VALID [2022-04-15 06:54:50,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {3219#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3219#true} is VALID [2022-04-15 06:54:50,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {3219#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3224#(= main_~y~0 0)} is VALID [2022-04-15 06:54:50,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {3224#(= main_~y~0 0)} [91] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post5_44| |v_main_#t~post5_43|) (= |v_main_#t~post4_139| |v_main_#t~post4_130|) (= v_main_~z~0_218 v_main_~z~0_208) (= v_main_~y~0_58 v_main_~y~0_57)) InVars {main_#t~post4=|v_main_#t~post4_139|, main_~y~0=v_main_~y~0_58, main_#t~post5=|v_main_#t~post5_44|, main_~z~0=v_main_~z~0_218} OutVars{main_#t~post4=|v_main_#t~post4_130|, main_#t~post5=|v_main_#t~post5_43|, main_~y~0=v_main_~y~0_57, main_~z~0=v_main_~z~0_208} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {3224#(= main_~y~0 0)} is VALID [2022-04-15 06:54:50,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {3224#(= main_~y~0 0)} [90] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {3220#false} is VALID [2022-04-15 06:54:50,850 INFO L272 TraceCheckUtils]: 9: Hoare triple {3220#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3220#false} is VALID [2022-04-15 06:54:50,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {3220#false} ~cond := #in~cond; {3220#false} is VALID [2022-04-15 06:54:50,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {3220#false} assume 0 == ~cond; {3220#false} is VALID [2022-04-15 06:54:50,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {3220#false} assume !false; {3220#false} is VALID [2022-04-15 06:54:50,851 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 06:54:50,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:50,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098947711] [2022-04-15 06:54:50,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098947711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:50,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:50,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:50,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:50,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1735524202] [2022-04-15 06:54:50,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1735524202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:50,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:50,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:54:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627233025] [2022-04-15 06:54:50,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:50,976 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-04-15 06:54:50,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:50,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:51,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:51,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:54:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:51,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:54:51,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:54:51,007 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:51,524 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-04-15 06:54:51,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:54:51,524 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-04-15 06:54:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 61 transitions. [2022-04-15 06:54:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 61 transitions. [2022-04-15 06:54:51,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 61 transitions. [2022-04-15 06:54:51,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:51,581 INFO L225 Difference]: With dead ends: 69 [2022-04-15 06:54:51,581 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:54:51,581 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:54:51,582 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:51,582 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:54:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:54:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-15 06:54:51,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:51,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:51,651 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:51,651 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:51,652 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-15 06:54:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-15 06:54:51,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:51,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:51,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 06:54:51,653 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 06:54:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:51,654 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-15 06:54:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-15 06:54:51,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:51,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:51,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:51,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-15 06:54:51,655 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 29 [2022-04-15 06:54:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:51,656 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-15 06:54:51,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:51,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-15 06:54:51,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 06:54:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 06:54:51,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:51,710 INFO L499 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:51,710 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 06:54:51,710 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:51,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1622830046, now seen corresponding path program 10 times [2022-04-15 06:54:51,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:51,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [382888801] [2022-04-15 06:54:52,147 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:52,286 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:52,286 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:52,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1816664184, now seen corresponding path program 1 times [2022-04-15 06:54:52,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:52,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040790876] [2022-04-15 06:54:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:52,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:52,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {3559#(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(12, 2);call #Ultimate.allocInit(12, 3); {3553#true} is VALID [2022-04-15 06:54:52,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {3553#true} assume true; {3553#true} is VALID [2022-04-15 06:54:52,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3553#true} {3553#true} #63#return; {3553#true} is VALID [2022-04-15 06:54:52,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {3553#true} call ULTIMATE.init(); {3559#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:52,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {3559#(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(12, 2);call #Ultimate.allocInit(12, 3); {3553#true} is VALID [2022-04-15 06:54:52,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {3553#true} assume true; {3553#true} is VALID [2022-04-15 06:54:52,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3553#true} {3553#true} #63#return; {3553#true} is VALID [2022-04-15 06:54:52,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {3553#true} call #t~ret7 := main(); {3553#true} is VALID [2022-04-15 06:54:52,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {3553#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3553#true} is VALID [2022-04-15 06:54:52,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {3553#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3558#(= main_~y~0 0)} is VALID [2022-04-15 06:54:52,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {3558#(= main_~y~0 0)} [93] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_64 v_main_~y~0_63)) (.cse2 (= |v_main_#t~post4_159| |v_main_#t~post4_149|))) (or (and .cse0 .cse1 (= v_main_~z~0_251 v_main_~z~0_240) .cse2) (and (= v_main_~z~0_240 v_main_~z~0_251) .cse0 .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_159|, main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_49|, main_~z~0=v_main_~z~0_251} OutVars{main_#t~post4=|v_main_#t~post4_149|, main_#t~post5=|v_main_#t~post5_48|, main_~y~0=v_main_~y~0_63, main_~z~0=v_main_~z~0_240} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {3558#(= main_~y~0 0)} is VALID [2022-04-15 06:54:52,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {3558#(= main_~y~0 0)} [92] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {3554#false} is VALID [2022-04-15 06:54:52,327 INFO L272 TraceCheckUtils]: 9: Hoare triple {3554#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3554#false} is VALID [2022-04-15 06:54:52,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {3554#false} ~cond := #in~cond; {3554#false} is VALID [2022-04-15 06:54:52,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {3554#false} assume 0 == ~cond; {3554#false} is VALID [2022-04-15 06:54:52,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {3554#false} assume !false; {3554#false} is VALID [2022-04-15 06:54:52,327 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 06:54:52,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:52,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040790876] [2022-04-15 06:54:52,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040790876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:52,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:52,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:52,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:52,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [382888801] [2022-04-15 06:54:52,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [382888801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:52,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:52,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 06:54:52,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913251052] [2022-04-15 06:54:52,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:52,510 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-04-15 06:54:52,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:52,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:52,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:52,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 06:54:52,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:52,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 06:54:52,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:54:52,530 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:53,070 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2022-04-15 06:54:53,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:54:53,071 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-04-15 06:54:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-15 06:54:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-15 06:54:53,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 62 transitions. [2022-04-15 06:54:53,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:53,123 INFO L225 Difference]: With dead ends: 71 [2022-04-15 06:54:53,123 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 06:54:53,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:54:53,124 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:53,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:54:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 06:54:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-04-15 06:54:53,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:53,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 37 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:53,192 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 37 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:53,192 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 37 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:53,193 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 06:54:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 06:54:53,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:53,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:53,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 42 states. [2022-04-15 06:54:53,194 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 42 states. [2022-04-15 06:54:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:53,195 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 06:54:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 06:54:53,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:53,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:53,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:53,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-04-15 06:54:53,196 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 30 [2022-04-15 06:54:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:53,196 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-04-15 06:54:53,196 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:53,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 40 transitions. [2022-04-15 06:54:53,257 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 06:54:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-04-15 06:54:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:54:53,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:53,258 INFO L499 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:53,258 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 06:54:53,258 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:53,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2110808574, now seen corresponding path program 11 times [2022-04-15 06:54:53,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:53,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2070388469] [2022-04-15 06:54:53,675 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:53,855 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:53,856 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:53,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1875769528, now seen corresponding path program 1 times [2022-04-15 06:54:53,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:53,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868854935] [2022-04-15 06:54:53,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:53,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:53,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {3904#(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(12, 2);call #Ultimate.allocInit(12, 3); {3898#true} is VALID [2022-04-15 06:54:53,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-15 06:54:53,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3898#true} {3898#true} #63#return; {3898#true} is VALID [2022-04-15 06:54:53,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {3898#true} call ULTIMATE.init(); {3904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:53,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {3904#(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(12, 2);call #Ultimate.allocInit(12, 3); {3898#true} is VALID [2022-04-15 06:54:53,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-15 06:54:53,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3898#true} {3898#true} #63#return; {3898#true} is VALID [2022-04-15 06:54:53,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {3898#true} call #t~ret7 := main(); {3898#true} is VALID [2022-04-15 06:54:53,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {3898#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3898#true} is VALID [2022-04-15 06:54:53,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {3898#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3903#(= main_~y~0 0)} is VALID [2022-04-15 06:54:53,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {3903#(= main_~y~0 0)} [95] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_286 v_main_~z~0_274) (= v_main_~y~0_70 v_main_~y~0_69) (= |v_main_#t~post5_54| |v_main_#t~post5_53|) (= |v_main_#t~post4_180| |v_main_#t~post4_169|)) InVars {main_#t~post4=|v_main_#t~post4_180|, main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_54|, main_~z~0=v_main_~z~0_286} OutVars{main_#t~post4=|v_main_#t~post4_169|, main_#t~post5=|v_main_#t~post5_53|, main_~y~0=v_main_~y~0_69, main_~z~0=v_main_~z~0_274} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {3903#(= main_~y~0 0)} is VALID [2022-04-15 06:54:53,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {3903#(= main_~y~0 0)} [94] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {3899#false} is VALID [2022-04-15 06:54:53,896 INFO L272 TraceCheckUtils]: 9: Hoare triple {3899#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3899#false} is VALID [2022-04-15 06:54:53,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {3899#false} ~cond := #in~cond; {3899#false} is VALID [2022-04-15 06:54:53,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {3899#false} assume 0 == ~cond; {3899#false} is VALID [2022-04-15 06:54:53,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {3899#false} assume !false; {3899#false} is VALID [2022-04-15 06:54:53,896 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 06:54:53,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:53,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868854935] [2022-04-15 06:54:53,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868854935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:53,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:53,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:54,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:54,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2070388469] [2022-04-15 06:54:54,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2070388469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:54,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:54,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:54:54,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403376346] [2022-04-15 06:54:54,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:54,081 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-04-15 06:54:54,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:54,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:54,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:54,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:54:54,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:54,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:54:54,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:54:54,102 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:54,788 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-04-15 06:54:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:54:54,788 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-04-15 06:54:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-04-15 06:54:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-04-15 06:54:54,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 63 transitions. [2022-04-15 06:54:54,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:54,847 INFO L225 Difference]: With dead ends: 73 [2022-04-15 06:54:54,847 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 06:54:54,847 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:54:54,848 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:54,848 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:54:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 06:54:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2022-04-15 06:54:54,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:54,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:54,913 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:54,913 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:54,914 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-15 06:54:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-15 06:54:54,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:54,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:54,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 43 states. [2022-04-15 06:54:54,915 INFO L87 Difference]: Start difference. First operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 43 states. [2022-04-15 06:54:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:54,916 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-15 06:54:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-15 06:54:54,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:54,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:54,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:54,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-15 06:54:54,917 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 31 [2022-04-15 06:54:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:54,918 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-15 06:54:54,918 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:54,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-15 06:54:54,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 06:54:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:54:54,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:54,978 INFO L499 BasicCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:54,978 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 06:54:54,979 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash -58273758, now seen corresponding path program 12 times [2022-04-15 06:54:54,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:54,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1958888080] [2022-04-15 06:54:57,692 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:57,911 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:58,126 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:58,126 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:58,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1934874872, now seen corresponding path program 1 times [2022-04-15 06:54:58,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:58,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472102186] [2022-04-15 06:54:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:58,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:58,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:58,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {4260#(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(12, 2);call #Ultimate.allocInit(12, 3); {4254#true} is VALID [2022-04-15 06:54:58,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-15 06:54:58,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4254#true} {4254#true} #63#return; {4254#true} is VALID [2022-04-15 06:54:58,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {4254#true} call ULTIMATE.init(); {4260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:58,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {4260#(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(12, 2);call #Ultimate.allocInit(12, 3); {4254#true} is VALID [2022-04-15 06:54:58,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-15 06:54:58,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4254#true} {4254#true} #63#return; {4254#true} is VALID [2022-04-15 06:54:58,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {4254#true} call #t~ret7 := main(); {4254#true} is VALID [2022-04-15 06:54:58,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {4254#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4254#true} is VALID [2022-04-15 06:54:58,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {4254#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4259#(= main_~y~0 0)} is VALID [2022-04-15 06:54:58,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {4259#(= main_~y~0 0)} [97] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post4_202| |v_main_#t~post4_190|) (= |v_main_#t~post5_59| |v_main_#t~post5_58|) (= v_main_~y~0_76 v_main_~y~0_75) (= v_main_~z~0_323 v_main_~z~0_310)) InVars {main_#t~post4=|v_main_#t~post4_202|, main_~y~0=v_main_~y~0_76, main_#t~post5=|v_main_#t~post5_59|, main_~z~0=v_main_~z~0_323} OutVars{main_#t~post4=|v_main_#t~post4_190|, main_#t~post5=|v_main_#t~post5_58|, main_~y~0=v_main_~y~0_75, main_~z~0=v_main_~z~0_310} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {4259#(= main_~y~0 0)} is VALID [2022-04-15 06:54:58,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {4259#(= main_~y~0 0)} [96] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {4255#false} is VALID [2022-04-15 06:54:58,179 INFO L272 TraceCheckUtils]: 9: Hoare triple {4255#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4255#false} is VALID [2022-04-15 06:54:58,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {4255#false} ~cond := #in~cond; {4255#false} is VALID [2022-04-15 06:54:58,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {4255#false} assume 0 == ~cond; {4255#false} is VALID [2022-04-15 06:54:58,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {4255#false} assume !false; {4255#false} is VALID [2022-04-15 06:54:58,179 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 06:54:58,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:58,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472102186] [2022-04-15 06:54:58,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472102186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:58,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:58,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:58,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:58,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1958888080] [2022-04-15 06:54:58,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1958888080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:58,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:58,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:54:58,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667479481] [2022-04-15 06:54:58,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:58,411 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-04-15 06:54:58,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:58,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:58,430 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 06:54:58,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:54:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:58,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:54:58,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:54:58,431 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:59,304 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 06:54:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:54:59,304 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-04-15 06:54:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2022-04-15 06:54:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2022-04-15 06:54:59,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 64 transitions. [2022-04-15 06:54:59,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:59,357 INFO L225 Difference]: With dead ends: 75 [2022-04-15 06:54:59,357 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 06:54:59,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:54:59,358 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:59,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 81 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:54:59,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 06:54:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-04-15 06:54:59,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:59,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 39 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:59,425 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 39 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:59,425 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 39 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:59,426 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 06:54:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-15 06:54:59,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:59,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:59,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 44 states. [2022-04-15 06:54:59,427 INFO L87 Difference]: Start difference. First operand has 39 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 44 states. [2022-04-15 06:54:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:59,428 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 06:54:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-15 06:54:59,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:59,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:59,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:59,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:54:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-04-15 06:54:59,444 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2022-04-15 06:54:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:59,445 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-04-15 06:54:59,445 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:59,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 42 transitions. [2022-04-15 06:54:59,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 06:54:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:54:59,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:59,510 INFO L499 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:59,510 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 06:54:59,510 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:59,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -854203902, now seen corresponding path program 13 times [2022-04-15 06:54:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:59,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1571243413] [2022-04-15 06:54:59,868 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:00,067 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:00,068 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1993980216, now seen corresponding path program 1 times [2022-04-15 06:55:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:00,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082145790] [2022-04-15 06:55:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:00,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:00,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {4627#(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(12, 2);call #Ultimate.allocInit(12, 3); {4621#true} is VALID [2022-04-15 06:55:00,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {4621#true} assume true; {4621#true} is VALID [2022-04-15 06:55:00,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4621#true} {4621#true} #63#return; {4621#true} is VALID [2022-04-15 06:55:00,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {4621#true} call ULTIMATE.init(); {4627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:00,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {4627#(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(12, 2);call #Ultimate.allocInit(12, 3); {4621#true} is VALID [2022-04-15 06:55:00,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {4621#true} assume true; {4621#true} is VALID [2022-04-15 06:55:00,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4621#true} {4621#true} #63#return; {4621#true} is VALID [2022-04-15 06:55:00,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {4621#true} call #t~ret7 := main(); {4621#true} is VALID [2022-04-15 06:55:00,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {4621#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4621#true} is VALID [2022-04-15 06:55:00,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {4621#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4626#(= main_~y~0 0)} is VALID [2022-04-15 06:55:00,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {4626#(= main_~y~0 0)} [99] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse1 (= v_main_~z~0_362 v_main_~z~0_348)) (.cse2 (= v_main_~y~0_82 v_main_~y~0_81))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post4_212| |v_main_#t~post4_225|)) (and .cse0 .cse1 (= |v_main_#t~post4_225| |v_main_#t~post4_212|) .cse2))) InVars {main_#t~post4=|v_main_#t~post4_225|, main_~y~0=v_main_~y~0_82, main_#t~post5=|v_main_#t~post5_64|, main_~z~0=v_main_~z~0_362} OutVars{main_#t~post4=|v_main_#t~post4_212|, main_#t~post5=|v_main_#t~post5_63|, main_~y~0=v_main_~y~0_81, main_~z~0=v_main_~z~0_348} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {4626#(= main_~y~0 0)} is VALID [2022-04-15 06:55:00,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {4626#(= main_~y~0 0)} [98] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {4622#false} is VALID [2022-04-15 06:55:00,114 INFO L272 TraceCheckUtils]: 9: Hoare triple {4622#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4622#false} is VALID [2022-04-15 06:55:00,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {4622#false} ~cond := #in~cond; {4622#false} is VALID [2022-04-15 06:55:00,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {4622#false} assume 0 == ~cond; {4622#false} is VALID [2022-04-15 06:55:00,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {4622#false} assume !false; {4622#false} is VALID [2022-04-15 06:55:00,114 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 06:55:00,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:00,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082145790] [2022-04-15 06:55:00,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082145790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:00,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:00,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:00,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:00,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1571243413] [2022-04-15 06:55:00,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1571243413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:00,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:00,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:55:00,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552030035] [2022-04-15 06:55:00,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:00,322 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-15 06:55:00,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:00,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:00,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:00,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:55:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:00,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:55:00,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:55:00,344 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:01,173 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-04-15 06:55:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:55:01,173 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-15 06:55:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-15 06:55:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-15 06:55:01,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2022-04-15 06:55:01,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:01,234 INFO L225 Difference]: With dead ends: 77 [2022-04-15 06:55:01,235 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 06:55:01,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:55:01,236 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:01,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:55:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 06:55:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-04-15 06:55:01,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:01,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:01,297 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:01,297 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:01,298 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 06:55:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-15 06:55:01,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:01,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:01,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-15 06:55:01,299 INFO L87 Difference]: Start difference. First operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-15 06:55:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:01,300 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 06:55:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-15 06:55:01,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:01,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:01,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:01,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-15 06:55:01,302 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 33 [2022-04-15 06:55:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:01,302 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-15 06:55:01,302 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:01,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-15 06:55:01,375 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 06:55:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-15 06:55:01,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:55:01,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:01,376 INFO L499 BasicCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:01,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 06:55:01,376 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:01,377 INFO L85 PathProgramCache]: Analyzing trace with hash 241765410, now seen corresponding path program 14 times [2022-04-15 06:55:01,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:01,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543566289] [2022-04-15 06:55:02,672 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:02,835 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:02,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:02,991 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:02,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2053085560, now seen corresponding path program 1 times [2022-04-15 06:55:02,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:02,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907296215] [2022-04-15 06:55:02,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:02,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:03,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:03,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {5005#(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(12, 2);call #Ultimate.allocInit(12, 3); {4999#true} is VALID [2022-04-15 06:55:03,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 06:55:03,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4999#true} {4999#true} #63#return; {4999#true} is VALID [2022-04-15 06:55:03,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {4999#true} call ULTIMATE.init(); {5005#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:03,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {5005#(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(12, 2);call #Ultimate.allocInit(12, 3); {4999#true} is VALID [2022-04-15 06:55:03,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 06:55:03,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4999#true} {4999#true} #63#return; {4999#true} is VALID [2022-04-15 06:55:03,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {4999#true} call #t~ret7 := main(); {4999#true} is VALID [2022-04-15 06:55:03,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {4999#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4999#true} is VALID [2022-04-15 06:55:03,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {4999#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5004#(= main_~y~0 0)} is VALID [2022-04-15 06:55:03,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {5004#(= main_~y~0 0)} [101] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse1 (= v_main_~z~0_403 v_main_~z~0_388)) (.cse2 (= v_main_~y~0_88 v_main_~y~0_87))) (or (and (= |v_main_#t~post4_235| |v_main_#t~post4_249|) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (= |v_main_#t~post4_249| |v_main_#t~post4_235|)))) InVars {main_#t~post4=|v_main_#t~post4_249|, main_~y~0=v_main_~y~0_88, main_#t~post5=|v_main_#t~post5_69|, main_~z~0=v_main_~z~0_403} OutVars{main_#t~post4=|v_main_#t~post4_235|, main_#t~post5=|v_main_#t~post5_68|, main_~y~0=v_main_~y~0_87, main_~z~0=v_main_~z~0_388} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {5004#(= main_~y~0 0)} is VALID [2022-04-15 06:55:03,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {5004#(= main_~y~0 0)} [100] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {5000#false} is VALID [2022-04-15 06:55:03,039 INFO L272 TraceCheckUtils]: 9: Hoare triple {5000#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5000#false} is VALID [2022-04-15 06:55:03,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {5000#false} ~cond := #in~cond; {5000#false} is VALID [2022-04-15 06:55:03,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {5000#false} assume 0 == ~cond; {5000#false} is VALID [2022-04-15 06:55:03,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {5000#false} assume !false; {5000#false} is VALID [2022-04-15 06:55:03,039 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 06:55:03,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:03,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907296215] [2022-04-15 06:55:03,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907296215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:03,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:03,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:03,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:03,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543566289] [2022-04-15 06:55:03,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543566289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:03,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:03,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:55:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037778203] [2022-04-15 06:55:03,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-04-15 06:55:03,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:03,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:03,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:03,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:55:03,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:03,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:55:03,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:55:03,310 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:04,315 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-15 06:55:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:55:04,315 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-04-15 06:55:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-15 06:55:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-15 06:55:04,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2022-04-15 06:55:04,369 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 06:55:04,370 INFO L225 Difference]: With dead ends: 79 [2022-04-15 06:55:04,370 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 06:55:04,370 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:55:04,371 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:04,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:55:04,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 06:55:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2022-04-15 06:55:04,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:04,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 41 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:04,428 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 41 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:04,428 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 41 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:04,429 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-15 06:55:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 06:55:04,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:04,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:04,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 46 states. [2022-04-15 06:55:04,430 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 46 states. [2022-04-15 06:55:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:04,431 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-15 06:55:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 06:55:04,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:04,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:04,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:04,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-04-15 06:55:04,432 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 34 [2022-04-15 06:55:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:04,432 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-04-15 06:55:04,432 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:04,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 44 transitions. [2022-04-15 06:55:04,513 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 06:55:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-15 06:55:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:55:04,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:04,514 INFO L499 BasicCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:04,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 06:55:04,514 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash -142924286, now seen corresponding path program 15 times [2022-04-15 06:55:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:04,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1198480144] [2022-04-15 06:55:06,890 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:07,105 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:07,105 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2112190904, now seen corresponding path program 1 times [2022-04-15 06:55:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:07,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243579387] [2022-04-15 06:55:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:07,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:07,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {5394#(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(12, 2);call #Ultimate.allocInit(12, 3); {5388#true} is VALID [2022-04-15 06:55:07,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {5388#true} assume true; {5388#true} is VALID [2022-04-15 06:55:07,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5388#true} {5388#true} #63#return; {5388#true} is VALID [2022-04-15 06:55:07,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {5388#true} call ULTIMATE.init(); {5394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:07,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {5394#(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(12, 2);call #Ultimate.allocInit(12, 3); {5388#true} is VALID [2022-04-15 06:55:07,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {5388#true} assume true; {5388#true} is VALID [2022-04-15 06:55:07,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5388#true} {5388#true} #63#return; {5388#true} is VALID [2022-04-15 06:55:07,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {5388#true} call #t~ret7 := main(); {5388#true} is VALID [2022-04-15 06:55:07,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {5388#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5388#true} is VALID [2022-04-15 06:55:07,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {5388#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5393#(= main_~y~0 0)} is VALID [2022-04-15 06:55:07,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {5393#(= main_~y~0 0)} [103] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_274| |v_main_#t~post4_259|)) (.cse1 (= v_main_~z~0_446 v_main_~z~0_430)) (.cse2 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (= v_main_~y~0_94 v_main_~y~0_93) .cse0 .cse1 .cse2) (and (= v_main_~y~0_93 v_main_~y~0_94) .cse0 .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_274|, main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_74|, main_~z~0=v_main_~z~0_446} OutVars{main_#t~post4=|v_main_#t~post4_259|, main_#t~post5=|v_main_#t~post5_73|, main_~y~0=v_main_~y~0_93, main_~z~0=v_main_~z~0_430} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {5393#(= main_~y~0 0)} is VALID [2022-04-15 06:55:07,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {5393#(= main_~y~0 0)} [102] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {5389#false} is VALID [2022-04-15 06:55:07,146 INFO L272 TraceCheckUtils]: 9: Hoare triple {5389#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5389#false} is VALID [2022-04-15 06:55:07,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {5389#false} ~cond := #in~cond; {5389#false} is VALID [2022-04-15 06:55:07,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {5389#false} assume 0 == ~cond; {5389#false} is VALID [2022-04-15 06:55:07,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {5389#false} assume !false; {5389#false} is VALID [2022-04-15 06:55:07,146 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 06:55:07,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:07,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243579387] [2022-04-15 06:55:07,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243579387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:07,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:07,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:07,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:07,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1198480144] [2022-04-15 06:55:07,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1198480144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:07,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:07,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:55:07,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416204818] [2022-04-15 06:55:07,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-04-15 06:55:07,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:07,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:07,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:07,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:55:07,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:07,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:55:07,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:55:07,388 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:08,464 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-04-15 06:55:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:55:08,465 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-04-15 06:55:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2022-04-15 06:55:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2022-04-15 06:55:08,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 67 transitions. [2022-04-15 06:55:08,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:08,516 INFO L225 Difference]: With dead ends: 81 [2022-04-15 06:55:08,516 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 06:55:08,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 06:55:08,517 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:08,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:55:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 06:55:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-04-15 06:55:08,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:08,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:08,578 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:08,578 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:08,581 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-15 06:55:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-04-15 06:55:08,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:08,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:08,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-15 06:55:08,582 INFO L87 Difference]: Start difference. First operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-15 06:55:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:08,583 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-15 06:55:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-04-15 06:55:08,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:08,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:08,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:08,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-04-15 06:55:08,586 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 35 [2022-04-15 06:55:08,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:08,586 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-04-15 06:55:08,586 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:08,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2022-04-15 06:55:08,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-15 06:55:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 06:55:08,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:08,663 INFO L499 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:08,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 06:55:08,663 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:08,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:08,664 INFO L85 PathProgramCache]: Analyzing trace with hash 816597026, now seen corresponding path program 16 times [2022-04-15 06:55:08,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:08,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [721039227] [2022-04-15 06:55:11,229 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:11,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:11,630 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:11,631 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2123671048, now seen corresponding path program 1 times [2022-04-15 06:55:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:11,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340778991] [2022-04-15 06:55:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:11,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:11,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {5794#(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(12, 2);call #Ultimate.allocInit(12, 3); {5788#true} is VALID [2022-04-15 06:55:11,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-15 06:55:11,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5788#true} {5788#true} #63#return; {5788#true} is VALID [2022-04-15 06:55:11,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {5788#true} call ULTIMATE.init(); {5794#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:11,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {5794#(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(12, 2);call #Ultimate.allocInit(12, 3); {5788#true} is VALID [2022-04-15 06:55:11,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-15 06:55:11,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5788#true} {5788#true} #63#return; {5788#true} is VALID [2022-04-15 06:55:11,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {5788#true} call #t~ret7 := main(); {5788#true} is VALID [2022-04-15 06:55:11,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {5788#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5788#true} is VALID [2022-04-15 06:55:11,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {5788#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5793#(= main_~y~0 0)} is VALID [2022-04-15 06:55:11,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {5793#(= main_~y~0 0)} [105] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~z~0_491 v_main_~z~0_474)) (.cse1 (= |v_main_#t~post5_79| |v_main_#t~post5_78|))) (or (and .cse0 (= |v_main_#t~post4_284| |v_main_#t~post4_300|) .cse1 (= v_main_~y~0_99 v_main_~y~0_100)) (and (= v_main_~y~0_100 v_main_~y~0_99) .cse0 (= |v_main_#t~post4_300| |v_main_#t~post4_284|) .cse1))) InVars {main_#t~post4=|v_main_#t~post4_300|, main_~y~0=v_main_~y~0_100, main_#t~post5=|v_main_#t~post5_79|, main_~z~0=v_main_~z~0_491} OutVars{main_#t~post4=|v_main_#t~post4_284|, main_#t~post5=|v_main_#t~post5_78|, main_~y~0=v_main_~y~0_99, main_~z~0=v_main_~z~0_474} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {5793#(= main_~y~0 0)} is VALID [2022-04-15 06:55:11,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {5793#(= main_~y~0 0)} [104] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {5789#false} is VALID [2022-04-15 06:55:11,674 INFO L272 TraceCheckUtils]: 9: Hoare triple {5789#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5789#false} is VALID [2022-04-15 06:55:11,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {5789#false} ~cond := #in~cond; {5789#false} is VALID [2022-04-15 06:55:11,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {5789#false} assume 0 == ~cond; {5789#false} is VALID [2022-04-15 06:55:11,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {5789#false} assume !false; {5789#false} is VALID [2022-04-15 06:55:11,674 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 06:55:11,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:11,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340778991] [2022-04-15 06:55:11,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340778991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:11,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:11,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:11,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:11,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [721039227] [2022-04-15 06:55:11,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [721039227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:11,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:11,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:55:11,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106729855] [2022-04-15 06:55:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:11,924 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-04-15 06:55:11,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:11,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:11,947 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 06:55:11,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:55:11,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:11,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:55:11,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:55:11,948 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:13,178 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-04-15 06:55:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:55:13,179 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-04-15 06:55:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-15 06:55:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-15 06:55:13,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2022-04-15 06:55:13,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:13,247 INFO L225 Difference]: With dead ends: 83 [2022-04-15 06:55:13,247 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 06:55:13,248 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:55:13,249 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:13,249 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:55:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 06:55:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2022-04-15 06:55:13,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:13,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 43 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:13,320 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 43 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:13,320 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 43 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:13,321 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 06:55:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-15 06:55:13,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:13,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:13,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 48 states. [2022-04-15 06:55:13,322 INFO L87 Difference]: Start difference. First operand has 43 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 48 states. [2022-04-15 06:55:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:13,323 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 06:55:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-15 06:55:13,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:13,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:13,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:13,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-04-15 06:55:13,325 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 36 [2022-04-15 06:55:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:13,325 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-04-15 06:55:13,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:13,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 46 transitions. [2022-04-15 06:55:13,399 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 06:55:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-15 06:55:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:55:13,400 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:13,400 INFO L499 BasicCegarLoop]: trace histogram [17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:13,400 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 06:55:13,400 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash 496986626, now seen corresponding path program 17 times [2022-04-15 06:55:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:13,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [381240960] [2022-04-15 06:55:13,879 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:14,088 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:14,088 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2064565704, now seen corresponding path program 1 times [2022-04-15 06:55:14,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:14,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053066963] [2022-04-15 06:55:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:14,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:14,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:14,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {6205#(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(12, 2);call #Ultimate.allocInit(12, 3); {6199#true} is VALID [2022-04-15 06:55:14,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {6199#true} assume true; {6199#true} is VALID [2022-04-15 06:55:14,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6199#true} {6199#true} #63#return; {6199#true} is VALID [2022-04-15 06:55:14,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {6199#true} call ULTIMATE.init(); {6205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:14,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {6205#(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(12, 2);call #Ultimate.allocInit(12, 3); {6199#true} is VALID [2022-04-15 06:55:14,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {6199#true} assume true; {6199#true} is VALID [2022-04-15 06:55:14,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6199#true} {6199#true} #63#return; {6199#true} is VALID [2022-04-15 06:55:14,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {6199#true} call #t~ret7 := main(); {6199#true} is VALID [2022-04-15 06:55:14,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {6199#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6199#true} is VALID [2022-04-15 06:55:14,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {6199#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6204#(= main_~y~0 0)} is VALID [2022-04-15 06:55:14,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {6204#(= main_~y~0 0)} [107] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_106 v_main_~y~0_105)) (.cse1 (= v_main_~z~0_538 v_main_~z~0_520)) (.cse2 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and .cse0 .cse1 (= |v_main_#t~post4_310| |v_main_#t~post4_327|) .cse2) (and (= |v_main_#t~post4_327| |v_main_#t~post4_310|) .cse0 .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_327|, main_~y~0=v_main_~y~0_106, main_#t~post5=|v_main_#t~post5_84|, main_~z~0=v_main_~z~0_538} OutVars{main_#t~post4=|v_main_#t~post4_310|, main_#t~post5=|v_main_#t~post5_83|, main_~y~0=v_main_~y~0_105, main_~z~0=v_main_~z~0_520} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {6204#(= main_~y~0 0)} is VALID [2022-04-15 06:55:14,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {6204#(= main_~y~0 0)} [106] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {6200#false} is VALID [2022-04-15 06:55:14,146 INFO L272 TraceCheckUtils]: 9: Hoare triple {6200#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6200#false} is VALID [2022-04-15 06:55:14,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {6200#false} ~cond := #in~cond; {6200#false} is VALID [2022-04-15 06:55:14,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {6200#false} assume 0 == ~cond; {6200#false} is VALID [2022-04-15 06:55:14,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {6200#false} assume !false; {6200#false} is VALID [2022-04-15 06:55:14,146 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 06:55:14,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:14,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053066963] [2022-04-15 06:55:14,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053066963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:14,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:14,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:14,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:14,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [381240960] [2022-04-15 06:55:14,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [381240960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:14,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:14,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:55:14,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437418390] [2022-04-15 06:55:14,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:14,440 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-15 06:55:14,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:14,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:14,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:14,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:55:14,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:14,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:55:14,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:55:14,466 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:15,892 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-04-15 06:55:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:55:15,892 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-15 06:55:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 69 transitions. [2022-04-15 06:55:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 69 transitions. [2022-04-15 06:55:15,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 69 transitions. [2022-04-15 06:55:15,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:15,963 INFO L225 Difference]: With dead ends: 85 [2022-04-15 06:55:15,963 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 06:55:15,964 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:55:15,965 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:15,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 116 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:55:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 06:55:16,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-04-15 06:55:16,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:16,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:16,057 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:16,057 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:16,058 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-15 06:55:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-04-15 06:55:16,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:16,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:16,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-15 06:55:16,058 INFO L87 Difference]: Start difference. First operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-15 06:55:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:16,059 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-15 06:55:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-04-15 06:55:16,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:16,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:16,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:16,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-15 06:55:16,061 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 37 [2022-04-15 06:55:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:16,061 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-15 06:55:16,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:16,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 47 transitions. [2022-04-15 06:55:16,165 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 06:55:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 06:55:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 06:55:16,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:16,166 INFO L499 BasicCegarLoop]: trace histogram [18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:16,166 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 06:55:16,166 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:16,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash -821001182, now seen corresponding path program 18 times [2022-04-15 06:55:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:16,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [737131303] [2022-04-15 06:55:16,541 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:16,757 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:16,758 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2005460360, now seen corresponding path program 1 times [2022-04-15 06:55:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:16,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3718648] [2022-04-15 06:55:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:16,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {6627#(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(12, 2);call #Ultimate.allocInit(12, 3); {6621#true} is VALID [2022-04-15 06:55:16,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {6621#true} assume true; {6621#true} is VALID [2022-04-15 06:55:16,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6621#true} {6621#true} #63#return; {6621#true} is VALID [2022-04-15 06:55:16,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {6621#true} call ULTIMATE.init(); {6627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:16,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {6627#(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(12, 2);call #Ultimate.allocInit(12, 3); {6621#true} is VALID [2022-04-15 06:55:16,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {6621#true} assume true; {6621#true} is VALID [2022-04-15 06:55:16,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6621#true} {6621#true} #63#return; {6621#true} is VALID [2022-04-15 06:55:16,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {6621#true} call #t~ret7 := main(); {6621#true} is VALID [2022-04-15 06:55:16,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {6621#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6621#true} is VALID [2022-04-15 06:55:16,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {6621#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6626#(= main_~y~0 0)} is VALID [2022-04-15 06:55:16,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {6626#(= main_~y~0 0)} [109] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_112 v_main_~y~0_111) (= |v_main_#t~post4_355| |v_main_#t~post4_337|) (= |v_main_#t~post5_89| |v_main_#t~post5_88|) (= v_main_~z~0_587 v_main_~z~0_568)) InVars {main_#t~post4=|v_main_#t~post4_355|, main_~y~0=v_main_~y~0_112, main_#t~post5=|v_main_#t~post5_89|, main_~z~0=v_main_~z~0_587} OutVars{main_#t~post4=|v_main_#t~post4_337|, main_#t~post5=|v_main_#t~post5_88|, main_~y~0=v_main_~y~0_111, main_~z~0=v_main_~z~0_568} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {6626#(= main_~y~0 0)} is VALID [2022-04-15 06:55:16,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {6626#(= main_~y~0 0)} [108] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {6622#false} is VALID [2022-04-15 06:55:16,800 INFO L272 TraceCheckUtils]: 9: Hoare triple {6622#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6622#false} is VALID [2022-04-15 06:55:16,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {6622#false} ~cond := #in~cond; {6622#false} is VALID [2022-04-15 06:55:16,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {6622#false} assume 0 == ~cond; {6622#false} is VALID [2022-04-15 06:55:16,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {6622#false} assume !false; {6622#false} is VALID [2022-04-15 06:55:16,800 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 06:55:16,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3718648] [2022-04-15 06:55:16,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3718648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:16,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:16,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:17,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:17,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [737131303] [2022-04-15 06:55:17,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [737131303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:17,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:17,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:55:17,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69972421] [2022-04-15 06:55:17,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:17,135 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-15 06:55:17,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:17,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:17,161 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 06:55:17,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:55:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:55:17,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:55:17,162 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:18,292 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-04-15 06:55:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:55:18,292 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-15 06:55:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 70 transitions. [2022-04-15 06:55:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 70 transitions. [2022-04-15 06:55:18,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 70 transitions. [2022-04-15 06:55:18,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:18,344 INFO L225 Difference]: With dead ends: 87 [2022-04-15 06:55:18,344 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 06:55:18,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:55:18,345 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:18,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:55:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 06:55:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-04-15 06:55:18,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:18,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 45 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:18,426 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 45 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:18,427 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 45 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:18,428 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-04-15 06:55:18,428 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-15 06:55:18,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:18,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:18,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 50 states. [2022-04-15 06:55:18,428 INFO L87 Difference]: Start difference. First operand has 45 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 50 states. [2022-04-15 06:55:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:18,429 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-04-15 06:55:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-15 06:55:18,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:18,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:18,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:18,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-15 06:55:18,430 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 38 [2022-04-15 06:55:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:18,431 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-15 06:55:18,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:18,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 48 transitions. [2022-04-15 06:55:18,521 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 06:55:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-15 06:55:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 06:55:18,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:18,521 INFO L499 BasicCegarLoop]: trace histogram [19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:18,521 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 06:55:18,521 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:18,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1271049730, now seen corresponding path program 19 times [2022-04-15 06:55:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:18,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403431377] [2022-04-15 06:55:19,021 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:19,307 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:19,307 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1946355016, now seen corresponding path program 1 times [2022-04-15 06:55:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:19,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289439197] [2022-04-15 06:55:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:19,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:19,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {7060#(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(12, 2);call #Ultimate.allocInit(12, 3); {7054#true} is VALID [2022-04-15 06:55:19,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {7054#true} assume true; {7054#true} is VALID [2022-04-15 06:55:19,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7054#true} {7054#true} #63#return; {7054#true} is VALID [2022-04-15 06:55:19,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {7054#true} call ULTIMATE.init(); {7060#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:19,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {7060#(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(12, 2);call #Ultimate.allocInit(12, 3); {7054#true} is VALID [2022-04-15 06:55:19,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {7054#true} assume true; {7054#true} is VALID [2022-04-15 06:55:19,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7054#true} {7054#true} #63#return; {7054#true} is VALID [2022-04-15 06:55:19,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {7054#true} call #t~ret7 := main(); {7054#true} is VALID [2022-04-15 06:55:19,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {7054#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7054#true} is VALID [2022-04-15 06:55:19,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {7054#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7059#(= main_~y~0 0)} is VALID [2022-04-15 06:55:19,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {7059#(= main_~y~0 0)} [111] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_118 v_main_~y~0_117) (= |v_main_#t~post5_94| |v_main_#t~post5_93|) (= v_main_~z~0_638 v_main_~z~0_618) (= |v_main_#t~post4_384| |v_main_#t~post4_365|)) InVars {main_#t~post4=|v_main_#t~post4_384|, main_~y~0=v_main_~y~0_118, main_#t~post5=|v_main_#t~post5_94|, main_~z~0=v_main_~z~0_638} OutVars{main_#t~post4=|v_main_#t~post4_365|, main_#t~post5=|v_main_#t~post5_93|, main_~y~0=v_main_~y~0_117, main_~z~0=v_main_~z~0_618} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {7059#(= main_~y~0 0)} is VALID [2022-04-15 06:55:19,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {7059#(= main_~y~0 0)} [110] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {7055#false} is VALID [2022-04-15 06:55:19,370 INFO L272 TraceCheckUtils]: 9: Hoare triple {7055#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7055#false} is VALID [2022-04-15 06:55:19,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {7055#false} ~cond := #in~cond; {7055#false} is VALID [2022-04-15 06:55:19,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {7055#false} assume 0 == ~cond; {7055#false} is VALID [2022-04-15 06:55:19,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {7055#false} assume !false; {7055#false} is VALID [2022-04-15 06:55:19,372 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 06:55:19,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:19,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289439197] [2022-04-15 06:55:19,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289439197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:19,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:19,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:19,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:19,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403431377] [2022-04-15 06:55:19,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403431377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:19,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:19,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:55:19,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872704392] [2022-04-15 06:55:19,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:19,704 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-04-15 06:55:19,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:19,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:19,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:19,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:55:19,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:19,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:55:19,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:55:19,736 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:20,944 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-15 06:55:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:55:20,945 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-04-15 06:55:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 71 transitions. [2022-04-15 06:55:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 71 transitions. [2022-04-15 06:55:20,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 71 transitions. [2022-04-15 06:55:21,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:21,001 INFO L225 Difference]: With dead ends: 89 [2022-04-15 06:55:21,001 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 06:55:21,002 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=1791, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:55:21,002 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:21,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:55:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 06:55:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2022-04-15 06:55:21,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:21,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 46 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:21,088 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 46 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:21,088 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 46 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:21,089 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-15 06:55:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-15 06:55:21,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:21,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:21,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 51 states. [2022-04-15 06:55:21,090 INFO L87 Difference]: Start difference. First operand has 46 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 51 states. [2022-04-15 06:55:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:21,091 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-15 06:55:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-15 06:55:21,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:21,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:21,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:21,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-15 06:55:21,093 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 39 [2022-04-15 06:55:21,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:21,093 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-15 06:55:21,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:21,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-15 06:55:21,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-15 06:55:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 06:55:21,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:21,215 INFO L499 BasicCegarLoop]: trace histogram [20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:21,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 06:55:21,215 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1700118562, now seen corresponding path program 20 times [2022-04-15 06:55:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:21,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1816810634] [2022-04-15 06:55:21,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:21,934 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:21,935 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1887249672, now seen corresponding path program 1 times [2022-04-15 06:55:21,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:21,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673682387] [2022-04-15 06:55:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:21,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:21,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {7504#(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(12, 2);call #Ultimate.allocInit(12, 3); {7498#true} is VALID [2022-04-15 06:55:21,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {7498#true} assume true; {7498#true} is VALID [2022-04-15 06:55:21,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7498#true} {7498#true} #63#return; {7498#true} is VALID [2022-04-15 06:55:21,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {7498#true} call ULTIMATE.init(); {7504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:21,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {7504#(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(12, 2);call #Ultimate.allocInit(12, 3); {7498#true} is VALID [2022-04-15 06:55:21,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {7498#true} assume true; {7498#true} is VALID [2022-04-15 06:55:21,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7498#true} {7498#true} #63#return; {7498#true} is VALID [2022-04-15 06:55:21,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {7498#true} call #t~ret7 := main(); {7498#true} is VALID [2022-04-15 06:55:21,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {7498#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7498#true} is VALID [2022-04-15 06:55:21,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {7498#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7503#(= main_~y~0 0)} is VALID [2022-04-15 06:55:21,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {7503#(= main_~y~0 0)} [113] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post4_414| |v_main_#t~post4_394|) (= |v_main_#t~post5_99| |v_main_#t~post5_98|) (= v_main_~y~0_124 v_main_~y~0_123) (= v_main_~z~0_691 v_main_~z~0_670)) InVars {main_#t~post4=|v_main_#t~post4_414|, main_~y~0=v_main_~y~0_124, main_#t~post5=|v_main_#t~post5_99|, main_~z~0=v_main_~z~0_691} OutVars{main_#t~post4=|v_main_#t~post4_394|, main_#t~post5=|v_main_#t~post5_98|, main_~y~0=v_main_~y~0_123, main_~z~0=v_main_~z~0_670} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {7503#(= main_~y~0 0)} is VALID [2022-04-15 06:55:21,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {7503#(= main_~y~0 0)} [112] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {7499#false} is VALID [2022-04-15 06:55:21,985 INFO L272 TraceCheckUtils]: 9: Hoare triple {7499#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7499#false} is VALID [2022-04-15 06:55:21,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {7499#false} ~cond := #in~cond; {7499#false} is VALID [2022-04-15 06:55:21,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {7499#false} assume 0 == ~cond; {7499#false} is VALID [2022-04-15 06:55:21,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {7499#false} assume !false; {7499#false} is VALID [2022-04-15 06:55:21,986 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 06:55:21,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:21,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673682387] [2022-04-15 06:55:21,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673682387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:21,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:21,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:22,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:22,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1816810634] [2022-04-15 06:55:22,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1816810634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:22,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:22,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 06:55:22,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700595927] [2022-04-15 06:55:22,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:22,398 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-04-15 06:55:22,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:22,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:22,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:22,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 06:55:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:22,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 06:55:22,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:55:22,423 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:23,678 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-15 06:55:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:55:23,678 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-04-15 06:55:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions. [2022-04-15 06:55:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions. [2022-04-15 06:55:23,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 72 transitions. [2022-04-15 06:55:23,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:23,741 INFO L225 Difference]: With dead ends: 91 [2022-04-15 06:55:23,741 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 06:55:23,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=1964, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:55:23,742 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:23,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:55:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 06:55:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2022-04-15 06:55:23,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:23,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 47 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:23,817 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 47 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:23,817 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 47 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:23,818 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 06:55:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-15 06:55:23,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:23,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:23,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 52 states. [2022-04-15 06:55:23,819 INFO L87 Difference]: Start difference. First operand has 47 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 52 states. [2022-04-15 06:55:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:23,820 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 06:55:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-15 06:55:23,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:23,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:23,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:23,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-15 06:55:23,821 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 40 [2022-04-15 06:55:23,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:23,822 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-15 06:55:23,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:23,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-15 06:55:23,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 06:55:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:55:23,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:23,927 INFO L499 BasicCegarLoop]: trace histogram [21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:23,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 06:55:23,927 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2116350466, now seen corresponding path program 21 times [2022-04-15 06:55:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:23,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [472826982] [2022-04-15 06:55:26,760 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:26,940 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:27,173 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:27,173 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1828144328, now seen corresponding path program 1 times [2022-04-15 06:55:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:27,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459089449] [2022-04-15 06:55:27,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:27,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:27,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:27,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {7959#(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(12, 2);call #Ultimate.allocInit(12, 3); {7953#true} is VALID [2022-04-15 06:55:27,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {7953#true} assume true; {7953#true} is VALID [2022-04-15 06:55:27,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7953#true} {7953#true} #63#return; {7953#true} is VALID [2022-04-15 06:55:27,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {7953#true} call ULTIMATE.init(); {7959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:27,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {7959#(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(12, 2);call #Ultimate.allocInit(12, 3); {7953#true} is VALID [2022-04-15 06:55:27,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {7953#true} assume true; {7953#true} is VALID [2022-04-15 06:55:27,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7953#true} {7953#true} #63#return; {7953#true} is VALID [2022-04-15 06:55:27,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {7953#true} call #t~ret7 := main(); {7953#true} is VALID [2022-04-15 06:55:27,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {7953#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7953#true} is VALID [2022-04-15 06:55:27,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {7953#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7958#(= main_~y~0 0)} is VALID [2022-04-15 06:55:27,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {7958#(= main_~y~0 0)} [115] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~z~0_746 v_main_~z~0_724)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse2 (= |v_main_#t~post4_445| |v_main_#t~post4_424|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_130 v_main_~y~0_129)) (and (= v_main_~y~0_129 v_main_~y~0_130) .cse0 .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_445|, main_~y~0=v_main_~y~0_130, main_#t~post5=|v_main_#t~post5_104|, main_~z~0=v_main_~z~0_746} OutVars{main_#t~post4=|v_main_#t~post4_424|, main_#t~post5=|v_main_#t~post5_103|, main_~y~0=v_main_~y~0_129, main_~z~0=v_main_~z~0_724} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {7958#(= main_~y~0 0)} is VALID [2022-04-15 06:55:27,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {7958#(= main_~y~0 0)} [114] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {7954#false} is VALID [2022-04-15 06:55:27,219 INFO L272 TraceCheckUtils]: 9: Hoare triple {7954#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7954#false} is VALID [2022-04-15 06:55:27,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {7954#false} ~cond := #in~cond; {7954#false} is VALID [2022-04-15 06:55:27,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {7954#false} assume 0 == ~cond; {7954#false} is VALID [2022-04-15 06:55:27,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {7954#false} assume !false; {7954#false} is VALID [2022-04-15 06:55:27,219 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 06:55:27,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:27,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459089449] [2022-04-15 06:55:27,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459089449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:27,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:27,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:27,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:27,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [472826982] [2022-04-15 06:55:27,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [472826982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:27,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:27,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:55:27,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891159534] [2022-04-15 06:55:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:27,572 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-04-15 06:55:27,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:27,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:27,601 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 06:55:27,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:55:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:27,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:55:27,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:55:27,602 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:28,950 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-04-15 06:55:28,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:55:28,950 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-04-15 06:55:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 73 transitions. [2022-04-15 06:55:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 73 transitions. [2022-04-15 06:55:28,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 73 transitions. [2022-04-15 06:55:29,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:29,008 INFO L225 Difference]: With dead ends: 93 [2022-04-15 06:55:29,008 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:55:29,009 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=2145, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:55:29,009 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:29,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:55:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:55:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2022-04-15 06:55:29,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:29,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 48 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:29,089 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 48 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:29,089 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 48 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:29,090 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-15 06:55:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-15 06:55:29,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:29,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:29,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 53 states. [2022-04-15 06:55:29,091 INFO L87 Difference]: Start difference. First operand has 48 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 53 states. [2022-04-15 06:55:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:29,092 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-15 06:55:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-15 06:55:29,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:29,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:29,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:29,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-04-15 06:55:29,093 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 41 [2022-04-15 06:55:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:29,093 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-04-15 06:55:29,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:29,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 51 transitions. [2022-04-15 06:55:29,219 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 06:55:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-04-15 06:55:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:55:29,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:29,220 INFO L499 BasicCegarLoop]: trace histogram [22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:29,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 06:55:29,220 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2134637602, now seen corresponding path program 22 times [2022-04-15 06:55:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:29,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1442269040] [2022-04-15 06:55:30,766 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:30,920 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:31,178 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:31,178 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:31,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1769038984, now seen corresponding path program 1 times [2022-04-15 06:55:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:31,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93389166] [2022-04-15 06:55:31,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:31,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:31,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {8425#(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(12, 2);call #Ultimate.allocInit(12, 3); {8419#true} is VALID [2022-04-15 06:55:31,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {8419#true} assume true; {8419#true} is VALID [2022-04-15 06:55:31,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8419#true} {8419#true} #63#return; {8419#true} is VALID [2022-04-15 06:55:31,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {8419#true} call ULTIMATE.init(); {8425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:31,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {8425#(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(12, 2);call #Ultimate.allocInit(12, 3); {8419#true} is VALID [2022-04-15 06:55:31,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {8419#true} assume true; {8419#true} is VALID [2022-04-15 06:55:31,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8419#true} {8419#true} #63#return; {8419#true} is VALID [2022-04-15 06:55:31,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {8419#true} call #t~ret7 := main(); {8419#true} is VALID [2022-04-15 06:55:31,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {8419#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {8419#true} is VALID [2022-04-15 06:55:31,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {8419#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {8424#(= main_~y~0 0)} is VALID [2022-04-15 06:55:31,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {8424#(= main_~y~0 0)} [117] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_803 v_main_~z~0_780) (= |v_main_#t~post4_477| |v_main_#t~post4_455|) (= v_main_~y~0_136 v_main_~y~0_135) (= |v_main_#t~post5_109| |v_main_#t~post5_108|)) InVars {main_#t~post4=|v_main_#t~post4_477|, main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_109|, main_~z~0=v_main_~z~0_803} OutVars{main_#t~post4=|v_main_#t~post4_455|, main_#t~post5=|v_main_#t~post5_108|, main_~y~0=v_main_~y~0_135, main_~z~0=v_main_~z~0_780} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {8424#(= main_~y~0 0)} is VALID [2022-04-15 06:55:31,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {8424#(= main_~y~0 0)} [116] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {8420#false} is VALID [2022-04-15 06:55:31,216 INFO L272 TraceCheckUtils]: 9: Hoare triple {8420#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8420#false} is VALID [2022-04-15 06:55:31,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {8420#false} ~cond := #in~cond; {8420#false} is VALID [2022-04-15 06:55:31,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {8420#false} assume 0 == ~cond; {8420#false} is VALID [2022-04-15 06:55:31,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {8420#false} assume !false; {8420#false} is VALID [2022-04-15 06:55:31,216 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 06:55:31,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:31,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93389166] [2022-04-15 06:55:31,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93389166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:31,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:31,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:31,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:31,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1442269040] [2022-04-15 06:55:31,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1442269040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:31,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:31,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 06:55:31,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174539569] [2022-04-15 06:55:31,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:31,620 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2022-04-15 06:55:31,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:31,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:31,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:31,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 06:55:31,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:31,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 06:55:31,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:55:31,654 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:33,046 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2022-04-15 06:55:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:55:33,047 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2022-04-15 06:55:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 74 transitions. [2022-04-15 06:55:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 74 transitions. [2022-04-15 06:55:33,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 74 transitions. [2022-04-15 06:55:33,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:33,113 INFO L225 Difference]: With dead ends: 95 [2022-04-15 06:55:33,113 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 06:55:33,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=2334, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:55:33,114 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:33,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 46 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:55:33,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 06:55:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-04-15 06:55:33,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:33,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 49 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:33,206 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 49 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:33,206 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 49 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:33,208 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-04-15 06:55:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-04-15 06:55:33,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:33,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:33,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 54 states. [2022-04-15 06:55:33,208 INFO L87 Difference]: Start difference. First operand has 49 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 54 states. [2022-04-15 06:55:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:33,209 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-04-15 06:55:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-04-15 06:55:33,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:33,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:33,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:33,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-04-15 06:55:33,211 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 42 [2022-04-15 06:55:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:33,212 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-04-15 06:55:33,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:33,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 52 transitions. [2022-04-15 06:55:33,342 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 06:55:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-15 06:55:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 06:55:33,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:33,343 INFO L499 BasicCegarLoop]: trace histogram [23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:33,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 06:55:33,343 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1593428478, now seen corresponding path program 23 times [2022-04-15 06:55:33,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:33,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [612583379] [2022-04-15 06:55:35,989 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:36,133 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:36,412 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:36,412 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1709933640, now seen corresponding path program 1 times [2022-04-15 06:55:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:36,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691277866] [2022-04-15 06:55:36,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:36,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:36,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {8902#(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(12, 2);call #Ultimate.allocInit(12, 3); {8896#true} is VALID [2022-04-15 06:55:36,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {8896#true} assume true; {8896#true} is VALID [2022-04-15 06:55:36,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8896#true} {8896#true} #63#return; {8896#true} is VALID [2022-04-15 06:55:36,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {8896#true} call ULTIMATE.init(); {8902#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:36,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {8902#(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(12, 2);call #Ultimate.allocInit(12, 3); {8896#true} is VALID [2022-04-15 06:55:36,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {8896#true} assume true; {8896#true} is VALID [2022-04-15 06:55:36,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8896#true} {8896#true} #63#return; {8896#true} is VALID [2022-04-15 06:55:36,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {8896#true} call #t~ret7 := main(); {8896#true} is VALID [2022-04-15 06:55:36,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {8896#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {8896#true} is VALID [2022-04-15 06:55:36,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {8896#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {8901#(= main_~y~0 0)} is VALID [2022-04-15 06:55:36,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {8901#(= main_~y~0 0)} [119] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post5_114| |v_main_#t~post5_113|) (= |v_main_#t~post4_510| |v_main_#t~post4_487|) (= v_main_~z~0_862 v_main_~z~0_838) (= v_main_~y~0_142 v_main_~y~0_141)) InVars {main_#t~post4=|v_main_#t~post4_510|, main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_114|, main_~z~0=v_main_~z~0_862} OutVars{main_#t~post4=|v_main_#t~post4_487|, main_#t~post5=|v_main_#t~post5_113|, main_~y~0=v_main_~y~0_141, main_~z~0=v_main_~z~0_838} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {8901#(= main_~y~0 0)} is VALID [2022-04-15 06:55:36,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {8901#(= main_~y~0 0)} [118] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {8897#false} is VALID [2022-04-15 06:55:36,451 INFO L272 TraceCheckUtils]: 9: Hoare triple {8897#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8897#false} is VALID [2022-04-15 06:55:36,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {8897#false} ~cond := #in~cond; {8897#false} is VALID [2022-04-15 06:55:36,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {8897#false} assume 0 == ~cond; {8897#false} is VALID [2022-04-15 06:55:36,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {8897#false} assume !false; {8897#false} is VALID [2022-04-15 06:55:36,452 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 06:55:36,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:36,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691277866] [2022-04-15 06:55:36,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691277866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:36,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:36,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:36,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:36,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [612583379] [2022-04-15 06:55:36,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [612583379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:36,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:36,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:55:36,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440913500] [2022-04-15 06:55:36,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:36,839 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-15 06:55:36,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:36,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:36,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:36,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:55:36,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:36,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:55:36,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:55:36,864 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:38,798 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-04-15 06:55:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:55:38,799 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-15 06:55:38,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-15 06:55:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-15 06:55:38,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2022-04-15 06:55:38,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:38,871 INFO L225 Difference]: With dead ends: 97 [2022-04-15 06:55:38,871 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 06:55:38,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=2531, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:55:38,872 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:38,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 146 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:55:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 06:55:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-04-15 06:55:38,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:38,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 50 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:38,952 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 50 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:38,952 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 50 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:38,953 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-04-15 06:55:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-15 06:55:38,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:38,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:38,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 55 states. [2022-04-15 06:55:38,954 INFO L87 Difference]: Start difference. First operand has 50 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 55 states. [2022-04-15 06:55:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:38,954 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-04-15 06:55:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-15 06:55:38,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:38,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:38,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:38,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-04-15 06:55:38,956 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 43 [2022-04-15 06:55:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:38,956 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-04-15 06:55:38,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:38,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 53 transitions. [2022-04-15 06:55:39,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-04-15 06:55:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:55:39,071 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:39,071 INFO L499 BasicCegarLoop]: trace histogram [24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:39,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 06:55:39,071 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:39,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1199359966, now seen corresponding path program 24 times [2022-04-15 06:55:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:39,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [129724211] [2022-04-15 06:55:39,431 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:39,694 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:39,694 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:39,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1650828296, now seen corresponding path program 1 times [2022-04-15 06:55:39,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:39,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055753971] [2022-04-15 06:55:39,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:39,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:39,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {9390#(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(12, 2);call #Ultimate.allocInit(12, 3); {9384#true} is VALID [2022-04-15 06:55:39,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {9384#true} assume true; {9384#true} is VALID [2022-04-15 06:55:39,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9384#true} {9384#true} #63#return; {9384#true} is VALID [2022-04-15 06:55:39,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {9384#true} call ULTIMATE.init(); {9390#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:39,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {9390#(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(12, 2);call #Ultimate.allocInit(12, 3); {9384#true} is VALID [2022-04-15 06:55:39,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {9384#true} assume true; {9384#true} is VALID [2022-04-15 06:55:39,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9384#true} {9384#true} #63#return; {9384#true} is VALID [2022-04-15 06:55:39,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {9384#true} call #t~ret7 := main(); {9384#true} is VALID [2022-04-15 06:55:39,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {9384#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {9384#true} is VALID [2022-04-15 06:55:39,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {9384#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {9389#(= main_~y~0 0)} is VALID [2022-04-15 06:55:39,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {9389#(= main_~y~0 0)} [121] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_544| |v_main_#t~post4_520|)) (.cse1 (= v_main_~z~0_923 v_main_~z~0_898)) (.cse2 (= |v_main_#t~post5_119| |v_main_#t~post5_118|))) (or (and .cse0 .cse1 (= v_main_~y~0_148 v_main_~y~0_147) .cse2) (and .cse0 .cse1 .cse2 (= v_main_~y~0_147 v_main_~y~0_148)))) InVars {main_#t~post4=|v_main_#t~post4_544|, main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_119|, main_~z~0=v_main_~z~0_923} OutVars{main_#t~post4=|v_main_#t~post4_520|, main_#t~post5=|v_main_#t~post5_118|, main_~y~0=v_main_~y~0_147, main_~z~0=v_main_~z~0_898} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {9389#(= main_~y~0 0)} is VALID [2022-04-15 06:55:39,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {9389#(= main_~y~0 0)} [120] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {9385#false} is VALID [2022-04-15 06:55:39,757 INFO L272 TraceCheckUtils]: 9: Hoare triple {9385#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {9385#false} is VALID [2022-04-15 06:55:39,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {9385#false} ~cond := #in~cond; {9385#false} is VALID [2022-04-15 06:55:39,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {9385#false} assume 0 == ~cond; {9385#false} is VALID [2022-04-15 06:55:39,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {9385#false} assume !false; {9385#false} is VALID [2022-04-15 06:55:39,757 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 06:55:39,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:39,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055753971] [2022-04-15 06:55:39,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055753971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:39,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:39,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:40,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:40,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [129724211] [2022-04-15 06:55:40,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [129724211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:40,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:40,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 06:55:40,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284528782] [2022-04-15 06:55:40,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:40,317 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-04-15 06:55:40,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:40,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:40,343 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 06:55:40,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 06:55:40,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 06:55:40,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:55:40,344 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:42,180 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-04-15 06:55:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:55:42,181 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-04-15 06:55:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 76 transitions. [2022-04-15 06:55:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 76 transitions. [2022-04-15 06:55:42,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 76 transitions. [2022-04-15 06:55:42,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:42,261 INFO L225 Difference]: With dead ends: 99 [2022-04-15 06:55:42,261 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 06:55:42,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=2736, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:55:42,263 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:42,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 91 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:55:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 06:55:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-04-15 06:55:42,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:42,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 51 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:42,384 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 51 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:42,384 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 51 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:42,385 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 06:55:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 06:55:42,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:42,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:42,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 56 states. [2022-04-15 06:55:42,385 INFO L87 Difference]: Start difference. First operand has 51 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 56 states. [2022-04-15 06:55:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:42,386 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 06:55:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 06:55:42,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:42,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:42,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:42,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-04-15 06:55:42,389 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 44 [2022-04-15 06:55:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:42,389 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-04-15 06:55:42,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:42,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2022-04-15 06:55:42,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-15 06:55:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 06:55:42,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:42,533 INFO L499 BasicCegarLoop]: trace histogram [25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:42,533 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 06:55:42,533 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1868137982, now seen corresponding path program 25 times [2022-04-15 06:55:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:42,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1974535471] [2022-04-15 06:55:45,350 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:45,516 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:45,840 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:45,841 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1591722952, now seen corresponding path program 1 times [2022-04-15 06:55:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:45,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547134291] [2022-04-15 06:55:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:45,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:45,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {9889#(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(12, 2);call #Ultimate.allocInit(12, 3); {9883#true} is VALID [2022-04-15 06:55:45,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {9883#true} assume true; {9883#true} is VALID [2022-04-15 06:55:45,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9883#true} {9883#true} #63#return; {9883#true} is VALID [2022-04-15 06:55:45,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {9883#true} call ULTIMATE.init(); {9889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:45,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {9889#(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(12, 2);call #Ultimate.allocInit(12, 3); {9883#true} is VALID [2022-04-15 06:55:45,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {9883#true} assume true; {9883#true} is VALID [2022-04-15 06:55:45,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9883#true} {9883#true} #63#return; {9883#true} is VALID [2022-04-15 06:55:45,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {9883#true} call #t~ret7 := main(); {9883#true} is VALID [2022-04-15 06:55:45,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {9883#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {9883#true} is VALID [2022-04-15 06:55:45,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {9883#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {9888#(= main_~y~0 0)} is VALID [2022-04-15 06:55:45,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {9888#(= main_~y~0 0)} [123] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_986 v_main_~z~0_960) (= |v_main_#t~post5_124| |v_main_#t~post5_123|) (= v_main_~y~0_154 v_main_~y~0_153) (= |v_main_#t~post4_579| |v_main_#t~post4_554|)) InVars {main_#t~post4=|v_main_#t~post4_579|, main_~y~0=v_main_~y~0_154, main_#t~post5=|v_main_#t~post5_124|, main_~z~0=v_main_~z~0_986} OutVars{main_#t~post4=|v_main_#t~post4_554|, main_#t~post5=|v_main_#t~post5_123|, main_~y~0=v_main_~y~0_153, main_~z~0=v_main_~z~0_960} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {9888#(= main_~y~0 0)} is VALID [2022-04-15 06:55:45,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {9888#(= main_~y~0 0)} [122] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {9884#false} is VALID [2022-04-15 06:55:45,890 INFO L272 TraceCheckUtils]: 9: Hoare triple {9884#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {9884#false} is VALID [2022-04-15 06:55:45,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {9884#false} ~cond := #in~cond; {9884#false} is VALID [2022-04-15 06:55:45,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {9884#false} assume 0 == ~cond; {9884#false} is VALID [2022-04-15 06:55:45,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {9884#false} assume !false; {9884#false} is VALID [2022-04-15 06:55:45,890 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 06:55:45,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:45,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547134291] [2022-04-15 06:55:45,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547134291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:45,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:45,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:46,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:46,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1974535471] [2022-04-15 06:55:46,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1974535471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:46,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:46,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:55:46,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100898196] [2022-04-15 06:55:46,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:46,391 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-04-15 06:55:46,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:46,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:46,417 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 06:55:46,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:55:46,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:46,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:55:46,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:55:46,419 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:48,212 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-04-15 06:55:48,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:55:48,212 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-04-15 06:55:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 06:55:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 06:55:48,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 77 transitions. [2022-04-15 06:55:48,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:48,287 INFO L225 Difference]: With dead ends: 101 [2022-04-15 06:55:48,287 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 06:55:48,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=2949, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:55:48,289 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:48,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:55:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 06:55:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-04-15 06:55:48,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:48,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 52 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:48,379 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 52 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:48,379 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 52 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:48,380 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-04-15 06:55:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-15 06:55:48,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:48,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:48,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 57 states. [2022-04-15 06:55:48,380 INFO L87 Difference]: Start difference. First operand has 52 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 57 states. [2022-04-15 06:55:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:48,381 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-04-15 06:55:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-15 06:55:48,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:48,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:48,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:48,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-04-15 06:55:48,382 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 45 [2022-04-15 06:55:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:48,382 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-04-15 06:55:48,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:48,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 55 transitions. [2022-04-15 06:55:48,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-04-15 06:55:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 06:55:48,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:48,498 INFO L499 BasicCegarLoop]: trace histogram [26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:48,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 06:55:48,498 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:48,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:48,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1125419998, now seen corresponding path program 26 times [2022-04-15 06:55:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:48,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [43486758] [2022-04-15 06:55:48,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:49,191 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:49,192 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1532617608, now seen corresponding path program 1 times [2022-04-15 06:55:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:49,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070496002] [2022-04-15 06:55:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:49,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:49,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:49,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {10399#(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(12, 2);call #Ultimate.allocInit(12, 3); {10393#true} is VALID [2022-04-15 06:55:49,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {10393#true} assume true; {10393#true} is VALID [2022-04-15 06:55:49,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10393#true} {10393#true} #63#return; {10393#true} is VALID [2022-04-15 06:55:49,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {10393#true} call ULTIMATE.init(); {10399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:49,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {10399#(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(12, 2);call #Ultimate.allocInit(12, 3); {10393#true} is VALID [2022-04-15 06:55:49,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {10393#true} assume true; {10393#true} is VALID [2022-04-15 06:55:49,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10393#true} {10393#true} #63#return; {10393#true} is VALID [2022-04-15 06:55:49,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {10393#true} call #t~ret7 := main(); {10393#true} is VALID [2022-04-15 06:55:49,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {10393#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {10393#true} is VALID [2022-04-15 06:55:49,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {10393#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {10398#(= main_~y~0 0)} is VALID [2022-04-15 06:55:49,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {10398#(= main_~y~0 0)} [125] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post4_615| |v_main_#t~post4_589|)) (.cse2 (= v_main_~z~0_1051 v_main_~z~0_1024))) (or (and .cse0 (= v_main_~y~0_160 v_main_~y~0_159) .cse1 .cse2) (and .cse0 (= v_main_~y~0_159 v_main_~y~0_160) .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_615|, main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_129|, main_~z~0=v_main_~z~0_1051} OutVars{main_#t~post4=|v_main_#t~post4_589|, main_#t~post5=|v_main_#t~post5_128|, main_~y~0=v_main_~y~0_159, main_~z~0=v_main_~z~0_1024} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {10398#(= main_~y~0 0)} is VALID [2022-04-15 06:55:49,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {10398#(= main_~y~0 0)} [124] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {10394#false} is VALID [2022-04-15 06:55:49,225 INFO L272 TraceCheckUtils]: 9: Hoare triple {10394#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10394#false} is VALID [2022-04-15 06:55:49,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {10394#false} ~cond := #in~cond; {10394#false} is VALID [2022-04-15 06:55:49,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {10394#false} assume 0 == ~cond; {10394#false} is VALID [2022-04-15 06:55:49,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {10394#false} assume !false; {10394#false} is VALID [2022-04-15 06:55:49,225 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 06:55:49,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:49,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070496002] [2022-04-15 06:55:49,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070496002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:49,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:49,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:49,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:49,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [43486758] [2022-04-15 06:55:49,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [43486758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:49,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:49,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 06:55:49,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513689695] [2022-04-15 06:55:49,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:49,787 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-04-15 06:55:49,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:49,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:49,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:49,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 06:55:49,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:49,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 06:55:49,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:55:49,825 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:51,765 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-04-15 06:55:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:55:51,765 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-04-15 06:55:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2022-04-15 06:55:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2022-04-15 06:55:51,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 78 transitions. [2022-04-15 06:55:51,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:51,842 INFO L225 Difference]: With dead ends: 103 [2022-04-15 06:55:51,842 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 06:55:51,843 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=3170, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 06:55:51,844 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:51,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:55:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 06:55:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-04-15 06:55:51,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:51,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 53 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:51,934 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 53 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:51,934 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 53 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:51,935 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-04-15 06:55:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-04-15 06:55:51,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:51,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:51,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 58 states. [2022-04-15 06:55:51,936 INFO L87 Difference]: Start difference. First operand has 53 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 58 states. [2022-04-15 06:55:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:51,937 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-04-15 06:55:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-04-15 06:55:51,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:51,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:51,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:51,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-04-15 06:55:51,938 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 46 [2022-04-15 06:55:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:51,938 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-04-15 06:55:51,938 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:51,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 56 transitions. [2022-04-15 06:55:52,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 06:55:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 06:55:52,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:52,108 INFO L499 BasicCegarLoop]: trace histogram [27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:52,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 06:55:52,108 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:52,108 INFO L85 PathProgramCache]: Analyzing trace with hash 424001026, now seen corresponding path program 27 times [2022-04-15 06:55:52,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:52,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1941665467] [2022-04-15 06:55:54,030 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:54,243 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:54,243 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:54,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1473512264, now seen corresponding path program 1 times [2022-04-15 06:55:54,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:54,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118688287] [2022-04-15 06:55:54,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:54,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:54,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:54,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {10920#(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(12, 2);call #Ultimate.allocInit(12, 3); {10914#true} is VALID [2022-04-15 06:55:54,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {10914#true} assume true; {10914#true} is VALID [2022-04-15 06:55:54,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10914#true} {10914#true} #63#return; {10914#true} is VALID [2022-04-15 06:55:54,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {10914#true} call ULTIMATE.init(); {10920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:54,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {10920#(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(12, 2);call #Ultimate.allocInit(12, 3); {10914#true} is VALID [2022-04-15 06:55:54,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {10914#true} assume true; {10914#true} is VALID [2022-04-15 06:55:54,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10914#true} {10914#true} #63#return; {10914#true} is VALID [2022-04-15 06:55:54,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {10914#true} call #t~ret7 := main(); {10914#true} is VALID [2022-04-15 06:55:54,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {10914#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {10914#true} is VALID [2022-04-15 06:55:54,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {10914#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {10919#(= main_~y~0 0)} is VALID [2022-04-15 06:55:54,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {10919#(= main_~y~0 0)} [127] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post4_652| |v_main_#t~post4_625|) (= |v_main_#t~post5_134| |v_main_#t~post5_133|) (= v_main_~y~0_166 v_main_~y~0_165) (= v_main_~z~0_1118 v_main_~z~0_1090)) InVars {main_#t~post4=|v_main_#t~post4_652|, main_~y~0=v_main_~y~0_166, main_#t~post5=|v_main_#t~post5_134|, main_~z~0=v_main_~z~0_1118} OutVars{main_#t~post4=|v_main_#t~post4_625|, main_#t~post5=|v_main_#t~post5_133|, main_~y~0=v_main_~y~0_165, main_~z~0=v_main_~z~0_1090} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {10919#(= main_~y~0 0)} is VALID [2022-04-15 06:55:54,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {10919#(= main_~y~0 0)} [126] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {10915#false} is VALID [2022-04-15 06:55:54,291 INFO L272 TraceCheckUtils]: 9: Hoare triple {10915#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10915#false} is VALID [2022-04-15 06:55:54,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {10915#false} ~cond := #in~cond; {10915#false} is VALID [2022-04-15 06:55:54,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {10915#false} assume 0 == ~cond; {10915#false} is VALID [2022-04-15 06:55:54,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {10915#false} assume !false; {10915#false} is VALID [2022-04-15 06:55:54,291 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 06:55:54,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:54,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118688287] [2022-04-15 06:55:54,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118688287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:54,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:54,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:54,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:54,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1941665467] [2022-04-15 06:55:54,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1941665467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:54,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:54,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:55:54,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409263182] [2022-04-15 06:55:54,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:54,819 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-04-15 06:55:54,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:54,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:54,852 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 06:55:54,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:55:54,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:54,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:55:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:55:54,853 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:57,175 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-04-15 06:55:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 06:55:57,175 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-04-15 06:55:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 79 transitions. [2022-04-15 06:55:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 79 transitions. [2022-04-15 06:55:57,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 79 transitions. [2022-04-15 06:55:57,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:57,237 INFO L225 Difference]: With dead ends: 105 [2022-04-15 06:55:57,237 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 06:55:57,239 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=3399, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 06:55:57,239 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:57,239 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 121 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:55:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 06:55:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2022-04-15 06:55:57,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:57,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 54 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:57,336 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 54 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:57,336 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 54 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:57,337 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-15 06:55:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-15 06:55:57,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:57,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:57,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 59 states. [2022-04-15 06:55:57,338 INFO L87 Difference]: Start difference. First operand has 54 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 59 states. [2022-04-15 06:55:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:57,339 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-15 06:55:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-15 06:55:57,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:57,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:57,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:57,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:55:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-15 06:55:57,340 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 47 [2022-04-15 06:55:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:57,340 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-15 06:55:57,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:57,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-15 06:55:57,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 06:55:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 06:55:57,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:57,495 INFO L499 BasicCegarLoop]: trace histogram [28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:57,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 06:55:57,495 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:57,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1211412514, now seen corresponding path program 28 times [2022-04-15 06:55:57,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:57,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1901068600] [2022-04-15 06:55:58,820 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:58,947 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:59,149 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:59,149 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1414406920, now seen corresponding path program 1 times [2022-04-15 06:55:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:59,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866482137] [2022-04-15 06:55:59,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:59,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:59,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:59,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {11452#(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(12, 2);call #Ultimate.allocInit(12, 3); {11446#true} is VALID [2022-04-15 06:55:59,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {11446#true} assume true; {11446#true} is VALID [2022-04-15 06:55:59,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11446#true} {11446#true} #63#return; {11446#true} is VALID [2022-04-15 06:55:59,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {11446#true} call ULTIMATE.init(); {11452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:59,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {11452#(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(12, 2);call #Ultimate.allocInit(12, 3); {11446#true} is VALID [2022-04-15 06:55:59,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {11446#true} assume true; {11446#true} is VALID [2022-04-15 06:55:59,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11446#true} {11446#true} #63#return; {11446#true} is VALID [2022-04-15 06:55:59,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {11446#true} call #t~ret7 := main(); {11446#true} is VALID [2022-04-15 06:55:59,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {11446#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {11446#true} is VALID [2022-04-15 06:55:59,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {11446#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {11451#(= main_~y~0 0)} is VALID [2022-04-15 06:55:59,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {11451#(= main_~y~0 0)} [129] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post4_690| |v_main_#t~post4_662|) (= v_main_~z~0_1187 v_main_~z~0_1158) (= v_main_~y~0_172 v_main_~y~0_171) (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) InVars {main_#t~post4=|v_main_#t~post4_690|, main_~y~0=v_main_~y~0_172, main_#t~post5=|v_main_#t~post5_139|, main_~z~0=v_main_~z~0_1187} OutVars{main_#t~post4=|v_main_#t~post4_662|, main_#t~post5=|v_main_#t~post5_138|, main_~y~0=v_main_~y~0_171, main_~z~0=v_main_~z~0_1158} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {11451#(= main_~y~0 0)} is VALID [2022-04-15 06:55:59,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {11451#(= main_~y~0 0)} [128] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {11447#false} is VALID [2022-04-15 06:55:59,191 INFO L272 TraceCheckUtils]: 9: Hoare triple {11447#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11447#false} is VALID [2022-04-15 06:55:59,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {11447#false} ~cond := #in~cond; {11447#false} is VALID [2022-04-15 06:55:59,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {11447#false} assume 0 == ~cond; {11447#false} is VALID [2022-04-15 06:55:59,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {11447#false} assume !false; {11447#false} is VALID [2022-04-15 06:55:59,191 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 06:55:59,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:59,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866482137] [2022-04-15 06:55:59,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866482137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:59,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:59,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:55:59,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:59,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1901068600] [2022-04-15 06:55:59,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1901068600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:59,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:59,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 06:55:59,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898358183] [2022-04-15 06:55:59,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:59,741 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-04-15 06:55:59,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:59,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:55:59,768 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 06:55:59,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 06:55:59,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 06:55:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:55:59,769 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:02,109 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-04-15 06:56:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 06:56:02,109 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-04-15 06:56:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-15 06:56:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-15 06:56:02,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 80 transitions. [2022-04-15 06:56:02,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:02,166 INFO L225 Difference]: With dead ends: 107 [2022-04-15 06:56:02,166 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 06:56:02,167 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=270, Invalid=3636, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 06:56:02,167 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:02,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 116 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:56:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 06:56:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2022-04-15 06:56:02,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:02,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 55 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:02,263 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 55 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:02,263 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 55 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:02,264 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-15 06:56:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-04-15 06:56:02,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:02,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:02,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 60 states. [2022-04-15 06:56:02,264 INFO L87 Difference]: Start difference. First operand has 55 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 60 states. [2022-04-15 06:56:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:02,265 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-15 06:56:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-04-15 06:56:02,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:02,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:02,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:02,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-04-15 06:56:02,266 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 48 [2022-04-15 06:56:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:02,266 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-04-15 06:56:02,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:02,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2022-04-15 06:56:02,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-15 06:56:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 06:56:02,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:02,404 INFO L499 BasicCegarLoop]: trace histogram [29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:02,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 06:56:02,404 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:02,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:02,405 INFO L85 PathProgramCache]: Analyzing trace with hash -148635134, now seen corresponding path program 29 times [2022-04-15 06:56:02,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:02,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1558783868] [2022-04-15 06:56:03,421 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:03,740 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:03,740 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:03,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1355301576, now seen corresponding path program 1 times [2022-04-15 06:56:03,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:03,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424555840] [2022-04-15 06:56:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:03,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:03,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:03,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {11995#(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(12, 2);call #Ultimate.allocInit(12, 3); {11989#true} is VALID [2022-04-15 06:56:03,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {11989#true} assume true; {11989#true} is VALID [2022-04-15 06:56:03,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11989#true} {11989#true} #63#return; {11989#true} is VALID [2022-04-15 06:56:03,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {11989#true} call ULTIMATE.init(); {11995#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:03,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {11995#(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(12, 2);call #Ultimate.allocInit(12, 3); {11989#true} is VALID [2022-04-15 06:56:03,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {11989#true} assume true; {11989#true} is VALID [2022-04-15 06:56:03,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11989#true} {11989#true} #63#return; {11989#true} is VALID [2022-04-15 06:56:03,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {11989#true} call #t~ret7 := main(); {11989#true} is VALID [2022-04-15 06:56:03,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {11989#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {11989#true} is VALID [2022-04-15 06:56:03,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {11989#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {11994#(= main_~y~0 0)} is VALID [2022-04-15 06:56:03,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {11994#(= main_~y~0 0)} [131] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post4_729| |v_main_#t~post4_700|) (= v_main_~y~0_178 v_main_~y~0_177) (= |v_main_#t~post5_144| |v_main_#t~post5_143|) (= v_main_~z~0_1258 v_main_~z~0_1228)) InVars {main_#t~post4=|v_main_#t~post4_729|, main_~y~0=v_main_~y~0_178, main_#t~post5=|v_main_#t~post5_144|, main_~z~0=v_main_~z~0_1258} OutVars{main_#t~post4=|v_main_#t~post4_700|, main_#t~post5=|v_main_#t~post5_143|, main_~y~0=v_main_~y~0_177, main_~z~0=v_main_~z~0_1228} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {11994#(= main_~y~0 0)} is VALID [2022-04-15 06:56:03,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {11994#(= main_~y~0 0)} [130] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {11990#false} is VALID [2022-04-15 06:56:03,773 INFO L272 TraceCheckUtils]: 9: Hoare triple {11990#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11990#false} is VALID [2022-04-15 06:56:03,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {11990#false} ~cond := #in~cond; {11990#false} is VALID [2022-04-15 06:56:03,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {11990#false} assume 0 == ~cond; {11990#false} is VALID [2022-04-15 06:56:03,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {11990#false} assume !false; {11990#false} is VALID [2022-04-15 06:56:03,773 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 06:56:03,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:03,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424555840] [2022-04-15 06:56:03,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424555840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:03,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:03,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:56:04,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:04,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1558783868] [2022-04-15 06:56:04,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1558783868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:04,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:04,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 06:56:04,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467088529] [2022-04-15 06:56:04,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:04,362 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-04-15 06:56:04,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:04,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:04,390 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 06:56:04,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 06:56:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 06:56:04,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:56:04,391 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:06,922 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-04-15 06:56:06,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 06:56:06,922 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-04-15 06:56:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-15 06:56:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-15 06:56:06,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 81 transitions. [2022-04-15 06:56:06,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:06,984 INFO L225 Difference]: With dead ends: 109 [2022-04-15 06:56:06,984 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 06:56:06,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=279, Invalid=3881, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 06:56:06,985 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:06,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 146 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:56:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 06:56:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-04-15 06:56:07,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:07,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 56 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:07,085 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 56 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:07,086 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 56 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:07,086 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-15 06:56:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-15 06:56:07,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:07,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:07,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 61 states. [2022-04-15 06:56:07,087 INFO L87 Difference]: Start difference. First operand has 56 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 61 states. [2022-04-15 06:56:07,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:07,087 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-15 06:56:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-15 06:56:07,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:07,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:07,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:07,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-15 06:56:07,088 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 49 [2022-04-15 06:56:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:07,089 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-15 06:56:07,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:07,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 59 transitions. [2022-04-15 06:56:07,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-15 06:56:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 06:56:07,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:07,225 INFO L499 BasicCegarLoop]: trace histogram [30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:07,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 06:56:07,225 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:07,225 INFO L85 PathProgramCache]: Analyzing trace with hash 639560738, now seen corresponding path program 30 times [2022-04-15 06:56:07,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:07,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [230772077] [2022-04-15 06:56:11,759 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:11,965 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:12,229 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:12,229 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1296196232, now seen corresponding path program 1 times [2022-04-15 06:56:12,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:12,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911086292] [2022-04-15 06:56:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:12,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:12,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {12549#(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(12, 2);call #Ultimate.allocInit(12, 3); {12543#true} is VALID [2022-04-15 06:56:12,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {12543#true} assume true; {12543#true} is VALID [2022-04-15 06:56:12,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12543#true} {12543#true} #63#return; {12543#true} is VALID [2022-04-15 06:56:12,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {12543#true} call ULTIMATE.init(); {12549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:12,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {12549#(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(12, 2);call #Ultimate.allocInit(12, 3); {12543#true} is VALID [2022-04-15 06:56:12,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {12543#true} assume true; {12543#true} is VALID [2022-04-15 06:56:12,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12543#true} {12543#true} #63#return; {12543#true} is VALID [2022-04-15 06:56:12,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {12543#true} call #t~ret7 := main(); {12543#true} is VALID [2022-04-15 06:56:12,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {12543#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {12543#true} is VALID [2022-04-15 06:56:12,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {12543#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {12548#(= main_~y~0 0)} is VALID [2022-04-15 06:56:12,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {12548#(= main_~y~0 0)} [133] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post5_149| |v_main_#t~post5_148|) (= |v_main_#t~post4_769| |v_main_#t~post4_739|) (= v_main_~y~0_184 v_main_~y~0_183) (= v_main_~z~0_1331 v_main_~z~0_1300)) InVars {main_#t~post4=|v_main_#t~post4_769|, main_~y~0=v_main_~y~0_184, main_#t~post5=|v_main_#t~post5_149|, main_~z~0=v_main_~z~0_1331} OutVars{main_#t~post4=|v_main_#t~post4_739|, main_#t~post5=|v_main_#t~post5_148|, main_~y~0=v_main_~y~0_183, main_~z~0=v_main_~z~0_1300} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {12548#(= main_~y~0 0)} is VALID [2022-04-15 06:56:12,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {12548#(= main_~y~0 0)} [132] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {12544#false} is VALID [2022-04-15 06:56:12,271 INFO L272 TraceCheckUtils]: 9: Hoare triple {12544#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12544#false} is VALID [2022-04-15 06:56:12,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {12544#false} ~cond := #in~cond; {12544#false} is VALID [2022-04-15 06:56:12,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {12544#false} assume 0 == ~cond; {12544#false} is VALID [2022-04-15 06:56:12,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {12544#false} assume !false; {12544#false} is VALID [2022-04-15 06:56:12,272 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 06:56:12,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:12,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911086292] [2022-04-15 06:56:12,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911086292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:12,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:12,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:56:12,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:12,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [230772077] [2022-04-15 06:56:12,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [230772077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:12,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:12,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 06:56:12,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018745869] [2022-04-15 06:56:12,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:12,872 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 34 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-04-15 06:56:12,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:12,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 34 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:12,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:12,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 06:56:12,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:12,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 06:56:12,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:56:12,901 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 35 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 34 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:15,362 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-04-15 06:56:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:56:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 34 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-04-15 06:56:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 34 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 82 transitions. [2022-04-15 06:56:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 34 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 82 transitions. [2022-04-15 06:56:15,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 82 transitions. [2022-04-15 06:56:15,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:15,436 INFO L225 Difference]: With dead ends: 111 [2022-04-15 06:56:15,436 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 06:56:15,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=288, Invalid=4134, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 06:56:15,437 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:15,437 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 91 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:56:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 06:56:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2022-04-15 06:56:15,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:15,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 57 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:15,555 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 57 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:15,555 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 57 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:15,556 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-04-15 06:56:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-04-15 06:56:15,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:15,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:15,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 62 states. [2022-04-15 06:56:15,556 INFO L87 Difference]: Start difference. First operand has 57 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 62 states. [2022-04-15 06:56:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:15,557 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-04-15 06:56:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-04-15 06:56:15,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:15,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:15,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:15,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-04-15 06:56:15,558 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 50 [2022-04-15 06:56:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:15,558 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-04-15 06:56:15,558 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 34 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:15,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2022-04-15 06:56:15,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-04-15 06:56:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 06:56:15,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:15,699 INFO L499 BasicCegarLoop]: trace histogram [31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:15,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 06:56:15,699 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash -696171006, now seen corresponding path program 31 times [2022-04-15 06:56:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:15,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751604490] [2022-04-15 06:56:17,258 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:17,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:17,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:17,719 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:17,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1237090888, now seen corresponding path program 1 times [2022-04-15 06:56:17,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:17,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87416731] [2022-04-15 06:56:17,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:17,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:17,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {13114#(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(12, 2);call #Ultimate.allocInit(12, 3); {13108#true} is VALID [2022-04-15 06:56:17,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {13108#true} assume true; {13108#true} is VALID [2022-04-15 06:56:17,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13108#true} {13108#true} #63#return; {13108#true} is VALID [2022-04-15 06:56:17,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {13108#true} call ULTIMATE.init(); {13114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:17,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {13114#(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(12, 2);call #Ultimate.allocInit(12, 3); {13108#true} is VALID [2022-04-15 06:56:17,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {13108#true} assume true; {13108#true} is VALID [2022-04-15 06:56:17,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13108#true} {13108#true} #63#return; {13108#true} is VALID [2022-04-15 06:56:17,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {13108#true} call #t~ret7 := main(); {13108#true} is VALID [2022-04-15 06:56:17,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {13108#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {13108#true} is VALID [2022-04-15 06:56:17,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {13108#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {13113#(= main_~y~0 0)} is VALID [2022-04-15 06:56:17,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {13113#(= main_~y~0 0)} [135] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~z~0_1406 v_main_~z~0_1374)) (.cse1 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse2 (= |v_main_#t~post4_810| |v_main_#t~post4_779|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_189 v_main_~y~0_190)) (and .cse0 .cse1 (= v_main_~y~0_190 v_main_~y~0_189) .cse2))) InVars {main_#t~post4=|v_main_#t~post4_810|, main_~y~0=v_main_~y~0_190, main_#t~post5=|v_main_#t~post5_154|, main_~z~0=v_main_~z~0_1406} OutVars{main_#t~post4=|v_main_#t~post4_779|, main_#t~post5=|v_main_#t~post5_153|, main_~y~0=v_main_~y~0_189, main_~z~0=v_main_~z~0_1374} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {13113#(= main_~y~0 0)} is VALID [2022-04-15 06:56:17,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {13113#(= main_~y~0 0)} [134] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {13109#false} is VALID [2022-04-15 06:56:17,758 INFO L272 TraceCheckUtils]: 9: Hoare triple {13109#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13109#false} is VALID [2022-04-15 06:56:17,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {13109#false} ~cond := #in~cond; {13109#false} is VALID [2022-04-15 06:56:17,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {13109#false} assume 0 == ~cond; {13109#false} is VALID [2022-04-15 06:56:17,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {13109#false} assume !false; {13109#false} is VALID [2022-04-15 06:56:17,758 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 06:56:17,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:17,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87416731] [2022-04-15 06:56:17,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87416731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:17,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:17,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:56:18,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:18,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751604490] [2022-04-15 06:56:18,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751604490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:18,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:18,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 06:56:18,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910121341] [2022-04-15 06:56:18,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:18,495 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-04-15 06:56:18,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:18,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:18,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:18,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 06:56:18,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:18,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 06:56:18,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:56:18,525 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:21,115 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-04-15 06:56:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 06:56:21,116 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-04-15 06:56:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 83 transitions. [2022-04-15 06:56:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 83 transitions. [2022-04-15 06:56:21,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 83 transitions. [2022-04-15 06:56:21,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:21,194 INFO L225 Difference]: With dead ends: 113 [2022-04-15 06:56:21,194 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 06:56:21,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=297, Invalid=4395, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 06:56:21,195 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:21,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:56:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 06:56:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2022-04-15 06:56:21,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:21,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 58 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:21,300 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 58 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:21,300 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 58 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:21,301 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-04-15 06:56:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-04-15 06:56:21,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:21,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:21,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 63 states. [2022-04-15 06:56:21,301 INFO L87 Difference]: Start difference. First operand has 58 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 63 states. [2022-04-15 06:56:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:21,301 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-04-15 06:56:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-04-15 06:56:21,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:21,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:21,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:21,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-04-15 06:56:21,303 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 51 [2022-04-15 06:56:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:21,303 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-04-15 06:56:21,303 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:21,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 61 transitions. [2022-04-15 06:56:21,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-15 06:56:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 06:56:21,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:21,450 INFO L499 BasicCegarLoop]: trace histogram [32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:21,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 06:56:21,450 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:21,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash 845817890, now seen corresponding path program 32 times [2022-04-15 06:56:21,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:21,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191900233] [2022-04-15 06:56:22,600 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:22,812 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:23,098 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:23,098 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1177985544, now seen corresponding path program 1 times [2022-04-15 06:56:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:23,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559744067] [2022-04-15 06:56:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:23,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:23,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {13690#(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(12, 2);call #Ultimate.allocInit(12, 3); {13684#true} is VALID [2022-04-15 06:56:23,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {13684#true} assume true; {13684#true} is VALID [2022-04-15 06:56:23,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13684#true} {13684#true} #63#return; {13684#true} is VALID [2022-04-15 06:56:23,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {13684#true} call ULTIMATE.init(); {13690#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:23,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {13690#(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(12, 2);call #Ultimate.allocInit(12, 3); {13684#true} is VALID [2022-04-15 06:56:23,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {13684#true} assume true; {13684#true} is VALID [2022-04-15 06:56:23,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13684#true} {13684#true} #63#return; {13684#true} is VALID [2022-04-15 06:56:23,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {13684#true} call #t~ret7 := main(); {13684#true} is VALID [2022-04-15 06:56:23,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {13684#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {13684#true} is VALID [2022-04-15 06:56:23,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {13684#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {13689#(= main_~y~0 0)} is VALID [2022-04-15 06:56:23,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {13689#(= main_~y~0 0)} [137] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post4_852| |v_main_#t~post4_820|) (= v_main_~z~0_1483 v_main_~z~0_1450) (= |v_main_#t~post5_159| |v_main_#t~post5_158|) (= v_main_~y~0_196 v_main_~y~0_195)) InVars {main_#t~post4=|v_main_#t~post4_852|, main_~y~0=v_main_~y~0_196, main_#t~post5=|v_main_#t~post5_159|, main_~z~0=v_main_~z~0_1483} OutVars{main_#t~post4=|v_main_#t~post4_820|, main_#t~post5=|v_main_#t~post5_158|, main_~y~0=v_main_~y~0_195, main_~z~0=v_main_~z~0_1450} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {13689#(= main_~y~0 0)} is VALID [2022-04-15 06:56:23,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {13689#(= main_~y~0 0)} [136] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {13685#false} is VALID [2022-04-15 06:56:23,137 INFO L272 TraceCheckUtils]: 9: Hoare triple {13685#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13685#false} is VALID [2022-04-15 06:56:23,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {13685#false} ~cond := #in~cond; {13685#false} is VALID [2022-04-15 06:56:23,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {13685#false} assume 0 == ~cond; {13685#false} is VALID [2022-04-15 06:56:23,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {13685#false} assume !false; {13685#false} is VALID [2022-04-15 06:56:23,137 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 06:56:23,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:23,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559744067] [2022-04-15 06:56:23,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559744067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:23,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:23,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:56:23,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:23,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191900233] [2022-04-15 06:56:23,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191900233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:23,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:23,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 06:56:23,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787589504] [2022-04-15 06:56:23,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:23,863 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 36 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2022-04-15 06:56:23,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:23,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 36 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:23,893 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 06:56:23,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 06:56:23,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:23,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 06:56:23,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 06:56:23,894 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 37 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 36 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:27,057 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-04-15 06:56:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 06:56:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 36 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2022-04-15 06:56:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 36 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 84 transitions. [2022-04-15 06:56:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 36 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 84 transitions. [2022-04-15 06:56:27,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 84 transitions. [2022-04-15 06:56:27,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:27,118 INFO L225 Difference]: With dead ends: 115 [2022-04-15 06:56:27,118 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 06:56:27,119 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=306, Invalid=4664, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 06:56:27,119 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:27,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 181 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:56:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 06:56:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2022-04-15 06:56:27,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:27,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 59 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:27,235 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 59 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:27,235 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 59 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:27,236 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-04-15 06:56:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-04-15 06:56:27,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:27,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:27,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 64 states. [2022-04-15 06:56:27,236 INFO L87 Difference]: Start difference. First operand has 59 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 64 states. [2022-04-15 06:56:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:27,237 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-04-15 06:56:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-04-15 06:56:27,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:27,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:27,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:27,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-04-15 06:56:27,239 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 52 [2022-04-15 06:56:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:27,239 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-04-15 06:56:27,239 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 36 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:27,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2022-04-15 06:56:27,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-04-15 06:56:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 06:56:27,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:27,403 INFO L499 BasicCegarLoop]: trace histogram [33, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:27,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 06:56:27,403 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1402833410, now seen corresponding path program 33 times [2022-04-15 06:56:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:27,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [665253740] [2022-04-15 06:56:28,873 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:29,059 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:29,332 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:29,332 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1118880200, now seen corresponding path program 1 times [2022-04-15 06:56:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:29,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317826196] [2022-04-15 06:56:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:29,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:29,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:29,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {14277#(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(12, 2);call #Ultimate.allocInit(12, 3); {14271#true} is VALID [2022-04-15 06:56:29,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {14271#true} assume true; {14271#true} is VALID [2022-04-15 06:56:29,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14271#true} {14271#true} #63#return; {14271#true} is VALID [2022-04-15 06:56:29,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {14271#true} call ULTIMATE.init(); {14277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:29,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {14277#(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(12, 2);call #Ultimate.allocInit(12, 3); {14271#true} is VALID [2022-04-15 06:56:29,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {14271#true} assume true; {14271#true} is VALID [2022-04-15 06:56:29,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14271#true} {14271#true} #63#return; {14271#true} is VALID [2022-04-15 06:56:29,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {14271#true} call #t~ret7 := main(); {14271#true} is VALID [2022-04-15 06:56:29,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {14271#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {14271#true} is VALID [2022-04-15 06:56:29,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {14271#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {14276#(= main_~y~0 0)} is VALID [2022-04-15 06:56:29,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {14276#(= main_~y~0 0)} [139] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post4_895| |v_main_#t~post4_862|) (= v_main_~y~0_202 v_main_~y~0_201) (= |v_main_#t~post5_164| |v_main_#t~post5_163|) (= v_main_~z~0_1562 v_main_~z~0_1528)) InVars {main_#t~post4=|v_main_#t~post4_895|, main_~y~0=v_main_~y~0_202, main_#t~post5=|v_main_#t~post5_164|, main_~z~0=v_main_~z~0_1562} OutVars{main_#t~post4=|v_main_#t~post4_862|, main_#t~post5=|v_main_#t~post5_163|, main_~y~0=v_main_~y~0_201, main_~z~0=v_main_~z~0_1528} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {14276#(= main_~y~0 0)} is VALID [2022-04-15 06:56:29,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {14276#(= main_~y~0 0)} [138] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {14272#false} is VALID [2022-04-15 06:56:29,366 INFO L272 TraceCheckUtils]: 9: Hoare triple {14272#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14272#false} is VALID [2022-04-15 06:56:29,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {14272#false} ~cond := #in~cond; {14272#false} is VALID [2022-04-15 06:56:29,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {14272#false} assume 0 == ~cond; {14272#false} is VALID [2022-04-15 06:56:29,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {14272#false} assume !false; {14272#false} is VALID [2022-04-15 06:56:29,366 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 06:56:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:29,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317826196] [2022-04-15 06:56:29,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317826196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:29,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:29,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:56:30,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:30,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [665253740] [2022-04-15 06:56:30,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [665253740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:30,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:30,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 06:56:30,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507897571] [2022-04-15 06:56:30,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:30,104 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 37 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-04-15 06:56:30,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:30,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 37 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:30,136 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 06:56:30,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 06:56:30,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:30,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 06:56:30,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:56:30,136 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 38 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 37 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:32,931 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-04-15 06:56:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 06:56:32,931 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 37 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-04-15 06:56:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 37 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 85 transitions. [2022-04-15 06:56:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 37 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 85 transitions. [2022-04-15 06:56:32,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 85 transitions. [2022-04-15 06:56:32,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:32,995 INFO L225 Difference]: With dead ends: 117 [2022-04-15 06:56:32,995 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 06:56:32,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=315, Invalid=4941, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 06:56:32,996 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:32,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:56:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 06:56:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-04-15 06:56:33,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:33,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 60 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:33,121 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 60 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:33,121 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 60 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:33,122 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-04-15 06:56:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-15 06:56:33,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:33,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:33,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 65 states. [2022-04-15 06:56:33,123 INFO L87 Difference]: Start difference. First operand has 60 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 65 states. [2022-04-15 06:56:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:33,124 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-04-15 06:56:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-15 06:56:33,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:33,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:33,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:33,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-15 06:56:33,125 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 53 [2022-04-15 06:56:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:33,125 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-15 06:56:33,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 37 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:33,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 63 transitions. [2022-04-15 06:56:33,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-15 06:56:33,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 06:56:33,283 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:33,283 INFO L499 BasicCegarLoop]: trace histogram [34, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:33,284 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 06:56:33,284 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1490445346, now seen corresponding path program 34 times [2022-04-15 06:56:33,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:33,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1529829475] [2022-04-15 06:56:35,461 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:35,708 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:36,084 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:36,084 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1059774856, now seen corresponding path program 1 times [2022-04-15 06:56:36,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:36,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096029796] [2022-04-15 06:56:36,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:36,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:36,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {14875#(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(12, 2);call #Ultimate.allocInit(12, 3); {14869#true} is VALID [2022-04-15 06:56:36,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {14869#true} assume true; {14869#true} is VALID [2022-04-15 06:56:36,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14869#true} {14869#true} #63#return; {14869#true} is VALID [2022-04-15 06:56:36,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {14869#true} call ULTIMATE.init(); {14875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:36,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {14875#(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(12, 2);call #Ultimate.allocInit(12, 3); {14869#true} is VALID [2022-04-15 06:56:36,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {14869#true} assume true; {14869#true} is VALID [2022-04-15 06:56:36,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14869#true} {14869#true} #63#return; {14869#true} is VALID [2022-04-15 06:56:36,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {14869#true} call #t~ret7 := main(); {14869#true} is VALID [2022-04-15 06:56:36,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {14869#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {14869#true} is VALID [2022-04-15 06:56:36,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {14869#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {14874#(= main_~y~0 0)} is VALID [2022-04-15 06:56:36,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {14874#(= main_~y~0 0)} [141] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post5_169| |v_main_#t~post5_168|) (= v_main_~z~0_1643 v_main_~z~0_1608) (= v_main_~y~0_208 v_main_~y~0_207) (= |v_main_#t~post4_939| |v_main_#t~post4_905|)) InVars {main_#t~post4=|v_main_#t~post4_939|, main_~y~0=v_main_~y~0_208, main_#t~post5=|v_main_#t~post5_169|, main_~z~0=v_main_~z~0_1643} OutVars{main_#t~post4=|v_main_#t~post4_905|, main_#t~post5=|v_main_#t~post5_168|, main_~y~0=v_main_~y~0_207, main_~z~0=v_main_~z~0_1608} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {14874#(= main_~y~0 0)} is VALID [2022-04-15 06:56:36,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {14874#(= main_~y~0 0)} [140] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {14870#false} is VALID [2022-04-15 06:56:36,125 INFO L272 TraceCheckUtils]: 9: Hoare triple {14870#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14870#false} is VALID [2022-04-15 06:56:36,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {14870#false} ~cond := #in~cond; {14870#false} is VALID [2022-04-15 06:56:36,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {14870#false} assume 0 == ~cond; {14870#false} is VALID [2022-04-15 06:56:36,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {14870#false} assume !false; {14870#false} is VALID [2022-04-15 06:56:36,125 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 06:56:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:36,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096029796] [2022-04-15 06:56:36,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096029796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:36,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:36,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:56:36,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:36,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1529829475] [2022-04-15 06:56:36,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1529829475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:36,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:36,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 06:56:36,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320603528] [2022-04-15 06:56:36,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:36,845 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.205128205128205) internal successors, (47), 38 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-04-15 06:56:36,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:36,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.205128205128205) internal successors, (47), 38 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:36,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:36,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 06:56:36,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 06:56:36,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:56:36,877 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 39 states, 39 states have (on average 1.205128205128205) internal successors, (47), 38 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:39,948 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-04-15 06:56:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 06:56:39,948 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.205128205128205) internal successors, (47), 38 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-04-15 06:56:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.205128205128205) internal successors, (47), 38 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 86 transitions. [2022-04-15 06:56:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.205128205128205) internal successors, (47), 38 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 86 transitions. [2022-04-15 06:56:39,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 86 transitions. [2022-04-15 06:56:40,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:40,008 INFO L225 Difference]: With dead ends: 119 [2022-04-15 06:56:40,008 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 06:56:40,009 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=324, Invalid=5226, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 06:56:40,009 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:40,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 106 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 06:56:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 06:56:40,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2022-04-15 06:56:40,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:40,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 61 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:40,133 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 61 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:40,133 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 61 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:40,134 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-04-15 06:56:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-04-15 06:56:40,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:40,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:40,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 66 states. [2022-04-15 06:56:40,134 INFO L87 Difference]: Start difference. First operand has 61 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 66 states. [2022-04-15 06:56:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:40,135 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-04-15 06:56:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-04-15 06:56:40,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:40,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:40,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:40,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-04-15 06:56:40,137 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 54 [2022-04-15 06:56:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:40,137 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-04-15 06:56:40,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.205128205128205) internal successors, (47), 38 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:40,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 64 transitions. [2022-04-15 06:56:40,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-04-15 06:56:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 06:56:40,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:40,340 INFO L499 BasicCegarLoop]: trace histogram [35, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:40,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-15 06:56:40,340 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:40,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:40,342 INFO L85 PathProgramCache]: Analyzing trace with hash -88551934, now seen corresponding path program 35 times [2022-04-15 06:56:40,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:40,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [831494170] [2022-04-15 06:56:43,182 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:43,358 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:43,640 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:43,641 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1000669512, now seen corresponding path program 1 times [2022-04-15 06:56:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:43,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634967226] [2022-04-15 06:56:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:43,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:43,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {15484#(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(12, 2);call #Ultimate.allocInit(12, 3); {15478#true} is VALID [2022-04-15 06:56:43,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {15478#true} assume true; {15478#true} is VALID [2022-04-15 06:56:43,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15478#true} {15478#true} #63#return; {15478#true} is VALID [2022-04-15 06:56:43,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {15478#true} call ULTIMATE.init(); {15484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:43,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {15484#(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(12, 2);call #Ultimate.allocInit(12, 3); {15478#true} is VALID [2022-04-15 06:56:43,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {15478#true} assume true; {15478#true} is VALID [2022-04-15 06:56:43,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15478#true} {15478#true} #63#return; {15478#true} is VALID [2022-04-15 06:56:43,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {15478#true} call #t~ret7 := main(); {15478#true} is VALID [2022-04-15 06:56:43,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {15478#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {15478#true} is VALID [2022-04-15 06:56:43,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {15478#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {15483#(= main_~y~0 0)} is VALID [2022-04-15 06:56:43,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {15483#(= main_~y~0 0)} [143] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_984| |v_main_#t~post4_949|)) (.cse1 (= v_main_~y~0_214 v_main_~y~0_213)) (.cse2 (= |v_main_#t~post5_174| |v_main_#t~post5_173|))) (or (and .cse0 (= v_main_~z~0_1690 v_main_~z~0_1726) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= v_main_~z~0_1726 v_main_~z~0_1690)))) InVars {main_#t~post4=|v_main_#t~post4_984|, main_~y~0=v_main_~y~0_214, main_#t~post5=|v_main_#t~post5_174|, main_~z~0=v_main_~z~0_1726} OutVars{main_#t~post4=|v_main_#t~post4_949|, main_#t~post5=|v_main_#t~post5_173|, main_~y~0=v_main_~y~0_213, main_~z~0=v_main_~z~0_1690} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {15483#(= main_~y~0 0)} is VALID [2022-04-15 06:56:43,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {15483#(= main_~y~0 0)} [142] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {15479#false} is VALID [2022-04-15 06:56:43,682 INFO L272 TraceCheckUtils]: 9: Hoare triple {15479#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {15479#false} is VALID [2022-04-15 06:56:43,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {15479#false} ~cond := #in~cond; {15479#false} is VALID [2022-04-15 06:56:43,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {15479#false} assume 0 == ~cond; {15479#false} is VALID [2022-04-15 06:56:43,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {15479#false} assume !false; {15479#false} is VALID [2022-04-15 06:56:43,682 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 06:56:43,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:43,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634967226] [2022-04-15 06:56:43,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634967226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:43,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:43,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:56:44,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:44,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [831494170] [2022-04-15 06:56:44,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [831494170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:44,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:44,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 06:56:44,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134057130] [2022-04-15 06:56:44,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:44,474 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-04-15 06:56:44,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:44,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:44,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:44,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 06:56:44,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:44,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 06:56:44,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:56:44,506 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:47,490 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2022-04-15 06:56:47,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 06:56:47,490 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-04-15 06:56:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 87 transitions. [2022-04-15 06:56:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 87 transitions. [2022-04-15 06:56:47,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 87 transitions. [2022-04-15 06:56:47,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:47,552 INFO L225 Difference]: With dead ends: 121 [2022-04-15 06:56:47,553 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 06:56:47,553 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=333, Invalid=5519, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 06:56:47,554 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:47,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 06:56:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 06:56:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-15 06:56:47,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:47,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 62 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:47,683 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 62 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:47,683 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 62 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:47,683 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-04-15 06:56:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-04-15 06:56:47,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:47,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:47,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 67 states. [2022-04-15 06:56:47,684 INFO L87 Difference]: Start difference. First operand has 62 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 67 states. [2022-04-15 06:56:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:47,685 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-04-15 06:56:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-04-15 06:56:47,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:47,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:47,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:47,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-15 06:56:47,686 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 55 [2022-04-15 06:56:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:47,686 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-15 06:56:47,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:47,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-15 06:56:47,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-15 06:56:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 06:56:47,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:47,855 INFO L499 BasicCegarLoop]: trace histogram [36, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:47,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-15 06:56:47,856 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1792827358, now seen corresponding path program 36 times [2022-04-15 06:56:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:47,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [81331397] [2022-04-15 06:56:48,258 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:48,557 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:48,557 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:48,558 INFO L85 PathProgramCache]: Analyzing trace with hash -941564168, now seen corresponding path program 1 times [2022-04-15 06:56:48,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:48,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557057468] [2022-04-15 06:56:48,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:48,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:48,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:48,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {16104#(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(12, 2);call #Ultimate.allocInit(12, 3); {16098#true} is VALID [2022-04-15 06:56:48,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {16098#true} assume true; {16098#true} is VALID [2022-04-15 06:56:48,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16098#true} {16098#true} #63#return; {16098#true} is VALID [2022-04-15 06:56:48,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {16098#true} call ULTIMATE.init(); {16104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:48,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {16104#(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(12, 2);call #Ultimate.allocInit(12, 3); {16098#true} is VALID [2022-04-15 06:56:48,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {16098#true} assume true; {16098#true} is VALID [2022-04-15 06:56:48,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16098#true} {16098#true} #63#return; {16098#true} is VALID [2022-04-15 06:56:48,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {16098#true} call #t~ret7 := main(); {16098#true} is VALID [2022-04-15 06:56:48,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {16098#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {16098#true} is VALID [2022-04-15 06:56:48,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {16098#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {16103#(= main_~y~0 0)} is VALID [2022-04-15 06:56:48,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {16103#(= main_~y~0 0)} [145] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~z~0_1811 v_main_~z~0_1774)) (.cse1 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse2 (= |v_main_#t~post4_1030| |v_main_#t~post4_994|))) (or (and (= v_main_~y~0_220 v_main_~y~0_219) .cse0 .cse1 .cse2) (and (= v_main_~y~0_219 v_main_~y~0_220) .cse0 .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_1030|, main_~y~0=v_main_~y~0_220, main_#t~post5=|v_main_#t~post5_179|, main_~z~0=v_main_~z~0_1811} OutVars{main_#t~post4=|v_main_#t~post4_994|, main_#t~post5=|v_main_#t~post5_178|, main_~y~0=v_main_~y~0_219, main_~z~0=v_main_~z~0_1774} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {16103#(= main_~y~0 0)} is VALID [2022-04-15 06:56:48,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {16103#(= main_~y~0 0)} [144] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {16099#false} is VALID [2022-04-15 06:56:48,595 INFO L272 TraceCheckUtils]: 9: Hoare triple {16099#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16099#false} is VALID [2022-04-15 06:56:48,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {16099#false} ~cond := #in~cond; {16099#false} is VALID [2022-04-15 06:56:48,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {16099#false} assume 0 == ~cond; {16099#false} is VALID [2022-04-15 06:56:48,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {16099#false} assume !false; {16099#false} is VALID [2022-04-15 06:56:48,596 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 06:56:48,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:48,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557057468] [2022-04-15 06:56:48,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557057468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:48,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:48,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:56:49,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:49,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [81331397] [2022-04-15 06:56:49,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [81331397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:49,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:49,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 06:56:49,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417229176] [2022-04-15 06:56:49,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:49,393 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-04-15 06:56:49,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:49,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:49,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:49,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 06:56:49,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:49,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 06:56:49,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:56:49,431 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:53,059 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2022-04-15 06:56:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 06:56:53,059 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-04-15 06:56:53,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:53,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 88 transitions. [2022-04-15 06:56:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 88 transitions. [2022-04-15 06:56:53,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 88 transitions. [2022-04-15 06:56:53,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:53,138 INFO L225 Difference]: With dead ends: 123 [2022-04-15 06:56:53,138 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 06:56:53,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=342, Invalid=5820, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 06:56:53,140 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:53,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 186 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 06:56:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 06:56:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2022-04-15 06:56:53,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:53,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 63 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:53,262 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 63 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:53,262 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 63 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:53,263 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-04-15 06:56:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-04-15 06:56:53,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:53,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:53,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 68 states. [2022-04-15 06:56:53,264 INFO L87 Difference]: Start difference. First operand has 63 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 68 states. [2022-04-15 06:56:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:53,265 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-04-15 06:56:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-04-15 06:56:53,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:53,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:53,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:53,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:56:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-04-15 06:56:53,266 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 56 [2022-04-15 06:56:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:53,266 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-04-15 06:56:53,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:53,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 66 transitions. [2022-04-15 06:56:53,447 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 06:56:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-04-15 06:56:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 06:56:53,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:53,448 INFO L499 BasicCegarLoop]: trace histogram [37, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:53,448 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-15 06:56:53,448 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:53,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:53,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1209209346, now seen corresponding path program 37 times [2022-04-15 06:56:53,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:53,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1219313915] [2022-04-15 06:56:56,990 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:57,153 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:57,610 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:57,610 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:57,611 INFO L85 PathProgramCache]: Analyzing trace with hash -882458824, now seen corresponding path program 1 times [2022-04-15 06:56:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:57,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761461817] [2022-04-15 06:56:57,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:57,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:57,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:57,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {16735#(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(12, 2);call #Ultimate.allocInit(12, 3); {16729#true} is VALID [2022-04-15 06:56:57,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {16729#true} assume true; {16729#true} is VALID [2022-04-15 06:56:57,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16729#true} {16729#true} #63#return; {16729#true} is VALID [2022-04-15 06:56:57,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {16729#true} call ULTIMATE.init(); {16735#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:57,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {16735#(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(12, 2);call #Ultimate.allocInit(12, 3); {16729#true} is VALID [2022-04-15 06:56:57,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {16729#true} assume true; {16729#true} is VALID [2022-04-15 06:56:57,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16729#true} {16729#true} #63#return; {16729#true} is VALID [2022-04-15 06:56:57,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {16729#true} call #t~ret7 := main(); {16729#true} is VALID [2022-04-15 06:56:57,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {16729#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {16729#true} is VALID [2022-04-15 06:56:57,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {16729#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {16734#(= main_~y~0 0)} is VALID [2022-04-15 06:56:57,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {16734#(= main_~y~0 0)} [147] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_1898 v_main_~z~0_1860) (= v_main_~y~0_226 v_main_~y~0_225) (= |v_main_#t~post4_1077| |v_main_#t~post4_1040|) (= |v_main_#t~post5_184| |v_main_#t~post5_183|)) InVars {main_#t~post4=|v_main_#t~post4_1077|, main_~y~0=v_main_~y~0_226, main_#t~post5=|v_main_#t~post5_184|, main_~z~0=v_main_~z~0_1898} OutVars{main_#t~post4=|v_main_#t~post4_1040|, main_#t~post5=|v_main_#t~post5_183|, main_~y~0=v_main_~y~0_225, main_~z~0=v_main_~z~0_1860} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {16734#(= main_~y~0 0)} is VALID [2022-04-15 06:56:57,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {16734#(= main_~y~0 0)} [146] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {16730#false} is VALID [2022-04-15 06:56:57,645 INFO L272 TraceCheckUtils]: 9: Hoare triple {16730#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16730#false} is VALID [2022-04-15 06:56:57,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {16730#false} ~cond := #in~cond; {16730#false} is VALID [2022-04-15 06:56:57,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {16730#false} assume 0 == ~cond; {16730#false} is VALID [2022-04-15 06:56:57,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {16730#false} assume !false; {16730#false} is VALID [2022-04-15 06:56:57,646 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 06:56:57,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:57,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761461817] [2022-04-15 06:56:57,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761461817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:57,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:57,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:56:58,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:58,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1219313915] [2022-04-15 06:56:58,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1219313915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:58,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:58,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 06:56:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706045843] [2022-04-15 06:56:58,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:58,500 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2022-04-15 06:56:58,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:58,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:56:58,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:58,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 06:56:58,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:58,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 06:56:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:56:58,533 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:02,481 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-04-15 06:57:02,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 06:57:02,481 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2022-04-15 06:57:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 89 transitions. [2022-04-15 06:57:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 89 transitions. [2022-04-15 06:57:02,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 89 transitions. [2022-04-15 06:57:02,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:02,557 INFO L225 Difference]: With dead ends: 125 [2022-04-15 06:57:02,557 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 06:57:02,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=351, Invalid=6129, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 06:57:02,564 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 2263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:02,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 211 Invalid, 2263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:57:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 06:57:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-04-15 06:57:02,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:02,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 64 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 56 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:02,694 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 64 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 56 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:02,694 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 64 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 56 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:02,695 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-04-15 06:57:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-04-15 06:57:02,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:02,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:02,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 56 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 69 states. [2022-04-15 06:57:02,696 INFO L87 Difference]: Start difference. First operand has 64 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 56 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 69 states. [2022-04-15 06:57:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:02,696 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-04-15 06:57:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-04-15 06:57:02,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:02,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:02,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:02,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 56 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2022-04-15 06:57:02,697 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 57 [2022-04-15 06:57:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:02,697 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-04-15 06:57:02,697 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:02,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 67 transitions. [2022-04-15 06:57:02,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-15 06:57:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 06:57:02,881 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:02,881 INFO L499 BasicCegarLoop]: trace histogram [38, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:02,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-15 06:57:02,882 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:02,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash -216933342, now seen corresponding path program 38 times [2022-04-15 06:57:02,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:02,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [340348972] [2022-04-15 06:57:04,287 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:04,468 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:05,021 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:05,022 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash -823353480, now seen corresponding path program 1 times [2022-04-15 06:57:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:05,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249963999] [2022-04-15 06:57:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:05,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:05,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {17377#(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(12, 2);call #Ultimate.allocInit(12, 3); {17371#true} is VALID [2022-04-15 06:57:05,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {17371#true} assume true; {17371#true} is VALID [2022-04-15 06:57:05,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17371#true} {17371#true} #63#return; {17371#true} is VALID [2022-04-15 06:57:05,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {17371#true} call ULTIMATE.init(); {17377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:05,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {17377#(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(12, 2);call #Ultimate.allocInit(12, 3); {17371#true} is VALID [2022-04-15 06:57:05,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {17371#true} assume true; {17371#true} is VALID [2022-04-15 06:57:05,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17371#true} {17371#true} #63#return; {17371#true} is VALID [2022-04-15 06:57:05,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {17371#true} call #t~ret7 := main(); {17371#true} is VALID [2022-04-15 06:57:05,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {17371#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {17371#true} is VALID [2022-04-15 06:57:05,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {17371#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {17376#(= main_~y~0 0)} is VALID [2022-04-15 06:57:05,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {17376#(= main_~y~0 0)} [149] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_232 v_main_~y~0_231)) (.cse1 (= v_main_~z~0_1987 v_main_~z~0_1948)) (.cse2 (= |v_main_#t~post5_189| |v_main_#t~post5_188|))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post4_1125| |v_main_#t~post4_1087|)) (and .cse0 .cse1 (= |v_main_#t~post4_1087| |v_main_#t~post4_1125|) .cse2))) InVars {main_#t~post4=|v_main_#t~post4_1125|, main_~y~0=v_main_~y~0_232, main_#t~post5=|v_main_#t~post5_189|, main_~z~0=v_main_~z~0_1987} OutVars{main_#t~post4=|v_main_#t~post4_1087|, main_#t~post5=|v_main_#t~post5_188|, main_~y~0=v_main_~y~0_231, main_~z~0=v_main_~z~0_1948} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {17376#(= main_~y~0 0)} is VALID [2022-04-15 06:57:05,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {17376#(= main_~y~0 0)} [148] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {17372#false} is VALID [2022-04-15 06:57:05,067 INFO L272 TraceCheckUtils]: 9: Hoare triple {17372#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {17372#false} is VALID [2022-04-15 06:57:05,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {17372#false} ~cond := #in~cond; {17372#false} is VALID [2022-04-15 06:57:05,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {17372#false} assume 0 == ~cond; {17372#false} is VALID [2022-04-15 06:57:05,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {17372#false} assume !false; {17372#false} is VALID [2022-04-15 06:57:05,067 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 06:57:05,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:05,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249963999] [2022-04-15 06:57:05,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249963999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:05,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:05,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:57:05,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:05,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [340348972] [2022-04-15 06:57:05,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [340348972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:05,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:05,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 06:57:05,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889956557] [2022-04-15 06:57:05,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:05,952 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2022-04-15 06:57:05,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:05,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:05,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:05,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 06:57:05,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:05,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 06:57:05,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:57:05,987 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 43 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:09,546 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-04-15 06:57:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 06:57:09,546 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2022-04-15 06:57:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 90 transitions. [2022-04-15 06:57:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 90 transitions. [2022-04-15 06:57:09,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 90 transitions. [2022-04-15 06:57:09,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:09,613 INFO L225 Difference]: With dead ends: 127 [2022-04-15 06:57:09,613 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 06:57:09,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=360, Invalid=6446, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 06:57:09,614 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:09,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1864 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:57:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 06:57:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-04-15 06:57:09,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:09,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 65 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:09,752 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 65 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:09,753 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 65 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:09,754 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-15 06:57:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-15 06:57:09,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:09,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:09,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 70 states. [2022-04-15 06:57:09,755 INFO L87 Difference]: Start difference. First operand has 65 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 70 states. [2022-04-15 06:57:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:09,757 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-15 06:57:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-15 06:57:09,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:09,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:09,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:09,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-04-15 06:57:09,758 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 58 [2022-04-15 06:57:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:09,759 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-04-15 06:57:09,759 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:09,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 68 transitions. [2022-04-15 06:57:10,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-15 06:57:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 06:57:10,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:10,014 INFO L499 BasicCegarLoop]: trace histogram [39, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:10,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-15 06:57:10,014 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:10,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1477683710, now seen corresponding path program 39 times [2022-04-15 06:57:10,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:10,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1375772526] [2022-04-15 06:57:10,594 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:11,138 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:11,138 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:11,139 INFO L85 PathProgramCache]: Analyzing trace with hash -764248136, now seen corresponding path program 1 times [2022-04-15 06:57:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:11,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488536215] [2022-04-15 06:57:11,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:11,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:11,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:11,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {18030#(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(12, 2);call #Ultimate.allocInit(12, 3); {18024#true} is VALID [2022-04-15 06:57:11,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {18024#true} assume true; {18024#true} is VALID [2022-04-15 06:57:11,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18024#true} {18024#true} #63#return; {18024#true} is VALID [2022-04-15 06:57:11,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {18024#true} call ULTIMATE.init(); {18030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:11,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {18030#(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(12, 2);call #Ultimate.allocInit(12, 3); {18024#true} is VALID [2022-04-15 06:57:11,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {18024#true} assume true; {18024#true} is VALID [2022-04-15 06:57:11,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18024#true} {18024#true} #63#return; {18024#true} is VALID [2022-04-15 06:57:11,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {18024#true} call #t~ret7 := main(); {18024#true} is VALID [2022-04-15 06:57:11,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {18024#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {18024#true} is VALID [2022-04-15 06:57:11,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {18024#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {18029#(= main_~y~0 0)} is VALID [2022-04-15 06:57:11,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {18029#(= main_~y~0 0)} [151] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_238 v_main_~y~0_237) (= |v_main_#t~post5_194| |v_main_#t~post5_193|) (= v_main_~z~0_2078 v_main_~z~0_2038) (= |v_main_#t~post4_1174| |v_main_#t~post4_1135|)) InVars {main_#t~post4=|v_main_#t~post4_1174|, main_~y~0=v_main_~y~0_238, main_#t~post5=|v_main_#t~post5_194|, main_~z~0=v_main_~z~0_2078} OutVars{main_#t~post4=|v_main_#t~post4_1135|, main_#t~post5=|v_main_#t~post5_193|, main_~y~0=v_main_~y~0_237, main_~z~0=v_main_~z~0_2038} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {18029#(= main_~y~0 0)} is VALID [2022-04-15 06:57:11,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {18029#(= main_~y~0 0)} [150] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {18025#false} is VALID [2022-04-15 06:57:11,178 INFO L272 TraceCheckUtils]: 9: Hoare triple {18025#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {18025#false} is VALID [2022-04-15 06:57:11,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {18025#false} ~cond := #in~cond; {18025#false} is VALID [2022-04-15 06:57:11,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {18025#false} assume 0 == ~cond; {18025#false} is VALID [2022-04-15 06:57:11,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {18025#false} assume !false; {18025#false} is VALID [2022-04-15 06:57:11,178 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 06:57:11,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:11,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488536215] [2022-04-15 06:57:11,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488536215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:11,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:11,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:57:12,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:12,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1375772526] [2022-04-15 06:57:12,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1375772526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:12,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:12,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 06:57:12,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369925132] [2022-04-15 06:57:12,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:12,080 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2022-04-15 06:57:12,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:12,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:12,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:12,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 06:57:12,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:12,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 06:57:12,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:57:12,118 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:15,658 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-04-15 06:57:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 06:57:15,659 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2022-04-15 06:57:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 91 transitions. [2022-04-15 06:57:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 91 transitions. [2022-04-15 06:57:15,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 91 transitions. [2022-04-15 06:57:15,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:15,722 INFO L225 Difference]: With dead ends: 129 [2022-04-15 06:57:15,722 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 06:57:15,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=369, Invalid=6771, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 06:57:15,723 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1907 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:15,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1907 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:57:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 06:57:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2022-04-15 06:57:15,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:15,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 66 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 58 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:15,858 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 66 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 58 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:15,859 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 66 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 58 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:15,859 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-04-15 06:57:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-04-15 06:57:15,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:15,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:15,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 58 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 71 states. [2022-04-15 06:57:15,860 INFO L87 Difference]: Start difference. First operand has 66 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 58 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 71 states. [2022-04-15 06:57:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:15,860 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-04-15 06:57:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-04-15 06:57:15,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:15,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:15,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:15,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 58 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-04-15 06:57:15,862 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 59 [2022-04-15 06:57:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:15,862 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-04-15 06:57:15,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:15,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 69 transitions. [2022-04-15 06:57:16,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-04-15 06:57:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 06:57:16,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:16,046 INFO L499 BasicCegarLoop]: trace histogram [40, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:16,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-15 06:57:16,046 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1906239454, now seen corresponding path program 40 times [2022-04-15 06:57:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:16,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [232758011] [2022-04-15 06:57:19,074 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:19,221 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:19,590 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:19,590 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash -705142792, now seen corresponding path program 1 times [2022-04-15 06:57:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:19,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404264112] [2022-04-15 06:57:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:19,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:19,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {18694#(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(12, 2);call #Ultimate.allocInit(12, 3); {18688#true} is VALID [2022-04-15 06:57:19,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {18688#true} assume true; {18688#true} is VALID [2022-04-15 06:57:19,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18688#true} {18688#true} #63#return; {18688#true} is VALID [2022-04-15 06:57:19,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {18688#true} call ULTIMATE.init(); {18694#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:19,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {18694#(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(12, 2);call #Ultimate.allocInit(12, 3); {18688#true} is VALID [2022-04-15 06:57:19,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {18688#true} assume true; {18688#true} is VALID [2022-04-15 06:57:19,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18688#true} {18688#true} #63#return; {18688#true} is VALID [2022-04-15 06:57:19,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {18688#true} call #t~ret7 := main(); {18688#true} is VALID [2022-04-15 06:57:19,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {18688#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {18688#true} is VALID [2022-04-15 06:57:19,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {18688#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {18693#(= main_~y~0 0)} is VALID [2022-04-15 06:57:19,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {18693#(= main_~y~0 0)} [153] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_2171 v_main_~z~0_2130) (= |v_main_#t~post4_1224| |v_main_#t~post4_1184|) (= |v_main_#t~post5_199| |v_main_#t~post5_198|) (= v_main_~y~0_244 v_main_~y~0_243)) InVars {main_#t~post4=|v_main_#t~post4_1224|, main_~y~0=v_main_~y~0_244, main_#t~post5=|v_main_#t~post5_199|, main_~z~0=v_main_~z~0_2171} OutVars{main_#t~post4=|v_main_#t~post4_1184|, main_#t~post5=|v_main_#t~post5_198|, main_~y~0=v_main_~y~0_243, main_~z~0=v_main_~z~0_2130} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {18693#(= main_~y~0 0)} is VALID [2022-04-15 06:57:19,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {18693#(= main_~y~0 0)} [152] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {18689#false} is VALID [2022-04-15 06:57:19,628 INFO L272 TraceCheckUtils]: 9: Hoare triple {18689#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {18689#false} is VALID [2022-04-15 06:57:19,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {18689#false} ~cond := #in~cond; {18689#false} is VALID [2022-04-15 06:57:19,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {18689#false} assume 0 == ~cond; {18689#false} is VALID [2022-04-15 06:57:19,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {18689#false} assume !false; {18689#false} is VALID [2022-04-15 06:57:19,628 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 06:57:19,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:19,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404264112] [2022-04-15 06:57:19,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404264112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:19,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:19,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:57:20,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:20,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [232758011] [2022-04-15 06:57:20,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [232758011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:20,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:20,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 06:57:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279336985] [2022-04-15 06:57:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:20,609 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 44 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2022-04-15 06:57:20,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:20,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 44 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:20,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:20,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 06:57:20,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:20,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 06:57:20,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:57:20,657 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 45 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 44 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:24,632 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2022-04-15 06:57:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 06:57:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 44 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2022-04-15 06:57:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 44 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 92 transitions. [2022-04-15 06:57:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 44 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 92 transitions. [2022-04-15 06:57:24,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 92 transitions. [2022-04-15 06:57:24,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:24,697 INFO L225 Difference]: With dead ends: 131 [2022-04-15 06:57:24,697 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 06:57:24,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=378, Invalid=7104, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 06:57:24,698 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:24,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 126 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:57:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 06:57:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2022-04-15 06:57:24,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:24,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 67 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:24,833 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 67 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:24,833 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 67 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:24,834 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-04-15 06:57:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-04-15 06:57:24,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:24,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:24,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 72 states. [2022-04-15 06:57:24,835 INFO L87 Difference]: Start difference. First operand has 67 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 72 states. [2022-04-15 06:57:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:24,836 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-04-15 06:57:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-04-15 06:57:24,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:24,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:24,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:24,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-04-15 06:57:24,837 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 60 [2022-04-15 06:57:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:24,837 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-04-15 06:57:24,837 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 44 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:24,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 70 transitions. [2022-04-15 06:57:25,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:25,035 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-15 06:57:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 06:57:25,035 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:25,035 INFO L499 BasicCegarLoop]: trace histogram [41, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:25,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-15 06:57:25,036 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1988401666, now seen corresponding path program 41 times [2022-04-15 06:57:25,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:25,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1277733293] [2022-04-15 06:57:26,585 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:26,767 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:27,062 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:27,063 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:27,063 INFO L85 PathProgramCache]: Analyzing trace with hash -646037448, now seen corresponding path program 1 times [2022-04-15 06:57:27,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:27,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548542770] [2022-04-15 06:57:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:27,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:27,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {19369#(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(12, 2);call #Ultimate.allocInit(12, 3); {19363#true} is VALID [2022-04-15 06:57:27,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {19363#true} assume true; {19363#true} is VALID [2022-04-15 06:57:27,105 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19363#true} {19363#true} #63#return; {19363#true} is VALID [2022-04-15 06:57:27,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {19363#true} call ULTIMATE.init(); {19369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:27,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {19369#(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(12, 2);call #Ultimate.allocInit(12, 3); {19363#true} is VALID [2022-04-15 06:57:27,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {19363#true} assume true; {19363#true} is VALID [2022-04-15 06:57:27,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19363#true} {19363#true} #63#return; {19363#true} is VALID [2022-04-15 06:57:27,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {19363#true} call #t~ret7 := main(); {19363#true} is VALID [2022-04-15 06:57:27,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {19363#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {19363#true} is VALID [2022-04-15 06:57:27,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {19363#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {19368#(= main_~y~0 0)} is VALID [2022-04-15 06:57:27,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {19368#(= main_~y~0 0)} [155] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1275| |v_main_#t~post4_1234|)) (.cse1 (= v_main_~z~0_2266 v_main_~z~0_2224)) (.cse2 (= |v_main_#t~post5_204| |v_main_#t~post5_203|))) (or (and .cse0 .cse1 (= v_main_~y~0_249 v_main_~y~0_250) .cse2) (and .cse0 .cse1 (= v_main_~y~0_250 v_main_~y~0_249) .cse2))) InVars {main_#t~post4=|v_main_#t~post4_1275|, main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_204|, main_~z~0=v_main_~z~0_2266} OutVars{main_#t~post4=|v_main_#t~post4_1234|, main_#t~post5=|v_main_#t~post5_203|, main_~y~0=v_main_~y~0_249, main_~z~0=v_main_~z~0_2224} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {19368#(= main_~y~0 0)} is VALID [2022-04-15 06:57:27,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {19368#(= main_~y~0 0)} [154] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {19364#false} is VALID [2022-04-15 06:57:27,106 INFO L272 TraceCheckUtils]: 9: Hoare triple {19364#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19364#false} is VALID [2022-04-15 06:57:27,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {19364#false} ~cond := #in~cond; {19364#false} is VALID [2022-04-15 06:57:27,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {19364#false} assume 0 == ~cond; {19364#false} is VALID [2022-04-15 06:57:27,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {19364#false} assume !false; {19364#false} is VALID [2022-04-15 06:57:27,107 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 06:57:27,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:27,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548542770] [2022-04-15 06:57:27,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548542770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:27,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:27,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:57:28,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:28,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1277733293] [2022-04-15 06:57:28,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1277733293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:28,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:28,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 06:57:28,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841369138] [2022-04-15 06:57:28,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:28,130 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2022-04-15 06:57:28,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:28,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:28,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:28,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 06:57:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:28,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 06:57:28,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:57:28,166 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:32,754 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2022-04-15 06:57:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 06:57:32,754 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2022-04-15 06:57:32,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 93 transitions. [2022-04-15 06:57:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 93 transitions. [2022-04-15 06:57:32,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 93 transitions. [2022-04-15 06:57:32,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:32,824 INFO L225 Difference]: With dead ends: 133 [2022-04-15 06:57:32,824 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 06:57:32,824 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=387, Invalid=7445, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 06:57:32,825 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:32,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 206 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 06:57:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 06:57:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2022-04-15 06:57:32,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:32,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 68 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:32,967 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 68 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:32,967 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 68 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:32,968 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-04-15 06:57:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-04-15 06:57:32,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:32,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:32,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 73 states. [2022-04-15 06:57:32,968 INFO L87 Difference]: Start difference. First operand has 68 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 73 states. [2022-04-15 06:57:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:32,969 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-04-15 06:57:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-04-15 06:57:32,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:32,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:32,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:32,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-15 06:57:32,970 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 61 [2022-04-15 06:57:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:32,970 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-15 06:57:32,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:32,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 71 transitions. [2022-04-15 06:57:33,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-15 06:57:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 06:57:33,201 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:33,201 INFO L499 BasicCegarLoop]: trace histogram [42, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:33,201 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-15 06:57:33,201 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1831775198, now seen corresponding path program 42 times [2022-04-15 06:57:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:33,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1625631215] [2022-04-15 06:57:35,912 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:36,109 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:36,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:36,417 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash -586932104, now seen corresponding path program 1 times [2022-04-15 06:57:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:36,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951650023] [2022-04-15 06:57:36,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:36,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {20055#(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(12, 2);call #Ultimate.allocInit(12, 3); {20049#true} is VALID [2022-04-15 06:57:36,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-15 06:57:36,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20049#true} {20049#true} #63#return; {20049#true} is VALID [2022-04-15 06:57:36,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {20049#true} call ULTIMATE.init(); {20055#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:36,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {20055#(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(12, 2);call #Ultimate.allocInit(12, 3); {20049#true} is VALID [2022-04-15 06:57:36,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-15 06:57:36,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20049#true} {20049#true} #63#return; {20049#true} is VALID [2022-04-15 06:57:36,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {20049#true} call #t~ret7 := main(); {20049#true} is VALID [2022-04-15 06:57:36,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {20049#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {20049#true} is VALID [2022-04-15 06:57:36,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {20049#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {20054#(= main_~y~0 0)} is VALID [2022-04-15 06:57:36,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {20054#(= main_~y~0 0)} [157] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_256 v_main_~y~0_255) (= |v_main_#t~post5_209| |v_main_#t~post5_208|) (= v_main_~z~0_2363 v_main_~z~0_2320) (= |v_main_#t~post4_1327| |v_main_#t~post4_1285|)) InVars {main_#t~post4=|v_main_#t~post4_1327|, main_~y~0=v_main_~y~0_256, main_#t~post5=|v_main_#t~post5_209|, main_~z~0=v_main_~z~0_2363} OutVars{main_#t~post4=|v_main_#t~post4_1285|, main_#t~post5=|v_main_#t~post5_208|, main_~y~0=v_main_~y~0_255, main_~z~0=v_main_~z~0_2320} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {20054#(= main_~y~0 0)} is VALID [2022-04-15 06:57:36,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {20054#(= main_~y~0 0)} [156] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {20050#false} is VALID [2022-04-15 06:57:36,459 INFO L272 TraceCheckUtils]: 9: Hoare triple {20050#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {20050#false} is VALID [2022-04-15 06:57:36,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {20050#false} ~cond := #in~cond; {20050#false} is VALID [2022-04-15 06:57:36,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {20050#false} assume 0 == ~cond; {20050#false} is VALID [2022-04-15 06:57:36,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {20050#false} assume !false; {20050#false} is VALID [2022-04-15 06:57:36,460 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 06:57:36,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:36,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951650023] [2022-04-15 06:57:36,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951650023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:36,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:36,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:57:37,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:37,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1625631215] [2022-04-15 06:57:37,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1625631215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:37,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:37,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 06:57:37,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116260745] [2022-04-15 06:57:37,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:37,434 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2022-04-15 06:57:37,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:37,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:37,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:37,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 06:57:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:37,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 06:57:37,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:57:37,471 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 47 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:42,259 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-04-15 06:57:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 06:57:42,259 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2022-04-15 06:57:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 94 transitions. [2022-04-15 06:57:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 94 transitions. [2022-04-15 06:57:42,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 94 transitions. [2022-04-15 06:57:42,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:42,325 INFO L225 Difference]: With dead ends: 135 [2022-04-15 06:57:42,325 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 06:57:42,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=396, Invalid=7794, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 06:57:42,326 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:42,326 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 241 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 06:57:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 06:57:42,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2022-04-15 06:57:42,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:42,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 69 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:42,472 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 69 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:42,472 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 69 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:42,473 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-15 06:57:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-04-15 06:57:42,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:42,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:42,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 74 states. [2022-04-15 06:57:42,473 INFO L87 Difference]: Start difference. First operand has 69 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 74 states. [2022-04-15 06:57:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:42,474 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-15 06:57:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-04-15 06:57:42,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:42,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:42,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:42,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-04-15 06:57:42,475 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 62 [2022-04-15 06:57:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:42,476 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-04-15 06:57:42,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:42,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 72 transitions. [2022-04-15 06:57:42,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-15 06:57:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 06:57:42,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:42,687 INFO L499 BasicCegarLoop]: trace histogram [43, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:42,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-15 06:57:42,687 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:42,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1826306, now seen corresponding path program 43 times [2022-04-15 06:57:42,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:42,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258580435] [2022-04-15 06:57:43,197 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:43,621 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:43,621 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:43,622 INFO L85 PathProgramCache]: Analyzing trace with hash -527826760, now seen corresponding path program 1 times [2022-04-15 06:57:43,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:43,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274353447] [2022-04-15 06:57:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:43,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {20752#(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(12, 2);call #Ultimate.allocInit(12, 3); {20746#true} is VALID [2022-04-15 06:57:43,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {20746#true} assume true; {20746#true} is VALID [2022-04-15 06:57:43,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20746#true} {20746#true} #63#return; {20746#true} is VALID [2022-04-15 06:57:43,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {20746#true} call ULTIMATE.init(); {20752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:43,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {20752#(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(12, 2);call #Ultimate.allocInit(12, 3); {20746#true} is VALID [2022-04-15 06:57:43,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {20746#true} assume true; {20746#true} is VALID [2022-04-15 06:57:43,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20746#true} {20746#true} #63#return; {20746#true} is VALID [2022-04-15 06:57:43,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {20746#true} call #t~ret7 := main(); {20746#true} is VALID [2022-04-15 06:57:43,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {20746#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {20746#true} is VALID [2022-04-15 06:57:43,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {20746#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {20751#(= main_~y~0 0)} is VALID [2022-04-15 06:57:43,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {20751#(= main_~y~0 0)} [159] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post5_214| |v_main_#t~post5_213|) (= v_main_~y~0_262 v_main_~y~0_261) (= v_main_~z~0_2462 v_main_~z~0_2418) (= |v_main_#t~post4_1380| |v_main_#t~post4_1337|)) InVars {main_#t~post4=|v_main_#t~post4_1380|, main_~y~0=v_main_~y~0_262, main_#t~post5=|v_main_#t~post5_214|, main_~z~0=v_main_~z~0_2462} OutVars{main_#t~post4=|v_main_#t~post4_1337|, main_#t~post5=|v_main_#t~post5_213|, main_~y~0=v_main_~y~0_261, main_~z~0=v_main_~z~0_2418} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {20751#(= main_~y~0 0)} is VALID [2022-04-15 06:57:43,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {20751#(= main_~y~0 0)} [158] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {20747#false} is VALID [2022-04-15 06:57:43,652 INFO L272 TraceCheckUtils]: 9: Hoare triple {20747#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {20747#false} is VALID [2022-04-15 06:57:43,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {20747#false} ~cond := #in~cond; {20747#false} is VALID [2022-04-15 06:57:43,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {20747#false} assume 0 == ~cond; {20747#false} is VALID [2022-04-15 06:57:43,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {20747#false} assume !false; {20747#false} is VALID [2022-04-15 06:57:43,653 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 06:57:43,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:43,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274353447] [2022-04-15 06:57:43,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274353447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:43,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:43,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:57:44,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:44,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258580435] [2022-04-15 06:57:44,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258580435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:44,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:44,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 06:57:44,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706651642] [2022-04-15 06:57:44,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:44,763 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 63 [2022-04-15 06:57:44,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:44,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:44,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:44,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 06:57:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:44,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 06:57:44,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:57:44,799 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:49,462 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-04-15 06:57:49,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 06:57:49,462 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 63 [2022-04-15 06:57:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 95 transitions. [2022-04-15 06:57:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 95 transitions. [2022-04-15 06:57:49,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 95 transitions. [2022-04-15 06:57:49,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:49,532 INFO L225 Difference]: With dead ends: 137 [2022-04-15 06:57:49,532 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 06:57:49,532 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=405, Invalid=8151, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 06:57:49,532 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:49,533 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 181 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 06:57:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 06:57:49,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-04-15 06:57:49,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:49,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 70 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 62 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:49,676 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 70 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 62 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:49,677 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 70 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 62 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:49,678 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-15 06:57:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-15 06:57:49,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:49,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:49,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 62 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 75 states. [2022-04-15 06:57:49,678 INFO L87 Difference]: Start difference. First operand has 70 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 62 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 75 states. [2022-04-15 06:57:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:49,679 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-15 06:57:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-15 06:57:49,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:49,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:49,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:49,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 62 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-15 06:57:49,681 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 63 [2022-04-15 06:57:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:49,681 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-15 06:57:49,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:49,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-15 06:57:49,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-15 06:57:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 06:57:49,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:49,967 INFO L499 BasicCegarLoop]: trace histogram [44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:49,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-15 06:57:49,967 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:49,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:49,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1008898082, now seen corresponding path program 44 times [2022-04-15 06:57:49,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:49,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1494431214] [2022-04-15 06:57:51,971 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:52,163 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:52,504 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:52,504 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash -468721416, now seen corresponding path program 1 times [2022-04-15 06:57:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:52,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604539848] [2022-04-15 06:57:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:52,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:52,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {21460#(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(12, 2);call #Ultimate.allocInit(12, 3); {21454#true} is VALID [2022-04-15 06:57:52,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {21454#true} assume true; {21454#true} is VALID [2022-04-15 06:57:52,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21454#true} {21454#true} #63#return; {21454#true} is VALID [2022-04-15 06:57:52,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {21454#true} call ULTIMATE.init(); {21460#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:52,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {21460#(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(12, 2);call #Ultimate.allocInit(12, 3); {21454#true} is VALID [2022-04-15 06:57:52,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {21454#true} assume true; {21454#true} is VALID [2022-04-15 06:57:52,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21454#true} {21454#true} #63#return; {21454#true} is VALID [2022-04-15 06:57:52,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {21454#true} call #t~ret7 := main(); {21454#true} is VALID [2022-04-15 06:57:52,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {21454#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {21454#true} is VALID [2022-04-15 06:57:52,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {21454#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {21459#(= main_~y~0 0)} is VALID [2022-04-15 06:57:52,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {21459#(= main_~y~0 0)} [161] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1434| |v_main_#t~post4_1390|)) (.cse1 (= v_main_~z~0_2563 v_main_~z~0_2518)) (.cse2 (= v_main_~y~0_268 v_main_~y~0_267))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_218| |v_main_#t~post5_219|)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_219| |v_main_#t~post5_218|)))) InVars {main_#t~post4=|v_main_#t~post4_1434|, main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_219|, main_~z~0=v_main_~z~0_2563} OutVars{main_#t~post4=|v_main_#t~post4_1390|, main_#t~post5=|v_main_#t~post5_218|, main_~y~0=v_main_~y~0_267, main_~z~0=v_main_~z~0_2518} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {21459#(= main_~y~0 0)} is VALID [2022-04-15 06:57:52,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {21459#(= main_~y~0 0)} [160] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {21455#false} is VALID [2022-04-15 06:57:52,538 INFO L272 TraceCheckUtils]: 9: Hoare triple {21455#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {21455#false} is VALID [2022-04-15 06:57:52,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {21455#false} ~cond := #in~cond; {21455#false} is VALID [2022-04-15 06:57:52,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {21455#false} assume 0 == ~cond; {21455#false} is VALID [2022-04-15 06:57:52,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {21455#false} assume !false; {21455#false} is VALID [2022-04-15 06:57:52,538 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 06:57:52,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:52,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604539848] [2022-04-15 06:57:52,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604539848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:52,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:52,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:57:53,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:53,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1494431214] [2022-04-15 06:57:53,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1494431214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:53,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:53,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 06:57:53,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687482660] [2022-04-15 06:57:53,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:53,850 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2022-04-15 06:57:53,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:53,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:53,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:53,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 06:57:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:53,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 06:57:53,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:57:53,897 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 49 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:58,815 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2022-04-15 06:57:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 06:57:58,815 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2022-04-15 06:57:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 96 transitions. [2022-04-15 06:57:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 96 transitions. [2022-04-15 06:57:58,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 96 transitions. [2022-04-15 06:57:58,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:58,906 INFO L225 Difference]: With dead ends: 139 [2022-04-15 06:57:58,906 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 06:57:58,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=414, Invalid=8516, Unknown=0, NotChecked=0, Total=8930 [2022-04-15 06:57:58,908 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:58,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 191 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2735 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 06:57:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 06:57:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-04-15 06:57:59,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:59,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 71 states, 62 states have (on average 1.064516129032258) internal successors, (66), 63 states have internal predecessors, (66), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:59,092 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 71 states, 62 states have (on average 1.064516129032258) internal successors, (66), 63 states have internal predecessors, (66), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:59,094 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 71 states, 62 states have (on average 1.064516129032258) internal successors, (66), 63 states have internal predecessors, (66), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:59,095 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-04-15 06:57:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-04-15 06:57:59,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:59,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:59,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 62 states have (on average 1.064516129032258) internal successors, (66), 63 states have internal predecessors, (66), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 76 states. [2022-04-15 06:57:59,096 INFO L87 Difference]: Start difference. First operand has 71 states, 62 states have (on average 1.064516129032258) internal successors, (66), 63 states have internal predecessors, (66), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 76 states. [2022-04-15 06:57:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:59,096 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-04-15 06:57:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-04-15 06:57:59,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:59,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:59,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:59,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.064516129032258) internal successors, (66), 63 states have internal predecessors, (66), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:57:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-04-15 06:57:59,098 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 64 [2022-04-15 06:57:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:59,098 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-04-15 06:57:59,098 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:57:59,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 74 transitions. [2022-04-15 06:57:59,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-15 06:57:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 06:57:59,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:59,342 INFO L499 BasicCegarLoop]: trace histogram [45, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:59,342 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-15 06:57:59,342 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:59,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2131615230, now seen corresponding path program 45 times [2022-04-15 06:57:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:59,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342065361] [2022-04-15 06:57:59,697 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:00,050 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:00,050 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash -409616072, now seen corresponding path program 1 times [2022-04-15 06:58:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:00,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671412932] [2022-04-15 06:58:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:00,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:00,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:00,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {22179#(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(12, 2);call #Ultimate.allocInit(12, 3); {22173#true} is VALID [2022-04-15 06:58:00,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {22173#true} assume true; {22173#true} is VALID [2022-04-15 06:58:00,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22173#true} {22173#true} #63#return; {22173#true} is VALID [2022-04-15 06:58:00,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {22173#true} call ULTIMATE.init(); {22179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:00,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {22179#(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(12, 2);call #Ultimate.allocInit(12, 3); {22173#true} is VALID [2022-04-15 06:58:00,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {22173#true} assume true; {22173#true} is VALID [2022-04-15 06:58:00,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22173#true} {22173#true} #63#return; {22173#true} is VALID [2022-04-15 06:58:00,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {22173#true} call #t~ret7 := main(); {22173#true} is VALID [2022-04-15 06:58:00,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {22173#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {22173#true} is VALID [2022-04-15 06:58:00,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {22173#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {22178#(= main_~y~0 0)} is VALID [2022-04-15 06:58:00,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {22178#(= main_~y~0 0)} [163] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_2666 v_main_~z~0_2620) (= |v_main_#t~post5_224| |v_main_#t~post5_223|) (= v_main_~y~0_274 v_main_~y~0_273) (= |v_main_#t~post4_1489| |v_main_#t~post4_1444|)) InVars {main_#t~post4=|v_main_#t~post4_1489|, main_~y~0=v_main_~y~0_274, main_#t~post5=|v_main_#t~post5_224|, main_~z~0=v_main_~z~0_2666} OutVars{main_#t~post4=|v_main_#t~post4_1444|, main_#t~post5=|v_main_#t~post5_223|, main_~y~0=v_main_~y~0_273, main_~z~0=v_main_~z~0_2620} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {22178#(= main_~y~0 0)} is VALID [2022-04-15 06:58:00,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {22178#(= main_~y~0 0)} [162] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {22174#false} is VALID [2022-04-15 06:58:00,087 INFO L272 TraceCheckUtils]: 9: Hoare triple {22174#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {22174#false} is VALID [2022-04-15 06:58:00,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {22174#false} ~cond := #in~cond; {22174#false} is VALID [2022-04-15 06:58:00,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {22174#false} assume 0 == ~cond; {22174#false} is VALID [2022-04-15 06:58:00,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {22174#false} assume !false; {22174#false} is VALID [2022-04-15 06:58:00,088 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 06:58:00,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:00,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671412932] [2022-04-15 06:58:00,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671412932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:00,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:00,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:58:01,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:01,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342065361] [2022-04-15 06:58:01,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342065361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:01,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:01,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 06:58:01,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663015121] [2022-04-15 06:58:01,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:01,349 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2022-04-15 06:58:01,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:01,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:01,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:01,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 06:58:01,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:01,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 06:58:01,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 06:58:01,386 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:06,665 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2022-04-15 06:58:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 06:58:06,665 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2022-04-15 06:58:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 97 transitions. [2022-04-15 06:58:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 97 transitions. [2022-04-15 06:58:06,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 97 transitions. [2022-04-15 06:58:06,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:06,734 INFO L225 Difference]: With dead ends: 141 [2022-04-15 06:58:06,734 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 06:58:06,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=423, Invalid=8889, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 06:58:06,734 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:06,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 236 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 06:58:06,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 06:58:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-04-15 06:58:06,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:06,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 72 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:06,915 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 72 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:06,915 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 72 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:06,916 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-04-15 06:58:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-15 06:58:06,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:06,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:06,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 77 states. [2022-04-15 06:58:06,916 INFO L87 Difference]: Start difference. First operand has 72 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 77 states. [2022-04-15 06:58:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:06,917 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-04-15 06:58:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-15 06:58:06,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:06,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:06,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:06,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-04-15 06:58:06,919 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 65 [2022-04-15 06:58:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:06,919 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-04-15 06:58:06,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:06,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 75 transitions. [2022-04-15 06:58:07,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-04-15 06:58:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 06:58:07,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:07,150 INFO L499 BasicCegarLoop]: trace histogram [46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:07,150 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-15 06:58:07,150 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:07,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash -703280094, now seen corresponding path program 46 times [2022-04-15 06:58:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:07,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1763240867] [2022-04-15 06:58:09,831 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:58:09,987 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:10,498 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:10,499 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash -350510728, now seen corresponding path program 1 times [2022-04-15 06:58:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:10,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424902145] [2022-04-15 06:58:10,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:10,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:10,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {22909#(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(12, 2);call #Ultimate.allocInit(12, 3); {22903#true} is VALID [2022-04-15 06:58:10,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {22903#true} assume true; {22903#true} is VALID [2022-04-15 06:58:10,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22903#true} {22903#true} #63#return; {22903#true} is VALID [2022-04-15 06:58:10,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {22903#true} call ULTIMATE.init(); {22909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:10,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {22909#(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(12, 2);call #Ultimate.allocInit(12, 3); {22903#true} is VALID [2022-04-15 06:58:10,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {22903#true} assume true; {22903#true} is VALID [2022-04-15 06:58:10,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22903#true} {22903#true} #63#return; {22903#true} is VALID [2022-04-15 06:58:10,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {22903#true} call #t~ret7 := main(); {22903#true} is VALID [2022-04-15 06:58:10,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {22903#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {22903#true} is VALID [2022-04-15 06:58:10,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {22903#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {22908#(= main_~y~0 0)} is VALID [2022-04-15 06:58:10,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {22908#(= main_~y~0 0)} [165] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_2771 v_main_~z~0_2724) (= v_main_~y~0_280 v_main_~y~0_279) (= |v_main_#t~post4_1545| |v_main_#t~post4_1499|) (= |v_main_#t~post5_229| |v_main_#t~post5_228|)) InVars {main_#t~post4=|v_main_#t~post4_1545|, main_~y~0=v_main_~y~0_280, main_#t~post5=|v_main_#t~post5_229|, main_~z~0=v_main_~z~0_2771} OutVars{main_#t~post4=|v_main_#t~post4_1499|, main_#t~post5=|v_main_#t~post5_228|, main_~y~0=v_main_~y~0_279, main_~z~0=v_main_~z~0_2724} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {22908#(= main_~y~0 0)} is VALID [2022-04-15 06:58:10,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {22908#(= main_~y~0 0)} [164] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {22904#false} is VALID [2022-04-15 06:58:10,538 INFO L272 TraceCheckUtils]: 9: Hoare triple {22904#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {22904#false} is VALID [2022-04-15 06:58:10,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {22904#false} ~cond := #in~cond; {22904#false} is VALID [2022-04-15 06:58:10,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {22904#false} assume 0 == ~cond; {22904#false} is VALID [2022-04-15 06:58:10,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {22904#false} assume !false; {22904#false} is VALID [2022-04-15 06:58:10,538 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 06:58:10,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:10,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424902145] [2022-04-15 06:58:10,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424902145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:10,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:10,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:58:11,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:11,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1763240867] [2022-04-15 06:58:11,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1763240867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:11,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:11,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 06:58:11,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857881074] [2022-04-15 06:58:11,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:11,729 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 66 [2022-04-15 06:58:11,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:11,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:11,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:11,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 06:58:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:11,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 06:58:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:58:11,769 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:16,678 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2022-04-15 06:58:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 06:58:16,678 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 66 [2022-04-15 06:58:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 98 transitions. [2022-04-15 06:58:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 98 transitions. [2022-04-15 06:58:16,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 98 transitions. [2022-04-15 06:58:16,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:16,758 INFO L225 Difference]: With dead ends: 143 [2022-04-15 06:58:16,758 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 06:58:16,759 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=432, Invalid=9270, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 06:58:16,759 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 2606 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:16,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 76 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2606 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 06:58:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 06:58:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-04-15 06:58:16,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:16,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 73 states, 64 states have (on average 1.0625) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:16,920 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 73 states, 64 states have (on average 1.0625) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:16,920 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 73 states, 64 states have (on average 1.0625) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:16,921 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-04-15 06:58:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-04-15 06:58:16,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:16,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:16,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 64 states have (on average 1.0625) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 78 states. [2022-04-15 06:58:16,921 INFO L87 Difference]: Start difference. First operand has 73 states, 64 states have (on average 1.0625) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 78 states. [2022-04-15 06:58:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:16,922 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-04-15 06:58:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-04-15 06:58:16,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:16,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:16,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:16,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.0625) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-15 06:58:16,923 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 66 [2022-04-15 06:58:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:16,923 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-15 06:58:16,924 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:16,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 76 transitions. [2022-04-15 06:58:17,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-15 06:58:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 06:58:17,180 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:17,180 INFO L499 BasicCegarLoop]: trace histogram [47, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:17,180 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-04-15 06:58:17,180 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:17,181 INFO L85 PathProgramCache]: Analyzing trace with hash 625436162, now seen corresponding path program 47 times [2022-04-15 06:58:17,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:17,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1804576679] [2022-04-15 06:58:20,081 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:58:20,260 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:20,733 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:20,733 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash -291405384, now seen corresponding path program 1 times [2022-04-15 06:58:20,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:20,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616767269] [2022-04-15 06:58:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:20,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {23650#(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(12, 2);call #Ultimate.allocInit(12, 3); {23644#true} is VALID [2022-04-15 06:58:20,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {23644#true} assume true; {23644#true} is VALID [2022-04-15 06:58:20,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23644#true} {23644#true} #63#return; {23644#true} is VALID [2022-04-15 06:58:20,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {23644#true} call ULTIMATE.init(); {23650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:20,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {23650#(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(12, 2);call #Ultimate.allocInit(12, 3); {23644#true} is VALID [2022-04-15 06:58:20,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {23644#true} assume true; {23644#true} is VALID [2022-04-15 06:58:20,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23644#true} {23644#true} #63#return; {23644#true} is VALID [2022-04-15 06:58:20,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {23644#true} call #t~ret7 := main(); {23644#true} is VALID [2022-04-15 06:58:20,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {23644#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {23644#true} is VALID [2022-04-15 06:58:20,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {23644#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {23649#(= main_~y~0 0)} is VALID [2022-04-15 06:58:20,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {23649#(= main_~y~0 0)} [167] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_286 v_main_~y~0_285) (= |v_main_#t~post4_1602| |v_main_#t~post4_1555|) (= |v_main_#t~post5_234| |v_main_#t~post5_233|) (= v_main_~z~0_2878 v_main_~z~0_2830)) InVars {main_#t~post4=|v_main_#t~post4_1602|, main_~y~0=v_main_~y~0_286, main_#t~post5=|v_main_#t~post5_234|, main_~z~0=v_main_~z~0_2878} OutVars{main_#t~post4=|v_main_#t~post4_1555|, main_#t~post5=|v_main_#t~post5_233|, main_~y~0=v_main_~y~0_285, main_~z~0=v_main_~z~0_2830} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {23649#(= main_~y~0 0)} is VALID [2022-04-15 06:58:20,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {23649#(= main_~y~0 0)} [166] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {23645#false} is VALID [2022-04-15 06:58:20,793 INFO L272 TraceCheckUtils]: 9: Hoare triple {23645#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {23645#false} is VALID [2022-04-15 06:58:20,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {23645#false} ~cond := #in~cond; {23645#false} is VALID [2022-04-15 06:58:20,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {23645#false} assume 0 == ~cond; {23645#false} is VALID [2022-04-15 06:58:20,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {23645#false} assume !false; {23645#false} is VALID [2022-04-15 06:58:20,793 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 06:58:20,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:20,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616767269] [2022-04-15 06:58:20,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616767269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:20,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:20,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:58:22,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:22,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1804576679] [2022-04-15 06:58:22,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1804576679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:22,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:22,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 06:58:22,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622913390] [2022-04-15 06:58:22,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2022-04-15 06:58:22,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:22,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:22,143 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 06:58:22,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 06:58:22,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:22,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 06:58:22,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 06:58:22,144 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:27,451 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2022-04-15 06:58:27,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 06:58:27,451 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2022-04-15 06:58:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 99 transitions. [2022-04-15 06:58:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 99 transitions. [2022-04-15 06:58:27,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 99 transitions. [2022-04-15 06:58:27,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:27,524 INFO L225 Difference]: With dead ends: 145 [2022-04-15 06:58:27,524 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 06:58:27,525 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=441, Invalid=9659, Unknown=0, NotChecked=0, Total=10100 [2022-04-15 06:58:27,525 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2818 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:27,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 116 Invalid, 2927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2818 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 06:58:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 06:58:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-04-15 06:58:27,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:27,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 74 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:27,705 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 74 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:27,705 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 74 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:27,706 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2022-04-15 06:58:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-15 06:58:27,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:27,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:27,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 79 states. [2022-04-15 06:58:27,707 INFO L87 Difference]: Start difference. First operand has 74 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 79 states. [2022-04-15 06:58:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:27,708 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2022-04-15 06:58:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-15 06:58:27,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:27,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:27,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:27,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-15 06:58:27,709 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 67 [2022-04-15 06:58:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:27,709 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-15 06:58:27,709 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:27,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 77 transitions. [2022-04-15 06:58:27,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-15 06:58:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 06:58:27,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:27,970 INFO L499 BasicCegarLoop]: trace histogram [48, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:27,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-04-15 06:58:27,970 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:27,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1134032862, now seen corresponding path program 48 times [2022-04-15 06:58:27,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:27,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [639053652] [2022-04-15 06:58:28,369 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:28,713 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:28,713 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash -232300040, now seen corresponding path program 1 times [2022-04-15 06:58:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:28,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190385522] [2022-04-15 06:58:28,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:28,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:28,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:28,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {24402#(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(12, 2);call #Ultimate.allocInit(12, 3); {24396#true} is VALID [2022-04-15 06:58:28,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {24396#true} assume true; {24396#true} is VALID [2022-04-15 06:58:28,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24396#true} {24396#true} #63#return; {24396#true} is VALID [2022-04-15 06:58:28,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {24396#true} call ULTIMATE.init(); {24402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:28,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {24402#(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(12, 2);call #Ultimate.allocInit(12, 3); {24396#true} is VALID [2022-04-15 06:58:28,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {24396#true} assume true; {24396#true} is VALID [2022-04-15 06:58:28,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24396#true} {24396#true} #63#return; {24396#true} is VALID [2022-04-15 06:58:28,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {24396#true} call #t~ret7 := main(); {24396#true} is VALID [2022-04-15 06:58:28,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {24396#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {24396#true} is VALID [2022-04-15 06:58:28,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {24396#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {24401#(= main_~y~0 0)} is VALID [2022-04-15 06:58:28,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {24401#(= main_~y~0 0)} [169] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post5_239| |v_main_#t~post5_238|) (= v_main_~z~0_2987 v_main_~z~0_2938) (= |v_main_#t~post4_1660| |v_main_#t~post4_1612|) (= v_main_~y~0_292 v_main_~y~0_291)) InVars {main_#t~post4=|v_main_#t~post4_1660|, main_~y~0=v_main_~y~0_292, main_#t~post5=|v_main_#t~post5_239|, main_~z~0=v_main_~z~0_2987} OutVars{main_#t~post4=|v_main_#t~post4_1612|, main_#t~post5=|v_main_#t~post5_238|, main_~y~0=v_main_~y~0_291, main_~z~0=v_main_~z~0_2938} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {24401#(= main_~y~0 0)} is VALID [2022-04-15 06:58:28,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {24401#(= main_~y~0 0)} [168] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {24397#false} is VALID [2022-04-15 06:58:28,755 INFO L272 TraceCheckUtils]: 9: Hoare triple {24397#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {24397#false} is VALID [2022-04-15 06:58:28,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {24397#false} ~cond := #in~cond; {24397#false} is VALID [2022-04-15 06:58:28,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {24397#false} assume 0 == ~cond; {24397#false} is VALID [2022-04-15 06:58:28,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {24397#false} assume !false; {24397#false} is VALID [2022-04-15 06:58:28,755 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 06:58:28,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:28,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190385522] [2022-04-15 06:58:28,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190385522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:28,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:28,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:58:30,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:30,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [639053652] [2022-04-15 06:58:30,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [639053652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:30,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:30,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 06:58:30,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101261346] [2022-04-15 06:58:30,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:30,055 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-04-15 06:58:30,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:30,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:30,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:30,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 06:58:30,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:30,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 06:58:30,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2604, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:58:30,096 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 53 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:35,440 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-04-15 06:58:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 06:58:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-04-15 06:58:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 100 transitions. [2022-04-15 06:58:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 100 transitions. [2022-04-15 06:58:35,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 100 transitions. [2022-04-15 06:58:35,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:35,510 INFO L225 Difference]: With dead ends: 147 [2022-04-15 06:58:35,510 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 06:58:35,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=450, Invalid=10056, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 06:58:35,511 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2935 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:35,511 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 121 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2935 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 06:58:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 06:58:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2022-04-15 06:58:35,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:35,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 75 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 67 states have internal predecessors, (70), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:35,682 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 75 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 67 states have internal predecessors, (70), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:35,682 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 75 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 67 states have internal predecessors, (70), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:35,682 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-04-15 06:58:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-04-15 06:58:35,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:35,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:35,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 67 states have internal predecessors, (70), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 80 states. [2022-04-15 06:58:35,683 INFO L87 Difference]: Start difference. First operand has 75 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 67 states have internal predecessors, (70), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 80 states. [2022-04-15 06:58:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:35,684 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-04-15 06:58:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-04-15 06:58:35,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:35,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:35,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:35,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 67 states have internal predecessors, (70), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-15 06:58:35,685 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 68 [2022-04-15 06:58:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:35,685 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-15 06:58:35,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:35,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 78 transitions. [2022-04-15 06:58:35,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-15 06:58:35,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 06:58:35,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:35,972 INFO L499 BasicCegarLoop]: trace histogram [49, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:35,972 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-04-15 06:58:35,972 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash 157002242, now seen corresponding path program 49 times [2022-04-15 06:58:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:35,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1436007043] [2022-04-15 06:58:37,852 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:58:38,037 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:38,643 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:38,643 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:38,644 INFO L85 PathProgramCache]: Analyzing trace with hash -173194696, now seen corresponding path program 1 times [2022-04-15 06:58:38,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:38,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13785678] [2022-04-15 06:58:38,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:38,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {25165#(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(12, 2);call #Ultimate.allocInit(12, 3); {25159#true} is VALID [2022-04-15 06:58:38,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {25159#true} assume true; {25159#true} is VALID [2022-04-15 06:58:38,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25159#true} {25159#true} #63#return; {25159#true} is VALID [2022-04-15 06:58:38,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {25159#true} call ULTIMATE.init(); {25165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:38,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {25165#(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(12, 2);call #Ultimate.allocInit(12, 3); {25159#true} is VALID [2022-04-15 06:58:38,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {25159#true} assume true; {25159#true} is VALID [2022-04-15 06:58:38,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25159#true} {25159#true} #63#return; {25159#true} is VALID [2022-04-15 06:58:38,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {25159#true} call #t~ret7 := main(); {25159#true} is VALID [2022-04-15 06:58:38,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {25159#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {25159#true} is VALID [2022-04-15 06:58:38,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {25159#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {25164#(= main_~y~0 0)} is VALID [2022-04-15 06:58:38,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {25164#(= main_~y~0 0)} [171] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post5_244| |v_main_#t~post5_243|) (= |v_main_#t~post4_1719| |v_main_#t~post4_1670|) (= v_main_~y~0_298 v_main_~y~0_297) (= v_main_~z~0_3098 v_main_~z~0_3048)) InVars {main_#t~post4=|v_main_#t~post4_1719|, main_~y~0=v_main_~y~0_298, main_#t~post5=|v_main_#t~post5_244|, main_~z~0=v_main_~z~0_3098} OutVars{main_#t~post4=|v_main_#t~post4_1670|, main_#t~post5=|v_main_#t~post5_243|, main_~y~0=v_main_~y~0_297, main_~z~0=v_main_~z~0_3048} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {25164#(= main_~y~0 0)} is VALID [2022-04-15 06:58:38,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {25164#(= main_~y~0 0)} [170] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {25160#false} is VALID [2022-04-15 06:58:38,674 INFO L272 TraceCheckUtils]: 9: Hoare triple {25160#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {25160#false} is VALID [2022-04-15 06:58:38,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {25160#false} ~cond := #in~cond; {25160#false} is VALID [2022-04-15 06:58:38,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {25160#false} assume 0 == ~cond; {25160#false} is VALID [2022-04-15 06:58:38,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {25160#false} assume !false; {25160#false} is VALID [2022-04-15 06:58:38,674 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 06:58:38,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:38,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13785678] [2022-04-15 06:58:38,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13785678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:38,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:38,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:58:40,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:40,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1436007043] [2022-04-15 06:58:40,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1436007043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:40,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:40,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 06:58:40,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375176800] [2022-04-15 06:58:40,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:40,014 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 53 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2022-04-15 06:58:40,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:40,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 53 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:40,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:40,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 06:58:40,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:40,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 06:58:40,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2707, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:58:40,054 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 54 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 53 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:45,670 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2022-04-15 06:58:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 06:58:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 53 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2022-04-15 06:58:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 53 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 101 transitions. [2022-04-15 06:58:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 53 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 101 transitions. [2022-04-15 06:58:45,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 101 transitions. [2022-04-15 06:58:45,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:45,752 INFO L225 Difference]: With dead ends: 149 [2022-04-15 06:58:45,752 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 06:58:45,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=459, Invalid=10461, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 06:58:45,753 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3136 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:45,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 156 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3136 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 06:58:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 06:58:45,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-04-15 06:58:45,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:45,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 76 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 68 states have internal predecessors, (71), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:45,933 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 76 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 68 states have internal predecessors, (71), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:45,933 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 76 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 68 states have internal predecessors, (71), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:45,934 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-04-15 06:58:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-04-15 06:58:45,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:45,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:45,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 68 states have internal predecessors, (71), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 81 states. [2022-04-15 06:58:45,935 INFO L87 Difference]: Start difference. First operand has 76 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 68 states have internal predecessors, (71), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 81 states. [2022-04-15 06:58:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:45,935 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-04-15 06:58:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-04-15 06:58:45,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:45,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:45,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:45,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 68 states have internal predecessors, (71), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-15 06:58:45,936 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 69 [2022-04-15 06:58:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:45,936 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-15 06:58:45,936 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 53 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:45,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 79 transitions. [2022-04-15 06:58:46,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-15 06:58:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 06:58:46,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:46,203 INFO L499 BasicCegarLoop]: trace histogram [50, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:46,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-04-15 06:58:46,203 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:46,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:46,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1524384802, now seen corresponding path program 50 times [2022-04-15 06:58:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:46,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1601408504] [2022-04-15 06:58:48,195 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:58:48,353 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:48,982 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:48,982 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:48,983 INFO L85 PathProgramCache]: Analyzing trace with hash -114089352, now seen corresponding path program 1 times [2022-04-15 06:58:48,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:48,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288485204] [2022-04-15 06:58:48,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:49,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {25939#(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(12, 2);call #Ultimate.allocInit(12, 3); {25933#true} is VALID [2022-04-15 06:58:49,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {25933#true} assume true; {25933#true} is VALID [2022-04-15 06:58:49,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25933#true} {25933#true} #63#return; {25933#true} is VALID [2022-04-15 06:58:49,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {25933#true} call ULTIMATE.init(); {25939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:49,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {25939#(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(12, 2);call #Ultimate.allocInit(12, 3); {25933#true} is VALID [2022-04-15 06:58:49,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {25933#true} assume true; {25933#true} is VALID [2022-04-15 06:58:49,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25933#true} {25933#true} #63#return; {25933#true} is VALID [2022-04-15 06:58:49,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {25933#true} call #t~ret7 := main(); {25933#true} is VALID [2022-04-15 06:58:49,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {25933#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {25933#true} is VALID [2022-04-15 06:58:49,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {25933#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {25938#(= main_~y~0 0)} is VALID [2022-04-15 06:58:49,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {25938#(= main_~y~0 0)} [173] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_304 v_main_~y~0_303) (= v_main_~z~0_3211 v_main_~z~0_3160) (= |v_main_#t~post4_1779| |v_main_#t~post4_1729|) (= |v_main_#t~post5_249| |v_main_#t~post5_248|)) InVars {main_#t~post4=|v_main_#t~post4_1779|, main_~y~0=v_main_~y~0_304, main_#t~post5=|v_main_#t~post5_249|, main_~z~0=v_main_~z~0_3211} OutVars{main_#t~post4=|v_main_#t~post4_1729|, main_#t~post5=|v_main_#t~post5_248|, main_~y~0=v_main_~y~0_303, main_~z~0=v_main_~z~0_3160} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {25938#(= main_~y~0 0)} is VALID [2022-04-15 06:58:49,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {25938#(= main_~y~0 0)} [172] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {25934#false} is VALID [2022-04-15 06:58:49,022 INFO L272 TraceCheckUtils]: 9: Hoare triple {25934#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {25934#false} is VALID [2022-04-15 06:58:49,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {25934#false} ~cond := #in~cond; {25934#false} is VALID [2022-04-15 06:58:49,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {25934#false} assume 0 == ~cond; {25934#false} is VALID [2022-04-15 06:58:49,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {25934#false} assume !false; {25934#false} is VALID [2022-04-15 06:58:49,022 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 06:58:49,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:49,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288485204] [2022-04-15 06:58:49,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288485204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:49,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:49,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:58:50,444 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:50,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1601408504] [2022-04-15 06:58:50,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1601408504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:50,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:50,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 06:58:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232457400] [2022-04-15 06:58:50,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:50,445 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 54 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2022-04-15 06:58:50,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:50,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 54 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:50,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:50,485 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 06:58:50,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:50,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 06:58:50,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2812, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:58:50,485 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 55 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 54 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:55,855 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2022-04-15 06:58:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 06:58:55,856 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 54 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2022-04-15 06:58:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 54 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2022-04-15 06:58:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 54 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2022-04-15 06:58:55,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 102 transitions. [2022-04-15 06:58:55,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:55,926 INFO L225 Difference]: With dead ends: 151 [2022-04-15 06:58:55,926 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 06:58:55,927 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=468, Invalid=10874, Unknown=0, NotChecked=0, Total=11342 [2022-04-15 06:58:55,927 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:55,928 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 3007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 06:58:55,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 06:58:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-04-15 06:58:56,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:56,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 77 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 69 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:56,096 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 77 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 69 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:56,096 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 77 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 69 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:56,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:56,096 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-04-15 06:58:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-04-15 06:58:56,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:56,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:56,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 69 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 82 states. [2022-04-15 06:58:56,097 INFO L87 Difference]: Start difference. First operand has 77 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 69 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 82 states. [2022-04-15 06:58:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:56,098 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-04-15 06:58:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-04-15 06:58:56,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:56,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:56,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:56,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 69 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-04-15 06:58:56,099 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 70 [2022-04-15 06:58:56,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:56,099 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-04-15 06:58:56,100 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 54 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:56,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 80 transitions. [2022-04-15 06:58:56,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-04-15 06:58:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 06:58:56,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:56,378 INFO L499 BasicCegarLoop]: trace histogram [51, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:56,378 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-04-15 06:58:56,378 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:56,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash 963571202, now seen corresponding path program 51 times [2022-04-15 06:58:56,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:56,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1151086279] [2022-04-15 06:58:56,746 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:57,351 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:57,351 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash -54984008, now seen corresponding path program 1 times [2022-04-15 06:58:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:57,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22037828] [2022-04-15 06:58:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:57,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:57,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {26724#(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(12, 2);call #Ultimate.allocInit(12, 3); {26718#true} is VALID [2022-04-15 06:58:57,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {26718#true} assume true; {26718#true} is VALID [2022-04-15 06:58:57,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26718#true} {26718#true} #63#return; {26718#true} is VALID [2022-04-15 06:58:57,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {26718#true} call ULTIMATE.init(); {26724#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:57,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {26724#(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(12, 2);call #Ultimate.allocInit(12, 3); {26718#true} is VALID [2022-04-15 06:58:57,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {26718#true} assume true; {26718#true} is VALID [2022-04-15 06:58:57,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26718#true} {26718#true} #63#return; {26718#true} is VALID [2022-04-15 06:58:57,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {26718#true} call #t~ret7 := main(); {26718#true} is VALID [2022-04-15 06:58:57,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {26718#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {26718#true} is VALID [2022-04-15 06:58:57,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {26718#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {26723#(= main_~y~0 0)} is VALID [2022-04-15 06:58:57,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {26723#(= main_~y~0 0)} [175] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_254| |v_main_#t~post5_253|)) (.cse1 (= v_main_~z~0_3326 v_main_~z~0_3274)) (.cse2 (= |v_main_#t~post4_1840| |v_main_#t~post4_1789|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_310 v_main_~y~0_309)) (and .cse0 .cse1 .cse2 (= v_main_~y~0_309 v_main_~y~0_310)))) InVars {main_#t~post4=|v_main_#t~post4_1840|, main_~y~0=v_main_~y~0_310, main_#t~post5=|v_main_#t~post5_254|, main_~z~0=v_main_~z~0_3326} OutVars{main_#t~post4=|v_main_#t~post4_1789|, main_#t~post5=|v_main_#t~post5_253|, main_~y~0=v_main_~y~0_309, main_~z~0=v_main_~z~0_3274} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {26723#(= main_~y~0 0)} is VALID [2022-04-15 06:58:57,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {26723#(= main_~y~0 0)} [174] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {26719#false} is VALID [2022-04-15 06:58:57,390 INFO L272 TraceCheckUtils]: 9: Hoare triple {26719#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26719#false} is VALID [2022-04-15 06:58:57,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {26719#false} ~cond := #in~cond; {26719#false} is VALID [2022-04-15 06:58:57,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {26719#false} assume 0 == ~cond; {26719#false} is VALID [2022-04-15 06:58:57,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {26719#false} assume !false; {26719#false} is VALID [2022-04-15 06:58:57,390 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 06:58:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:57,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22037828] [2022-04-15 06:58:57,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22037828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:57,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:57,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:58:58,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:58,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1151086279] [2022-04-15 06:58:58,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1151086279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:58,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:58,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 06:58:58,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96990703] [2022-04-15 06:58:58,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:58,786 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 55 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2022-04-15 06:58:58,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:58,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 55 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:58:58,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:58,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 06:58:58,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:58,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 06:58:58,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2919, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 06:58:58,833 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 56 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 55 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:05,180 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2022-04-15 06:59:05,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 06:59:05,181 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 55 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2022-04-15 06:59:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 55 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 103 transitions. [2022-04-15 06:59:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 55 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 103 transitions. [2022-04-15 06:59:05,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 103 transitions. [2022-04-15 06:59:05,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:05,255 INFO L225 Difference]: With dead ends: 153 [2022-04-15 06:59:05,255 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 06:59:05,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=477, Invalid=11295, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 06:59:05,257 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 3575 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 3691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 3575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:05,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 236 Invalid, 3691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 3575 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 06:59:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 06:59:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2022-04-15 06:59:05,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:05,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 78 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 70 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:05,471 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 78 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 70 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:05,471 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 78 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 70 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:05,472 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-04-15 06:59:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-04-15 06:59:05,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:05,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:05,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 70 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 83 states. [2022-04-15 06:59:05,473 INFO L87 Difference]: Start difference. First operand has 78 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 70 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 83 states. [2022-04-15 06:59:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:05,474 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-04-15 06:59:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-04-15 06:59:05,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:05,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:05,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:05,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 70 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-15 06:59:05,475 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 71 [2022-04-15 06:59:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:05,475 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-15 06:59:05,475 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 55 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:05,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-15 06:59:05,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 06:59:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 06:59:05,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:05,790 INFO L499 BasicCegarLoop]: trace histogram [52, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:05,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-04-15 06:59:05,790 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:05,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:05,790 INFO L85 PathProgramCache]: Analyzing trace with hash 758218786, now seen corresponding path program 52 times [2022-04-15 06:59:05,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:05,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [418561139] [2022-04-15 06:59:08,771 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:09,305 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:09,306 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:09,307 INFO L85 PathProgramCache]: Analyzing trace with hash 4121336, now seen corresponding path program 1 times [2022-04-15 06:59:09,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:09,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970799755] [2022-04-15 06:59:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:09,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:09,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:09,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {27520#(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(12, 2);call #Ultimate.allocInit(12, 3); {27514#true} is VALID [2022-04-15 06:59:09,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {27514#true} assume true; {27514#true} is VALID [2022-04-15 06:59:09,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27514#true} {27514#true} #63#return; {27514#true} is VALID [2022-04-15 06:59:09,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {27514#true} call ULTIMATE.init(); {27520#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:09,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {27520#(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(12, 2);call #Ultimate.allocInit(12, 3); {27514#true} is VALID [2022-04-15 06:59:09,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {27514#true} assume true; {27514#true} is VALID [2022-04-15 06:59:09,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27514#true} {27514#true} #63#return; {27514#true} is VALID [2022-04-15 06:59:09,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {27514#true} call #t~ret7 := main(); {27514#true} is VALID [2022-04-15 06:59:09,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {27514#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {27514#true} is VALID [2022-04-15 06:59:09,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {27514#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {27519#(= main_~y~0 0)} is VALID [2022-04-15 06:59:09,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {27519#(= main_~y~0 0)} [177] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~z~0_3443 v_main_~z~0_3390)) (.cse1 (= v_main_~y~0_316 v_main_~y~0_315)) (.cse2 (= |v_main_#t~post5_259| |v_main_#t~post5_258|))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post4_1902| |v_main_#t~post4_1850|)) (and .cse0 (= |v_main_#t~post4_1850| |v_main_#t~post4_1902|) .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_1902|, main_~y~0=v_main_~y~0_316, main_#t~post5=|v_main_#t~post5_259|, main_~z~0=v_main_~z~0_3443} OutVars{main_#t~post4=|v_main_#t~post4_1850|, main_#t~post5=|v_main_#t~post5_258|, main_~y~0=v_main_~y~0_315, main_~z~0=v_main_~z~0_3390} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {27519#(= main_~y~0 0)} is VALID [2022-04-15 06:59:09,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {27519#(= main_~y~0 0)} [176] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {27515#false} is VALID [2022-04-15 06:59:09,348 INFO L272 TraceCheckUtils]: 9: Hoare triple {27515#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {27515#false} is VALID [2022-04-15 06:59:09,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {27515#false} ~cond := #in~cond; {27515#false} is VALID [2022-04-15 06:59:09,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {27515#false} assume 0 == ~cond; {27515#false} is VALID [2022-04-15 06:59:09,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {27515#false} assume !false; {27515#false} is VALID [2022-04-15 06:59:09,349 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 06:59:09,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:09,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970799755] [2022-04-15 06:59:09,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970799755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:09,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:09,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:59:10,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:10,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [418561139] [2022-04-15 06:59:10,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [418561139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:10,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:10,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 06:59:10,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953955551] [2022-04-15 06:59:10,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:10,910 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 56 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 72 [2022-04-15 06:59:10,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:10,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 56 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:10,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:10,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 06:59:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:10,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 06:59:10,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3028, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:59:10,951 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 57 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 56 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:16,978 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2022-04-15 06:59:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 06:59:16,978 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 56 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 72 [2022-04-15 06:59:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 56 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 104 transitions. [2022-04-15 06:59:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 56 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 104 transitions. [2022-04-15 06:59:16,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 104 transitions. [2022-04-15 06:59:17,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:17,050 INFO L225 Difference]: With dead ends: 155 [2022-04-15 06:59:17,050 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 06:59:17,051 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=486, Invalid=11724, Unknown=0, NotChecked=0, Total=12210 [2022-04-15 06:59:17,051 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 3439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:17,051 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 106 Invalid, 3439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 06:59:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 06:59:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2022-04-15 06:59:17,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:17,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 79 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:17,230 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 79 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:17,230 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 79 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:17,230 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-04-15 06:59:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-04-15 06:59:17,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:17,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:17,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 84 states. [2022-04-15 06:59:17,231 INFO L87 Difference]: Start difference. First operand has 79 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 84 states. [2022-04-15 06:59:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:17,232 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-04-15 06:59:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-04-15 06:59:17,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:17,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:17,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:17,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-04-15 06:59:17,233 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 72 [2022-04-15 06:59:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:17,233 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-04-15 06:59:17,234 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 56 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:17,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 82 transitions. [2022-04-15 06:59:17,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-04-15 06:59:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 06:59:17,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:17,522 INFO L499 BasicCegarLoop]: trace histogram [53, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:17,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-04-15 06:59:17,522 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:17,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1312738814, now seen corresponding path program 53 times [2022-04-15 06:59:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:17,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1309458606] [2022-04-15 06:59:18,265 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:18,776 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:18,776 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 63226680, now seen corresponding path program 1 times [2022-04-15 06:59:18,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:18,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757098300] [2022-04-15 06:59:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:18,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:18,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:18,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {28327#(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(12, 2);call #Ultimate.allocInit(12, 3); {28321#true} is VALID [2022-04-15 06:59:18,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-04-15 06:59:18,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28321#true} {28321#true} #63#return; {28321#true} is VALID [2022-04-15 06:59:18,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {28321#true} call ULTIMATE.init(); {28327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:18,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {28327#(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(12, 2);call #Ultimate.allocInit(12, 3); {28321#true} is VALID [2022-04-15 06:59:18,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-04-15 06:59:18,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28321#true} {28321#true} #63#return; {28321#true} is VALID [2022-04-15 06:59:18,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {28321#true} call #t~ret7 := main(); {28321#true} is VALID [2022-04-15 06:59:18,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {28321#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {28321#true} is VALID [2022-04-15 06:59:18,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {28321#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {28326#(= main_~y~0 0)} is VALID [2022-04-15 06:59:18,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {28326#(= main_~y~0 0)} [179] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_3562 v_main_~z~0_3508) (= |v_main_#t~post5_264| |v_main_#t~post5_263|) (= v_main_~y~0_322 v_main_~y~0_321) (= |v_main_#t~post4_1965| |v_main_#t~post4_1912|)) InVars {main_#t~post4=|v_main_#t~post4_1965|, main_~y~0=v_main_~y~0_322, main_#t~post5=|v_main_#t~post5_264|, main_~z~0=v_main_~z~0_3562} OutVars{main_#t~post4=|v_main_#t~post4_1912|, main_#t~post5=|v_main_#t~post5_263|, main_~y~0=v_main_~y~0_321, main_~z~0=v_main_~z~0_3508} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {28326#(= main_~y~0 0)} is VALID [2022-04-15 06:59:18,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {28326#(= main_~y~0 0)} [178] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {28322#false} is VALID [2022-04-15 06:59:18,822 INFO L272 TraceCheckUtils]: 9: Hoare triple {28322#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {28322#false} is VALID [2022-04-15 06:59:18,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {28322#false} ~cond := #in~cond; {28322#false} is VALID [2022-04-15 06:59:18,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {28322#false} assume 0 == ~cond; {28322#false} is VALID [2022-04-15 06:59:18,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {28322#false} assume !false; {28322#false} is VALID [2022-04-15 06:59:18,823 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 06:59:18,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:18,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757098300] [2022-04-15 06:59:18,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757098300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:18,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:18,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:59:20,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:20,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1309458606] [2022-04-15 06:59:20,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1309458606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:20,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:20,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 06:59:20,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36605301] [2022-04-15 06:59:20,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:20,302 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 57 states have internal predecessors, (66), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2022-04-15 06:59:20,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:20,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 57 states have internal predecessors, (66), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:20,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:20,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 06:59:20,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 06:59:20,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3139, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:59:20,345 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 58 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 57 states have internal predecessors, (66), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:26,968 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2022-04-15 06:59:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 06:59:26,968 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 57 states have internal predecessors, (66), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2022-04-15 06:59:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 57 states have internal predecessors, (66), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2022-04-15 06:59:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 57 states have internal predecessors, (66), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2022-04-15 06:59:26,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 105 transitions. [2022-04-15 06:59:27,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:27,043 INFO L225 Difference]: With dead ends: 157 [2022-04-15 06:59:27,043 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 06:59:27,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=495, Invalid=12161, Unknown=0, NotChecked=0, Total=12656 [2022-04-15 06:59:27,044 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 3684 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:27,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 196 Invalid, 3805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3684 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 06:59:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 06:59:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2022-04-15 06:59:27,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:27,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 80 states, 71 states have (on average 1.056338028169014) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:27,221 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 80 states, 71 states have (on average 1.056338028169014) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:27,221 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 80 states, 71 states have (on average 1.056338028169014) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:27,222 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2022-04-15 06:59:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2022-04-15 06:59:27,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:27,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:27,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 71 states have (on average 1.056338028169014) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 85 states. [2022-04-15 06:59:27,223 INFO L87 Difference]: Start difference. First operand has 80 states, 71 states have (on average 1.056338028169014) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 85 states. [2022-04-15 06:59:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:27,224 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2022-04-15 06:59:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2022-04-15 06:59:27,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:27,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:27,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:27,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.056338028169014) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-15 06:59:27,225 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 73 [2022-04-15 06:59:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:27,225 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-15 06:59:27,226 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 57 states have internal predecessors, (66), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:27,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 83 transitions. [2022-04-15 06:59:27,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-15 06:59:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 06:59:27,507 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:27,507 INFO L499 BasicCegarLoop]: trace histogram [54, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:27,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-04-15 06:59:27,507 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1087914974, now seen corresponding path program 54 times [2022-04-15 06:59:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:27,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1937676088] [2022-04-15 06:59:27,891 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:28,351 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:28,351 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash 122332024, now seen corresponding path program 1 times [2022-04-15 06:59:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:28,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81962292] [2022-04-15 06:59:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:28,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {29145#(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(12, 2);call #Ultimate.allocInit(12, 3); {29139#true} is VALID [2022-04-15 06:59:28,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {29139#true} assume true; {29139#true} is VALID [2022-04-15 06:59:28,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29139#true} {29139#true} #63#return; {29139#true} is VALID [2022-04-15 06:59:28,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {29139#true} call ULTIMATE.init(); {29145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:28,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {29145#(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(12, 2);call #Ultimate.allocInit(12, 3); {29139#true} is VALID [2022-04-15 06:59:28,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {29139#true} assume true; {29139#true} is VALID [2022-04-15 06:59:28,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29139#true} {29139#true} #63#return; {29139#true} is VALID [2022-04-15 06:59:28,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {29139#true} call #t~ret7 := main(); {29139#true} is VALID [2022-04-15 06:59:28,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {29139#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {29139#true} is VALID [2022-04-15 06:59:28,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {29139#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {29144#(= main_~y~0 0)} is VALID [2022-04-15 06:59:28,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {29144#(= main_~y~0 0)} [181] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_328 v_main_~y~0_327)) (.cse1 (= |v_main_#t~post5_269| |v_main_#t~post5_268|)) (.cse2 (= v_main_~z~0_3683 v_main_~z~0_3628))) (or (and .cse0 (= |v_main_#t~post4_1975| |v_main_#t~post4_2029|) .cse1 .cse2) (and .cse0 (= |v_main_#t~post4_2029| |v_main_#t~post4_1975|) .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_2029|, main_~y~0=v_main_~y~0_328, main_#t~post5=|v_main_#t~post5_269|, main_~z~0=v_main_~z~0_3683} OutVars{main_#t~post4=|v_main_#t~post4_1975|, main_#t~post5=|v_main_#t~post5_268|, main_~y~0=v_main_~y~0_327, main_~z~0=v_main_~z~0_3628} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {29144#(= main_~y~0 0)} is VALID [2022-04-15 06:59:28,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {29144#(= main_~y~0 0)} [180] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {29140#false} is VALID [2022-04-15 06:59:28,398 INFO L272 TraceCheckUtils]: 9: Hoare triple {29140#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {29140#false} is VALID [2022-04-15 06:59:28,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {29140#false} ~cond := #in~cond; {29140#false} is VALID [2022-04-15 06:59:28,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {29140#false} assume 0 == ~cond; {29140#false} is VALID [2022-04-15 06:59:28,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {29140#false} assume !false; {29140#false} is VALID [2022-04-15 06:59:28,399 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 06:59:28,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:28,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81962292] [2022-04-15 06:59:28,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81962292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:28,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:28,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:59:29,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:29,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1937676088] [2022-04-15 06:59:29,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1937676088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:29,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:29,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 06:59:29,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633327659] [2022-04-15 06:59:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:29,922 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2022-04-15 06:59:29,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:29,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:29,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:29,962 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 06:59:29,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:29,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 06:59:29,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3252, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 06:59:29,963 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 59 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:36,764 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2022-04-15 06:59:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 06:59:36,764 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2022-04-15 06:59:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2022-04-15 06:59:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2022-04-15 06:59:36,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 106 transitions. [2022-04-15 06:59:36,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:36,858 INFO L225 Difference]: With dead ends: 159 [2022-04-15 06:59:36,858 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 06:59:36,859 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=504, Invalid=12606, Unknown=0, NotChecked=0, Total=13110 [2022-04-15 06:59:36,859 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3700 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:36,859 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 161 Invalid, 3823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3700 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 06:59:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 06:59:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2022-04-15 06:59:37,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:37,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 81 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 73 states have internal predecessors, (76), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:37,088 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 81 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 73 states have internal predecessors, (76), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:37,088 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 81 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 73 states have internal predecessors, (76), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:37,089 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-15 06:59:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-15 06:59:37,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:37,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:37,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 73 states have internal predecessors, (76), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 86 states. [2022-04-15 06:59:37,090 INFO L87 Difference]: Start difference. First operand has 81 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 73 states have internal predecessors, (76), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 86 states. [2022-04-15 06:59:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:37,116 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-15 06:59:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-15 06:59:37,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:37,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:37,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:37,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 73 states have internal predecessors, (76), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-04-15 06:59:37,117 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 74 [2022-04-15 06:59:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:37,118 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-04-15 06:59:37,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:37,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 84 transitions. [2022-04-15 06:59:37,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-15 06:59:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 06:59:37,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:37,477 INFO L499 BasicCegarLoop]: trace histogram [55, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:37,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-04-15 06:59:37,477 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:37,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:37,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1586656770, now seen corresponding path program 55 times [2022-04-15 06:59:37,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:37,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [746946418] [2022-04-15 06:59:39,306 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:59:39,473 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:39,924 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:39,924 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash 181437368, now seen corresponding path program 1 times [2022-04-15 06:59:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:39,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968884202] [2022-04-15 06:59:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:39,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:39,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:39,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {29974#(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(12, 2);call #Ultimate.allocInit(12, 3); {29968#true} is VALID [2022-04-15 06:59:39,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {29968#true} assume true; {29968#true} is VALID [2022-04-15 06:59:39,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29968#true} {29968#true} #63#return; {29968#true} is VALID [2022-04-15 06:59:39,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {29968#true} call ULTIMATE.init(); {29974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:39,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {29974#(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(12, 2);call #Ultimate.allocInit(12, 3); {29968#true} is VALID [2022-04-15 06:59:39,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {29968#true} assume true; {29968#true} is VALID [2022-04-15 06:59:39,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29968#true} {29968#true} #63#return; {29968#true} is VALID [2022-04-15 06:59:39,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {29968#true} call #t~ret7 := main(); {29968#true} is VALID [2022-04-15 06:59:39,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {29968#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {29968#true} is VALID [2022-04-15 06:59:39,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {29968#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {29973#(= main_~y~0 0)} is VALID [2022-04-15 06:59:39,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {29973#(= main_~y~0 0)} [183] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_3806 v_main_~z~0_3750) (= |v_main_#t~post5_274| |v_main_#t~post5_273|) (= v_main_~y~0_334 v_main_~y~0_333) (= |v_main_#t~post4_2094| |v_main_#t~post4_2039|)) InVars {main_#t~post4=|v_main_#t~post4_2094|, main_~y~0=v_main_~y~0_334, main_#t~post5=|v_main_#t~post5_274|, main_~z~0=v_main_~z~0_3806} OutVars{main_#t~post4=|v_main_#t~post4_2039|, main_#t~post5=|v_main_#t~post5_273|, main_~y~0=v_main_~y~0_333, main_~z~0=v_main_~z~0_3750} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {29973#(= main_~y~0 0)} is VALID [2022-04-15 06:59:39,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {29973#(= main_~y~0 0)} [182] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {29969#false} is VALID [2022-04-15 06:59:39,972 INFO L272 TraceCheckUtils]: 9: Hoare triple {29969#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {29969#false} is VALID [2022-04-15 06:59:39,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {29969#false} ~cond := #in~cond; {29969#false} is VALID [2022-04-15 06:59:39,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {29969#false} assume 0 == ~cond; {29969#false} is VALID [2022-04-15 06:59:39,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {29969#false} assume !false; {29969#false} is VALID [2022-04-15 06:59:39,973 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 06:59:39,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:39,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968884202] [2022-04-15 06:59:39,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968884202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:39,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:39,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:59:41,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:41,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [746946418] [2022-04-15 06:59:41,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [746946418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:41,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:41,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 06:59:41,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884582356] [2022-04-15 06:59:41,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:41,659 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 59 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 75 [2022-04-15 06:59:41,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:41,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 59 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:41,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:41,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 06:59:41,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:41,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 06:59:41,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3367, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:59:41,703 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 60 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 59 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:48,749 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2022-04-15 06:59:48,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 06:59:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 59 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 75 [2022-04-15 06:59:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 59 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 107 transitions. [2022-04-15 06:59:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 59 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 107 transitions. [2022-04-15 06:59:48,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 107 transitions. [2022-04-15 06:59:48,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:48,825 INFO L225 Difference]: With dead ends: 161 [2022-04-15 06:59:48,825 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 06:59:48,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=513, Invalid=13059, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 06:59:48,826 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 3774 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 3899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 3774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:48,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 146 Invalid, 3899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 3774 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 06:59:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 06:59:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2022-04-15 06:59:49,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:49,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 82 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 74 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:49,015 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 82 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 74 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:49,015 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 82 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 74 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:49,016 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-04-15 06:59:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2022-04-15 06:59:49,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:49,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:49,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 74 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 87 states. [2022-04-15 06:59:49,016 INFO L87 Difference]: Start difference. First operand has 82 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 74 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 87 states. [2022-04-15 06:59:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:49,017 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-04-15 06:59:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2022-04-15 06:59:49,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:49,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:49,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:49,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 74 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:59:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2022-04-15 06:59:49,019 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 75 [2022-04-15 06:59:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:49,019 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2022-04-15 06:59:49,019 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 59 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:49,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 85 transitions. [2022-04-15 06:59:49,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-04-15 06:59:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 06:59:49,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:49,368 INFO L499 BasicCegarLoop]: trace histogram [56, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:49,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-04-15 06:59:49,368 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:49,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:49,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1400965086, now seen corresponding path program 56 times [2022-04-15 06:59:49,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:49,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [222768804] [2022-04-15 06:59:51,653 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:59:51,849 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:52,426 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:52,426 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash 240542712, now seen corresponding path program 1 times [2022-04-15 06:59:52,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:52,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605904873] [2022-04-15 06:59:52,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:52,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {30814#(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(12, 2);call #Ultimate.allocInit(12, 3); {30808#true} is VALID [2022-04-15 06:59:52,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {30808#true} assume true; {30808#true} is VALID [2022-04-15 06:59:52,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30808#true} {30808#true} #63#return; {30808#true} is VALID [2022-04-15 06:59:52,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {30808#true} call ULTIMATE.init(); {30814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:52,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {30814#(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(12, 2);call #Ultimate.allocInit(12, 3); {30808#true} is VALID [2022-04-15 06:59:52,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {30808#true} assume true; {30808#true} is VALID [2022-04-15 06:59:52,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30808#true} {30808#true} #63#return; {30808#true} is VALID [2022-04-15 06:59:52,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {30808#true} call #t~ret7 := main(); {30808#true} is VALID [2022-04-15 06:59:52,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {30808#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {30808#true} is VALID [2022-04-15 06:59:52,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {30808#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {30813#(= main_~y~0 0)} is VALID [2022-04-15 06:59:52,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {30813#(= main_~y~0 0)} [185] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~z~0_3931 v_main_~z~0_3874)) (.cse1 (= |v_main_#t~post5_279| |v_main_#t~post5_278|)) (.cse2 (= |v_main_#t~post4_2160| |v_main_#t~post4_2104|))) (or (and .cse0 .cse1 (= v_main_~y~0_339 v_main_~y~0_340) .cse2) (and .cse0 .cse1 (= v_main_~y~0_340 v_main_~y~0_339) .cse2))) InVars {main_#t~post4=|v_main_#t~post4_2160|, main_~y~0=v_main_~y~0_340, main_#t~post5=|v_main_#t~post5_279|, main_~z~0=v_main_~z~0_3931} OutVars{main_#t~post4=|v_main_#t~post4_2104|, main_#t~post5=|v_main_#t~post5_278|, main_~y~0=v_main_~y~0_339, main_~z~0=v_main_~z~0_3874} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {30813#(= main_~y~0 0)} is VALID [2022-04-15 06:59:52,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {30813#(= main_~y~0 0)} [184] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {30809#false} is VALID [2022-04-15 06:59:52,462 INFO L272 TraceCheckUtils]: 9: Hoare triple {30809#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {30809#false} is VALID [2022-04-15 06:59:52,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {30809#false} ~cond := #in~cond; {30809#false} is VALID [2022-04-15 06:59:52,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {30809#false} assume 0 == ~cond; {30809#false} is VALID [2022-04-15 06:59:52,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {30809#false} assume !false; {30809#false} is VALID [2022-04-15 06:59:52,462 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 06:59:52,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:52,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605904873] [2022-04-15 06:59:52,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605904873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:52,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:52,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:59:54,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:54,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [222768804] [2022-04-15 06:59:54,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [222768804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:54,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:54,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-15 06:59:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691040542] [2022-04-15 06:59:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:54,086 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 60 states have internal predecessors, (69), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2022-04-15 06:59:54,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:54,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 60 states have internal predecessors, (69), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:59:54,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:54,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-15 06:59:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:54,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-15 06:59:54,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3484, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 06:59:54,129 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 61 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 60 states have internal predecessors, (69), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:00,653 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2022-04-15 07:00:00,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 07:00:00,653 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 60 states have internal predecessors, (69), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2022-04-15 07:00:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 60 states have internal predecessors, (69), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 108 transitions. [2022-04-15 07:00:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 60 states have internal predecessors, (69), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 108 transitions. [2022-04-15 07:00:00,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 108 transitions. [2022-04-15 07:00:00,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:00,734 INFO L225 Difference]: With dead ends: 163 [2022-04-15 07:00:00,734 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 07:00:00,735 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=522, Invalid=13520, Unknown=0, NotChecked=0, Total=14042 [2022-04-15 07:00:00,735 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3584 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 3584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:00,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 3711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 3584 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 07:00:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 07:00:00,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2022-04-15 07:00:00,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:00,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 83 states, 74 states have (on average 1.054054054054054) internal successors, (78), 75 states have internal predecessors, (78), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:00,942 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 83 states, 74 states have (on average 1.054054054054054) internal successors, (78), 75 states have internal predecessors, (78), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:00,942 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 83 states, 74 states have (on average 1.054054054054054) internal successors, (78), 75 states have internal predecessors, (78), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:00,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:00,943 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-15 07:00:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-04-15 07:00:00,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:00,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:00,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 74 states have (on average 1.054054054054054) internal successors, (78), 75 states have internal predecessors, (78), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 88 states. [2022-04-15 07:00:00,943 INFO L87 Difference]: Start difference. First operand has 83 states, 74 states have (on average 1.054054054054054) internal successors, (78), 75 states have internal predecessors, (78), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 88 states. [2022-04-15 07:00:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:00,944 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-15 07:00:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-04-15 07:00:00,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:00,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:00,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:00,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.054054054054054) internal successors, (78), 75 states have internal predecessors, (78), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-04-15 07:00:00,945 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 76 [2022-04-15 07:00:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:00,945 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-04-15 07:00:00,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 60 states have internal predecessors, (69), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:00,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 86 transitions. [2022-04-15 07:00:01,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-04-15 07:00:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 07:00:01,250 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:01,250 INFO L499 BasicCegarLoop]: trace histogram [57, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:01,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-04-15 07:00:01,250 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash 472037890, now seen corresponding path program 57 times [2022-04-15 07:00:01,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:01,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [729485838] [2022-04-15 07:00:01,622 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:02,126 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:02,126 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash 299648056, now seen corresponding path program 1 times [2022-04-15 07:00:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:02,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102038414] [2022-04-15 07:00:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:02,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:02,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {31665#(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(12, 2);call #Ultimate.allocInit(12, 3); {31659#true} is VALID [2022-04-15 07:00:02,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {31659#true} assume true; {31659#true} is VALID [2022-04-15 07:00:02,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31659#true} {31659#true} #63#return; {31659#true} is VALID [2022-04-15 07:00:02,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {31659#true} call ULTIMATE.init(); {31665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:02,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {31665#(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(12, 2);call #Ultimate.allocInit(12, 3); {31659#true} is VALID [2022-04-15 07:00:02,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {31659#true} assume true; {31659#true} is VALID [2022-04-15 07:00:02,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31659#true} {31659#true} #63#return; {31659#true} is VALID [2022-04-15 07:00:02,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {31659#true} call #t~ret7 := main(); {31659#true} is VALID [2022-04-15 07:00:02,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {31659#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {31659#true} is VALID [2022-04-15 07:00:02,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {31659#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {31664#(= main_~y~0 0)} is VALID [2022-04-15 07:00:02,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {31664#(= main_~y~0 0)} [187] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~z~0_4058 v_main_~z~0_4000)) (.cse1 (= |v_main_#t~post4_2227| |v_main_#t~post4_2170|)) (.cse2 (= |v_main_#t~post5_284| |v_main_#t~post5_283|))) (or (and .cse0 .cse1 (= v_main_~y~0_345 v_main_~y~0_346) .cse2) (and .cse0 (= v_main_~y~0_346 v_main_~y~0_345) .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_2227|, main_~y~0=v_main_~y~0_346, main_#t~post5=|v_main_#t~post5_284|, main_~z~0=v_main_~z~0_4058} OutVars{main_#t~post4=|v_main_#t~post4_2170|, main_#t~post5=|v_main_#t~post5_283|, main_~y~0=v_main_~y~0_345, main_~z~0=v_main_~z~0_4000} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {31664#(= main_~y~0 0)} is VALID [2022-04-15 07:00:02,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {31664#(= main_~y~0 0)} [186] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {31660#false} is VALID [2022-04-15 07:00:02,196 INFO L272 TraceCheckUtils]: 9: Hoare triple {31660#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {31660#false} is VALID [2022-04-15 07:00:02,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {31660#false} ~cond := #in~cond; {31660#false} is VALID [2022-04-15 07:00:02,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {31660#false} assume 0 == ~cond; {31660#false} is VALID [2022-04-15 07:00:02,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {31660#false} assume !false; {31660#false} is VALID [2022-04-15 07:00:02,196 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 07:00:02,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:02,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102038414] [2022-04-15 07:00:02,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102038414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:02,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:02,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:00:03,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:03,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [729485838] [2022-04-15 07:00:03,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [729485838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:03,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:03,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 07:00:03,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21487934] [2022-04-15 07:00:03,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:03,895 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 77 [2022-04-15 07:00:03,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:03,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:03,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:03,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 07:00:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:03,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 07:00:03,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3603, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 07:00:03,946 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 62 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:10,707 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2022-04-15 07:00:10,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 07:00:10,707 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 77 [2022-04-15 07:00:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2022-04-15 07:00:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2022-04-15 07:00:10,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 109 transitions. [2022-04-15 07:00:10,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:10,783 INFO L225 Difference]: With dead ends: 165 [2022-04-15 07:00:10,783 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 07:00:10,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=531, Invalid=13989, Unknown=0, NotChecked=0, Total=14520 [2022-04-15 07:00:10,784 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:10,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 3847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 07:00:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 07:00:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-04-15 07:00:10,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:10,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 84 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 76 states have internal predecessors, (79), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:10,985 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 84 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 76 states have internal predecessors, (79), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:10,985 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 84 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 76 states have internal predecessors, (79), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:10,986 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-04-15 07:00:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-04-15 07:00:10,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:10,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:10,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 76 states have internal predecessors, (79), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 89 states. [2022-04-15 07:00:10,986 INFO L87 Difference]: Start difference. First operand has 84 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 76 states have internal predecessors, (79), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 89 states. [2022-04-15 07:00:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:10,987 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-04-15 07:00:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-04-15 07:00:10,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:10,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:10,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:10,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 76 states have internal predecessors, (79), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2022-04-15 07:00:10,989 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 77 [2022-04-15 07:00:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:10,989 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2022-04-15 07:00:10,989 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:10,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 87 transitions. [2022-04-15 07:00:11,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2022-04-15 07:00:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 07:00:11,320 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:11,320 INFO L499 BasicCegarLoop]: trace histogram [58, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:11,320 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-04-15 07:00:11,320 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:11,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:11,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1594411998, now seen corresponding path program 58 times [2022-04-15 07:00:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:11,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1380651140] [2022-04-15 07:00:13,329 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:00:13,484 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:13,984 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:13,984 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:13,985 INFO L85 PathProgramCache]: Analyzing trace with hash 358753400, now seen corresponding path program 1 times [2022-04-15 07:00:13,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:13,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851846709] [2022-04-15 07:00:13,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:13,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:14,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {32527#(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(12, 2);call #Ultimate.allocInit(12, 3); {32521#true} is VALID [2022-04-15 07:00:14,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {32521#true} assume true; {32521#true} is VALID [2022-04-15 07:00:14,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32521#true} {32521#true} #63#return; {32521#true} is VALID [2022-04-15 07:00:14,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {32521#true} call ULTIMATE.init(); {32527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:14,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {32527#(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(12, 2);call #Ultimate.allocInit(12, 3); {32521#true} is VALID [2022-04-15 07:00:14,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {32521#true} assume true; {32521#true} is VALID [2022-04-15 07:00:14,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32521#true} {32521#true} #63#return; {32521#true} is VALID [2022-04-15 07:00:14,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {32521#true} call #t~ret7 := main(); {32521#true} is VALID [2022-04-15 07:00:14,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {32521#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {32521#true} is VALID [2022-04-15 07:00:14,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {32521#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {32526#(= main_~y~0 0)} is VALID [2022-04-15 07:00:14,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {32526#(= main_~y~0 0)} [189] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_352 v_main_~y~0_351) (= v_main_~z~0_4187 v_main_~z~0_4128) (= |v_main_#t~post4_2295| |v_main_#t~post4_2237|) (= |v_main_#t~post5_289| |v_main_#t~post5_288|)) InVars {main_#t~post4=|v_main_#t~post4_2295|, main_~y~0=v_main_~y~0_352, main_#t~post5=|v_main_#t~post5_289|, main_~z~0=v_main_~z~0_4187} OutVars{main_#t~post4=|v_main_#t~post4_2237|, main_#t~post5=|v_main_#t~post5_288|, main_~y~0=v_main_~y~0_351, main_~z~0=v_main_~z~0_4128} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {32526#(= main_~y~0 0)} is VALID [2022-04-15 07:00:14,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {32526#(= main_~y~0 0)} [188] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {32522#false} is VALID [2022-04-15 07:00:14,032 INFO L272 TraceCheckUtils]: 9: Hoare triple {32522#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {32522#false} is VALID [2022-04-15 07:00:14,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {32522#false} ~cond := #in~cond; {32522#false} is VALID [2022-04-15 07:00:14,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {32522#false} assume 0 == ~cond; {32522#false} is VALID [2022-04-15 07:00:14,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {32522#false} assume !false; {32522#false} is VALID [2022-04-15 07:00:14,032 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 07:00:14,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:14,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851846709] [2022-04-15 07:00:14,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851846709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:14,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:14,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:00:15,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:15,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1380651140] [2022-04-15 07:00:15,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1380651140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:15,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:15,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 07:00:15,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641355070] [2022-04-15 07:00:15,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:15,760 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.126984126984127) internal successors, (71), 62 states have internal predecessors, (71), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 78 [2022-04-15 07:00:15,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:15,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 1.126984126984127) internal successors, (71), 62 states have internal predecessors, (71), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:15,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:15,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 07:00:15,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:15,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 07:00:15,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3724, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 07:00:15,804 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 63 states, 63 states have (on average 1.126984126984127) internal successors, (71), 62 states have internal predecessors, (71), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:23,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:23,202 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2022-04-15 07:00:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 07:00:23,202 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.126984126984127) internal successors, (71), 62 states have internal predecessors, (71), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 78 [2022-04-15 07:00:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.126984126984127) internal successors, (71), 62 states have internal predecessors, (71), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2022-04-15 07:00:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.126984126984127) internal successors, (71), 62 states have internal predecessors, (71), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2022-04-15 07:00:23,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 110 transitions. [2022-04-15 07:00:23,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:23,286 INFO L225 Difference]: With dead ends: 167 [2022-04-15 07:00:23,286 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 07:00:23,287 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=540, Invalid=14466, Unknown=0, NotChecked=0, Total=15006 [2022-04-15 07:00:23,287 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4106 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 4237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 4106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:23,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 136 Invalid, 4237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 4106 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 07:00:23,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 07:00:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-04-15 07:00:23,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:23,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 85 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 77 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:23,482 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 85 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 77 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:23,482 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 85 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 77 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:23,483 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-15 07:00:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-15 07:00:23,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:23,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:23,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 77 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 90 states. [2022-04-15 07:00:23,483 INFO L87 Difference]: Start difference. First operand has 85 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 77 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 90 states. [2022-04-15 07:00:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:23,484 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-15 07:00:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-15 07:00:23,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:23,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:23,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:23,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 77 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-04-15 07:00:23,485 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 78 [2022-04-15 07:00:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:23,485 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-04-15 07:00:23,485 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.126984126984127) internal successors, (71), 62 states have internal predecessors, (71), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:23,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 88 transitions. [2022-04-15 07:00:23,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-15 07:00:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 07:00:23,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:23,810 INFO L499 BasicCegarLoop]: trace histogram [59, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:23,810 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-04-15 07:00:23,810 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1229849086, now seen corresponding path program 59 times [2022-04-15 07:00:23,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:23,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [276079471] [2022-04-15 07:00:25,884 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:00:26,049 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:26,664 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:26,665 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:26,665 INFO L85 PathProgramCache]: Analyzing trace with hash 417858744, now seen corresponding path program 1 times [2022-04-15 07:00:26,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:26,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276581993] [2022-04-15 07:00:26,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:26,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:26,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {33400#(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(12, 2);call #Ultimate.allocInit(12, 3); {33394#true} is VALID [2022-04-15 07:00:26,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {33394#true} assume true; {33394#true} is VALID [2022-04-15 07:00:26,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33394#true} {33394#true} #63#return; {33394#true} is VALID [2022-04-15 07:00:26,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {33394#true} call ULTIMATE.init(); {33400#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:26,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {33400#(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(12, 2);call #Ultimate.allocInit(12, 3); {33394#true} is VALID [2022-04-15 07:00:26,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {33394#true} assume true; {33394#true} is VALID [2022-04-15 07:00:26,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33394#true} {33394#true} #63#return; {33394#true} is VALID [2022-04-15 07:00:26,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {33394#true} call #t~ret7 := main(); {33394#true} is VALID [2022-04-15 07:00:26,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {33394#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {33394#true} is VALID [2022-04-15 07:00:26,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {33394#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {33399#(= main_~y~0 0)} is VALID [2022-04-15 07:00:26,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {33399#(= main_~y~0 0)} [191] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post5_294| |v_main_#t~post5_293|) (= |v_main_#t~post4_2364| |v_main_#t~post4_2305|) (= v_main_~z~0_4318 v_main_~z~0_4258) (= v_main_~y~0_358 v_main_~y~0_357)) InVars {main_#t~post4=|v_main_#t~post4_2364|, main_~y~0=v_main_~y~0_358, main_#t~post5=|v_main_#t~post5_294|, main_~z~0=v_main_~z~0_4318} OutVars{main_#t~post4=|v_main_#t~post4_2305|, main_#t~post5=|v_main_#t~post5_293|, main_~y~0=v_main_~y~0_357, main_~z~0=v_main_~z~0_4258} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {33399#(= main_~y~0 0)} is VALID [2022-04-15 07:00:26,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {33399#(= main_~y~0 0)} [190] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {33395#false} is VALID [2022-04-15 07:00:26,699 INFO L272 TraceCheckUtils]: 9: Hoare triple {33395#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {33395#false} is VALID [2022-04-15 07:00:26,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {33395#false} ~cond := #in~cond; {33395#false} is VALID [2022-04-15 07:00:26,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {33395#false} assume 0 == ~cond; {33395#false} is VALID [2022-04-15 07:00:26,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {33395#false} assume !false; {33395#false} is VALID [2022-04-15 07:00:26,699 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 07:00:26,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:26,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276581993] [2022-04-15 07:00:26,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276581993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:26,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:26,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:00:28,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:28,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [276079471] [2022-04-15 07:00:28,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [276079471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:28,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:28,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 07:00:28,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105335006] [2022-04-15 07:00:28,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:28,430 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.125) internal successors, (72), 63 states have internal predecessors, (72), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2022-04-15 07:00:28,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:28,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 1.125) internal successors, (72), 63 states have internal predecessors, (72), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:28,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:28,472 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 07:00:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:28,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 07:00:28,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3847, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 07:00:28,474 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 64 states, 64 states have (on average 1.125) internal successors, (72), 63 states have internal predecessors, (72), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:36,666 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2022-04-15 07:00:36,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 07:00:36,666 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.125) internal successors, (72), 63 states have internal predecessors, (72), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2022-04-15 07:00:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.125) internal successors, (72), 63 states have internal predecessors, (72), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 111 transitions. [2022-04-15 07:00:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.125) internal successors, (72), 63 states have internal predecessors, (72), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 111 transitions. [2022-04-15 07:00:36,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 111 transitions. [2022-04-15 07:00:36,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:36,750 INFO L225 Difference]: With dead ends: 169 [2022-04-15 07:00:36,750 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 07:00:36,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=549, Invalid=14951, Unknown=0, NotChecked=0, Total=15500 [2022-04-15 07:00:36,752 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 4595 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 4727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 4595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:36,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 266 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 4595 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 07:00:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 07:00:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-04-15 07:00:36,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:36,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 86 states, 77 states have (on average 1.051948051948052) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:36,964 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 86 states, 77 states have (on average 1.051948051948052) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:36,964 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 86 states, 77 states have (on average 1.051948051948052) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:36,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:36,965 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-04-15 07:00:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2022-04-15 07:00:36,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:36,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:36,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 77 states have (on average 1.051948051948052) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 91 states. [2022-04-15 07:00:36,966 INFO L87 Difference]: Start difference. First operand has 86 states, 77 states have (on average 1.051948051948052) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 91 states. [2022-04-15 07:00:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:36,967 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-04-15 07:00:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2022-04-15 07:00:36,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:36,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:36,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:36,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.051948051948052) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-15 07:00:36,968 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 79 [2022-04-15 07:00:36,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:36,968 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-15 07:00:36,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.125) internal successors, (72), 63 states have internal predecessors, (72), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:36,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-15 07:00:37,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-15 07:00:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 07:00:37,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:37,329 INFO L499 BasicCegarLoop]: trace histogram [60, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:37,329 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-04-15 07:00:37,329 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:37,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1481666594, now seen corresponding path program 60 times [2022-04-15 07:00:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:37,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1007629725] [2022-04-15 07:00:40,262 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:00:40,412 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:40,924 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:40,924 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash 476964088, now seen corresponding path program 1 times [2022-04-15 07:00:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:40,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64129121] [2022-04-15 07:00:40,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:40,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:40,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:40,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {34284#(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(12, 2);call #Ultimate.allocInit(12, 3); {34278#true} is VALID [2022-04-15 07:00:40,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {34278#true} assume true; {34278#true} is VALID [2022-04-15 07:00:40,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34278#true} {34278#true} #63#return; {34278#true} is VALID [2022-04-15 07:00:40,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {34278#true} call ULTIMATE.init(); {34284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:40,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {34284#(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(12, 2);call #Ultimate.allocInit(12, 3); {34278#true} is VALID [2022-04-15 07:00:40,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {34278#true} assume true; {34278#true} is VALID [2022-04-15 07:00:40,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34278#true} {34278#true} #63#return; {34278#true} is VALID [2022-04-15 07:00:40,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {34278#true} call #t~ret7 := main(); {34278#true} is VALID [2022-04-15 07:00:40,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {34278#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {34278#true} is VALID [2022-04-15 07:00:40,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {34278#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {34283#(= main_~y~0 0)} is VALID [2022-04-15 07:00:40,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {34283#(= main_~y~0 0)} [193] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~z~0_4451 v_main_~z~0_4390)) (.cse1 (= v_main_~y~0_364 v_main_~y~0_363)) (.cse2 (= |v_main_#t~post5_299| |v_main_#t~post5_298|))) (or (and .cse0 (= |v_main_#t~post4_2374| |v_main_#t~post4_2434|) .cse1 .cse2) (and (= |v_main_#t~post4_2434| |v_main_#t~post4_2374|) .cse0 .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_2434|, main_~y~0=v_main_~y~0_364, main_#t~post5=|v_main_#t~post5_299|, main_~z~0=v_main_~z~0_4451} OutVars{main_#t~post4=|v_main_#t~post4_2374|, main_#t~post5=|v_main_#t~post5_298|, main_~y~0=v_main_~y~0_363, main_~z~0=v_main_~z~0_4390} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {34283#(= main_~y~0 0)} is VALID [2022-04-15 07:00:40,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {34283#(= main_~y~0 0)} [192] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {34279#false} is VALID [2022-04-15 07:00:40,963 INFO L272 TraceCheckUtils]: 9: Hoare triple {34279#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {34279#false} is VALID [2022-04-15 07:00:40,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {34279#false} ~cond := #in~cond; {34279#false} is VALID [2022-04-15 07:00:40,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {34279#false} assume 0 == ~cond; {34279#false} is VALID [2022-04-15 07:00:40,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {34279#false} assume !false; {34279#false} is VALID [2022-04-15 07:00:40,963 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 07:00:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:40,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64129121] [2022-04-15 07:00:40,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64129121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:40,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:40,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:00:42,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:42,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1007629725] [2022-04-15 07:00:42,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1007629725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:42,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:42,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-15 07:00:42,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616149309] [2022-04-15 07:00:42,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 80 [2022-04-15 07:00:42,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:42,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:42,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:42,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-15 07:00:42,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:42,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-15 07:00:42,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3972, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 07:00:42,854 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:50,679 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions. [2022-04-15 07:00:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 07:00:50,679 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 80 [2022-04-15 07:00:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 112 transitions. [2022-04-15 07:00:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 112 transitions. [2022-04-15 07:00:50,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 112 transitions. [2022-04-15 07:00:50,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:50,759 INFO L225 Difference]: With dead ends: 171 [2022-04-15 07:00:50,759 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 07:00:50,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=558, Invalid=15444, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 07:00:50,760 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4371 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 4371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:50,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 141 Invalid, 4505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 4371 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 07:00:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 07:00:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2022-04-15 07:00:50,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:50,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 87 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 79 states have internal predecessors, (82), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:50,974 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 87 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 79 states have internal predecessors, (82), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:50,974 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 87 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 79 states have internal predecessors, (82), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:50,980 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-04-15 07:00:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-04-15 07:00:50,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:50,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:50,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 79 states have internal predecessors, (82), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 92 states. [2022-04-15 07:00:50,980 INFO L87 Difference]: Start difference. First operand has 87 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 79 states have internal predecessors, (82), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 92 states. [2022-04-15 07:00:50,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:50,981 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-04-15 07:00:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-04-15 07:00:50,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:50,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:50,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:50,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 79 states have internal predecessors, (82), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:00:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2022-04-15 07:00:50,982 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 80 [2022-04-15 07:00:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:50,982 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2022-04-15 07:00:50,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:50,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 90 transitions. [2022-04-15 07:00:51,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-04-15 07:00:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 07:00:51,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:51,326 INFO L499 BasicCegarLoop]: trace histogram [61, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:51,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-04-15 07:00:51,326 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:51,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash -360693246, now seen corresponding path program 61 times [2022-04-15 07:00:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:51,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2065419366] [2022-04-15 07:00:54,244 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:00:54,409 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:55,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:55,128 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:55,128 INFO L85 PathProgramCache]: Analyzing trace with hash 536069432, now seen corresponding path program 1 times [2022-04-15 07:00:55,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:55,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860009142] [2022-04-15 07:00:55,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:55,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:55,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {35179#(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(12, 2);call #Ultimate.allocInit(12, 3); {35173#true} is VALID [2022-04-15 07:00:55,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {35173#true} assume true; {35173#true} is VALID [2022-04-15 07:00:55,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35173#true} {35173#true} #63#return; {35173#true} is VALID [2022-04-15 07:00:55,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {35173#true} call ULTIMATE.init(); {35179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:55,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {35179#(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(12, 2);call #Ultimate.allocInit(12, 3); {35173#true} is VALID [2022-04-15 07:00:55,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {35173#true} assume true; {35173#true} is VALID [2022-04-15 07:00:55,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35173#true} {35173#true} #63#return; {35173#true} is VALID [2022-04-15 07:00:55,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {35173#true} call #t~ret7 := main(); {35173#true} is VALID [2022-04-15 07:00:55,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {35173#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {35173#true} is VALID [2022-04-15 07:00:55,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {35173#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {35178#(= main_~y~0 0)} is VALID [2022-04-15 07:00:55,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {35178#(= main_~y~0 0)} [195] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_2505| |v_main_#t~post4_2444|)) (.cse1 (= |v_main_#t~post5_304| |v_main_#t~post5_303|)) (.cse2 (= v_main_~z~0_4586 v_main_~z~0_4524))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_370 v_main_~y~0_369)) (and (= v_main_~y~0_369 v_main_~y~0_370) .cse0 .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_2505|, main_~y~0=v_main_~y~0_370, main_#t~post5=|v_main_#t~post5_304|, main_~z~0=v_main_~z~0_4586} OutVars{main_#t~post4=|v_main_#t~post4_2444|, main_#t~post5=|v_main_#t~post5_303|, main_~y~0=v_main_~y~0_369, main_~z~0=v_main_~z~0_4524} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {35178#(= main_~y~0 0)} is VALID [2022-04-15 07:00:55,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {35178#(= main_~y~0 0)} [194] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {35174#false} is VALID [2022-04-15 07:00:55,166 INFO L272 TraceCheckUtils]: 9: Hoare triple {35174#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {35174#false} is VALID [2022-04-15 07:00:55,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {35174#false} ~cond := #in~cond; {35174#false} is VALID [2022-04-15 07:00:55,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {35174#false} assume 0 == ~cond; {35174#false} is VALID [2022-04-15 07:00:55,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {35174#false} assume !false; {35174#false} is VALID [2022-04-15 07:00:55,166 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 07:00:55,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:55,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860009142] [2022-04-15 07:00:55,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860009142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:55,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:55,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:00:57,154 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:57,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2065419366] [2022-04-15 07:00:57,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2065419366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:57,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:57,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 07:00:57,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691052329] [2022-04-15 07:00:57,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:57,155 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.121212121212121) internal successors, (74), 65 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2022-04-15 07:00:57,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:57,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 1.121212121212121) internal successors, (74), 65 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:00:57,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:57,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 07:00:57,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:57,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 07:00:57,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=4099, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 07:00:57,201 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 66 states, 66 states have (on average 1.121212121212121) internal successors, (74), 65 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:05,096 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2022-04-15 07:01:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-15 07:01:05,097 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.121212121212121) internal successors, (74), 65 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2022-04-15 07:01:05,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.121212121212121) internal successors, (74), 65 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 113 transitions. [2022-04-15 07:01:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.121212121212121) internal successors, (74), 65 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 113 transitions. [2022-04-15 07:01:05,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 113 transitions. [2022-04-15 07:01:05,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:05,195 INFO L225 Difference]: With dead ends: 173 [2022-04-15 07:01:05,195 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 07:01:05,196 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=567, Invalid=15945, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 07:01:05,196 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4415 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 4551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 4415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:05,197 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 111 Invalid, 4551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 4415 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 07:01:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 07:01:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-04-15 07:01:05,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:05,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 88 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 80 states have internal predecessors, (83), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:05,411 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 88 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 80 states have internal predecessors, (83), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:05,411 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 88 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 80 states have internal predecessors, (83), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:05,412 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-15 07:01:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-15 07:01:05,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:05,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:05,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 80 states have internal predecessors, (83), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 93 states. [2022-04-15 07:01:05,412 INFO L87 Difference]: Start difference. First operand has 88 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 80 states have internal predecessors, (83), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 93 states. [2022-04-15 07:01:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:05,413 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-15 07:01:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-15 07:01:05,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:05,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:05,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:05,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 80 states have internal predecessors, (83), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2022-04-15 07:01:05,414 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 81 [2022-04-15 07:01:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:05,414 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2022-04-15 07:01:05,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.121212121212121) internal successors, (74), 65 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:05,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 91 transitions. [2022-04-15 07:01:05,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2022-04-15 07:01:05,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 07:01:05,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:05,758 INFO L499 BasicCegarLoop]: trace histogram [62, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:05,758 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-04-15 07:01:05,758 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1639273438, now seen corresponding path program 62 times [2022-04-15 07:01:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:05,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1219570760] [2022-04-15 07:01:06,130 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:06,878 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:06,878 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:01:06,881 INFO L85 PathProgramCache]: Analyzing trace with hash 595174776, now seen corresponding path program 1 times [2022-04-15 07:01:06,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:01:06,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336226207] [2022-04-15 07:01:06,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:06,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:01:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:06,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:01:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:06,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {36085#(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(12, 2);call #Ultimate.allocInit(12, 3); {36079#true} is VALID [2022-04-15 07:01:06,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {36079#true} assume true; {36079#true} is VALID [2022-04-15 07:01:06,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36079#true} {36079#true} #63#return; {36079#true} is VALID [2022-04-15 07:01:06,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {36079#true} call ULTIMATE.init(); {36085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:01:06,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {36085#(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(12, 2);call #Ultimate.allocInit(12, 3); {36079#true} is VALID [2022-04-15 07:01:06,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {36079#true} assume true; {36079#true} is VALID [2022-04-15 07:01:06,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36079#true} {36079#true} #63#return; {36079#true} is VALID [2022-04-15 07:01:06,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {36079#true} call #t~ret7 := main(); {36079#true} is VALID [2022-04-15 07:01:06,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {36079#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {36079#true} is VALID [2022-04-15 07:01:06,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {36079#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {36084#(= main_~y~0 0)} is VALID [2022-04-15 07:01:06,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {36084#(= main_~y~0 0)} [197] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post4_2577| |v_main_#t~post4_2515|) (= v_main_~y~0_376 v_main_~y~0_375) (= |v_main_#t~post5_309| |v_main_#t~post5_308|) (= v_main_~z~0_4723 v_main_~z~0_4660)) InVars {main_#t~post4=|v_main_#t~post4_2577|, main_~y~0=v_main_~y~0_376, main_#t~post5=|v_main_#t~post5_309|, main_~z~0=v_main_~z~0_4723} OutVars{main_#t~post4=|v_main_#t~post4_2515|, main_#t~post5=|v_main_#t~post5_308|, main_~y~0=v_main_~y~0_375, main_~z~0=v_main_~z~0_4660} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {36084#(= main_~y~0 0)} is VALID [2022-04-15 07:01:06,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {36084#(= main_~y~0 0)} [196] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {36080#false} is VALID [2022-04-15 07:01:06,939 INFO L272 TraceCheckUtils]: 9: Hoare triple {36080#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {36080#false} is VALID [2022-04-15 07:01:06,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {36080#false} ~cond := #in~cond; {36080#false} is VALID [2022-04-15 07:01:06,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {36080#false} assume 0 == ~cond; {36080#false} is VALID [2022-04-15 07:01:06,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {36080#false} assume !false; {36080#false} is VALID [2022-04-15 07:01:06,939 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 07:01:06,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:01:06,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336226207] [2022-04-15 07:01:06,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336226207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:06,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:06,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:01:09,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:01:09,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1219570760] [2022-04-15 07:01:09,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1219570760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:09,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:09,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-15 07:01:09,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197712020] [2022-04-15 07:01:09,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:01:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 66 states have internal predecessors, (75), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2022-04-15 07:01:09,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:01:09,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 66 states have internal predecessors, (75), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:09,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:09,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-15 07:01:09,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:09,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-15 07:01:09,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=4228, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 07:01:09,075 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 67 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 66 states have internal predecessors, (75), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:17,318 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2022-04-15 07:01:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-15 07:01:17,318 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 66 states have internal predecessors, (75), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2022-04-15 07:01:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 66 states have internal predecessors, (75), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 114 transitions. [2022-04-15 07:01:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 66 states have internal predecessors, (75), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 114 transitions. [2022-04-15 07:01:17,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 114 transitions. [2022-04-15 07:01:17,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:17,398 INFO L225 Difference]: With dead ends: 175 [2022-04-15 07:01:17,398 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 07:01:17,399 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=576, Invalid=16454, Unknown=0, NotChecked=0, Total=17030 [2022-04-15 07:01:17,399 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4474 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 4613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 4474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:17,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 4613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 4474 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 07:01:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 07:01:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2022-04-15 07:01:17,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:17,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 89 states, 80 states have (on average 1.05) internal successors, (84), 81 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:17,620 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 89 states, 80 states have (on average 1.05) internal successors, (84), 81 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:17,621 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 89 states, 80 states have (on average 1.05) internal successors, (84), 81 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:17,621 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-04-15 07:01:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-04-15 07:01:17,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:17,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:17,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 80 states have (on average 1.05) internal successors, (84), 81 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 94 states. [2022-04-15 07:01:17,622 INFO L87 Difference]: Start difference. First operand has 89 states, 80 states have (on average 1.05) internal successors, (84), 81 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 94 states. [2022-04-15 07:01:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:17,622 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-04-15 07:01:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-04-15 07:01:17,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:17,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:17,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:17,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 80 states have (on average 1.05) internal successors, (84), 81 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-04-15 07:01:17,623 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 82 [2022-04-15 07:01:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:17,624 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-04-15 07:01:17,624 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 66 states have internal predecessors, (75), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:17,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 92 transitions. [2022-04-15 07:01:17,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-04-15 07:01:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 07:01:17,985 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:17,985 INFO L499 BasicCegarLoop]: trace histogram [63, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:17,985 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-04-15 07:01:17,985 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:17,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:17,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1674413570, now seen corresponding path program 63 times [2022-04-15 07:01:17,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:17,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [811404388] [2022-04-15 07:01:19,695 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:01:19,844 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:20,358 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:20,359 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:01:20,360 INFO L85 PathProgramCache]: Analyzing trace with hash 654280120, now seen corresponding path program 1 times [2022-04-15 07:01:20,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:01:20,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264375675] [2022-04-15 07:01:20,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:20,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:01:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:20,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:01:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:20,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {37002#(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(12, 2);call #Ultimate.allocInit(12, 3); {36996#true} is VALID [2022-04-15 07:01:20,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {36996#true} assume true; {36996#true} is VALID [2022-04-15 07:01:20,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36996#true} {36996#true} #63#return; {36996#true} is VALID [2022-04-15 07:01:20,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {36996#true} call ULTIMATE.init(); {37002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:01:20,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {37002#(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(12, 2);call #Ultimate.allocInit(12, 3); {36996#true} is VALID [2022-04-15 07:01:20,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {36996#true} assume true; {36996#true} is VALID [2022-04-15 07:01:20,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36996#true} {36996#true} #63#return; {36996#true} is VALID [2022-04-15 07:01:20,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {36996#true} call #t~ret7 := main(); {36996#true} is VALID [2022-04-15 07:01:20,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {36996#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {36996#true} is VALID [2022-04-15 07:01:20,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {36996#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {37001#(= main_~y~0 0)} is VALID [2022-04-15 07:01:20,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {37001#(= main_~y~0 0)} [199] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_314| |v_main_#t~post5_313|)) (.cse1 (= v_main_~y~0_382 v_main_~y~0_381)) (.cse2 (= |v_main_#t~post4_2650| |v_main_#t~post4_2587|))) (or (and .cse0 .cse1 (= v_main_~z~0_4862 v_main_~z~0_4798) .cse2) (and (= v_main_~z~0_4798 v_main_~z~0_4862) .cse0 .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_2650|, main_~y~0=v_main_~y~0_382, main_#t~post5=|v_main_#t~post5_314|, main_~z~0=v_main_~z~0_4862} OutVars{main_#t~post4=|v_main_#t~post4_2587|, main_#t~post5=|v_main_#t~post5_313|, main_~y~0=v_main_~y~0_381, main_~z~0=v_main_~z~0_4798} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {37001#(= main_~y~0 0)} is VALID [2022-04-15 07:01:20,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {37001#(= main_~y~0 0)} [198] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {36997#false} is VALID [2022-04-15 07:01:20,391 INFO L272 TraceCheckUtils]: 9: Hoare triple {36997#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {36997#false} is VALID [2022-04-15 07:01:20,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {36997#false} ~cond := #in~cond; {36997#false} is VALID [2022-04-15 07:01:20,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {36997#false} assume 0 == ~cond; {36997#false} is VALID [2022-04-15 07:01:20,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {36997#false} assume !false; {36997#false} is VALID [2022-04-15 07:01:20,391 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 07:01:20,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:01:20,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264375675] [2022-04-15 07:01:20,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264375675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:20,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:20,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:01:22,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:01:22,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [811404388] [2022-04-15 07:01:22,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [811404388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:22,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:22,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-15 07:01:22,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644936926] [2022-04-15 07:01:22,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:01:22,437 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 67 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2022-04-15 07:01:22,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:01:22,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 67 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:22,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:22,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-15 07:01:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:22,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-15 07:01:22,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=4359, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 07:01:22,483 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 68 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 67 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:31,503 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2022-04-15 07:01:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-15 07:01:31,504 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 67 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2022-04-15 07:01:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 67 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 115 transitions. [2022-04-15 07:01:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 67 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 115 transitions. [2022-04-15 07:01:31,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 115 transitions. [2022-04-15 07:01:31,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:31,584 INFO L225 Difference]: With dead ends: 177 [2022-04-15 07:01:31,584 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 07:01:31,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=585, Invalid=16971, Unknown=0, NotChecked=0, Total=17556 [2022-04-15 07:01:31,585 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 5055 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 5195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 5055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:31,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 246 Invalid, 5195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 5055 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 07:01:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 07:01:31,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2022-04-15 07:01:31,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:31,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 90 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 82 states have internal predecessors, (85), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:31,804 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 90 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 82 states have internal predecessors, (85), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:31,805 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 90 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 82 states have internal predecessors, (85), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:31,805 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-04-15 07:01:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2022-04-15 07:01:31,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:31,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:31,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 82 states have internal predecessors, (85), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 95 states. [2022-04-15 07:01:31,806 INFO L87 Difference]: Start difference. First operand has 90 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 82 states have internal predecessors, (85), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 95 states. [2022-04-15 07:01:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:31,806 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-04-15 07:01:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2022-04-15 07:01:31,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:31,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:31,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:31,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 82 states have internal predecessors, (85), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-04-15 07:01:31,808 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 83 [2022-04-15 07:01:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:31,808 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-04-15 07:01:31,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 67 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:31,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 93 transitions. [2022-04-15 07:01:32,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-04-15 07:01:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 07:01:32,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:32,190 INFO L499 BasicCegarLoop]: trace histogram [64, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:32,190 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-04-15 07:01:32,190 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1319495714, now seen corresponding path program 64 times [2022-04-15 07:01:32,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:32,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1757487964] [2022-04-15 07:01:33,151 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:33,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:33,933 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:01:33,934 INFO L85 PathProgramCache]: Analyzing trace with hash 713385464, now seen corresponding path program 1 times [2022-04-15 07:01:33,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:01:33,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038393015] [2022-04-15 07:01:33,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:33,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:01:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:33,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:01:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:33,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {37930#(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(12, 2);call #Ultimate.allocInit(12, 3); {37924#true} is VALID [2022-04-15 07:01:33,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {37924#true} assume true; {37924#true} is VALID [2022-04-15 07:01:33,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37924#true} {37924#true} #63#return; {37924#true} is VALID [2022-04-15 07:01:33,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {37924#true} call ULTIMATE.init(); {37930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:01:33,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {37930#(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(12, 2);call #Ultimate.allocInit(12, 3); {37924#true} is VALID [2022-04-15 07:01:33,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {37924#true} assume true; {37924#true} is VALID [2022-04-15 07:01:33,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37924#true} {37924#true} #63#return; {37924#true} is VALID [2022-04-15 07:01:33,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {37924#true} call #t~ret7 := main(); {37924#true} is VALID [2022-04-15 07:01:33,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {37924#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {37924#true} is VALID [2022-04-15 07:01:33,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {37924#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {37929#(= main_~y~0 0)} is VALID [2022-04-15 07:01:33,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {37929#(= main_~y~0 0)} [201] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_319| |v_main_#t~post5_318|)) (.cse1 (= |v_main_#t~post4_2724| |v_main_#t~post4_2660|)) (.cse2 (= v_main_~y~0_388 v_main_~y~0_387))) (or (and .cse0 (= v_main_~z~0_5003 v_main_~z~0_4938) .cse1 .cse2) (and .cse0 (= v_main_~z~0_4938 v_main_~z~0_5003) .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_2724|, main_~y~0=v_main_~y~0_388, main_#t~post5=|v_main_#t~post5_319|, main_~z~0=v_main_~z~0_5003} OutVars{main_#t~post4=|v_main_#t~post4_2660|, main_#t~post5=|v_main_#t~post5_318|, main_~y~0=v_main_~y~0_387, main_~z~0=v_main_~z~0_4938} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {37929#(= main_~y~0 0)} is VALID [2022-04-15 07:01:33,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {37929#(= main_~y~0 0)} [200] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {37925#false} is VALID [2022-04-15 07:01:33,971 INFO L272 TraceCheckUtils]: 9: Hoare triple {37925#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {37925#false} is VALID [2022-04-15 07:01:33,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {37925#false} ~cond := #in~cond; {37925#false} is VALID [2022-04-15 07:01:33,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {37925#false} assume 0 == ~cond; {37925#false} is VALID [2022-04-15 07:01:33,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {37925#false} assume !false; {37925#false} is VALID [2022-04-15 07:01:33,971 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 07:01:33,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:01:33,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038393015] [2022-04-15 07:01:33,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038393015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:33,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:33,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:01:35,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:01:35,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1757487964] [2022-04-15 07:01:35,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1757487964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:35,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:35,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-15 07:01:35,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213344978] [2022-04-15 07:01:35,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:01:35,992 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 68 states have internal predecessors, (77), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 84 [2022-04-15 07:01:35,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:01:35,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 68 states have internal predecessors, (77), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:36,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:36,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-15 07:01:36,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:36,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-15 07:01:36,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=4492, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 07:01:36,043 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 69 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 68 states have internal predecessors, (77), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:44,631 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2022-04-15 07:01:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-15 07:01:44,631 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 68 states have internal predecessors, (77), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 84 [2022-04-15 07:01:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 68 states have internal predecessors, (77), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 116 transitions. [2022-04-15 07:01:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 68 states have internal predecessors, (77), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 116 transitions. [2022-04-15 07:01:44,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 116 transitions. [2022-04-15 07:01:44,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:44,731 INFO L225 Difference]: With dead ends: 179 [2022-04-15 07:01:44,731 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 07:01:44,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=594, Invalid=17496, Unknown=0, NotChecked=0, Total=18090 [2022-04-15 07:01:44,732 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4740 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 4883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 4740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:44,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 4883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 4740 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 07:01:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 07:01:44,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-04-15 07:01:44,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:44,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 91 states, 82 states have (on average 1.048780487804878) internal successors, (86), 83 states have internal predecessors, (86), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:44,955 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 91 states, 82 states have (on average 1.048780487804878) internal successors, (86), 83 states have internal predecessors, (86), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:44,955 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 91 states, 82 states have (on average 1.048780487804878) internal successors, (86), 83 states have internal predecessors, (86), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:44,956 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-04-15 07:01:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-04-15 07:01:44,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:44,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:44,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 82 states have (on average 1.048780487804878) internal successors, (86), 83 states have internal predecessors, (86), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 96 states. [2022-04-15 07:01:44,957 INFO L87 Difference]: Start difference. First operand has 91 states, 82 states have (on average 1.048780487804878) internal successors, (86), 83 states have internal predecessors, (86), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 96 states. [2022-04-15 07:01:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:44,957 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-04-15 07:01:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-04-15 07:01:44,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:44,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:44,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:44,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 82 states have (on average 1.048780487804878) internal successors, (86), 83 states have internal predecessors, (86), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2022-04-15 07:01:44,958 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 84 [2022-04-15 07:01:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:44,958 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2022-04-15 07:01:44,959 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 68 states have internal predecessors, (77), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:44,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 94 transitions. [2022-04-15 07:01:45,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-04-15 07:01:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 07:01:45,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:45,344 INFO L499 BasicCegarLoop]: trace histogram [65, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:45,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-04-15 07:01:45,344 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:45,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:45,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1093023230, now seen corresponding path program 65 times [2022-04-15 07:01:45,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:45,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566352625] [2022-04-15 07:01:46,683 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:01:46,885 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:47,408 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:47,409 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:01:47,409 INFO L85 PathProgramCache]: Analyzing trace with hash 772490808, now seen corresponding path program 1 times [2022-04-15 07:01:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:01:47,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62940985] [2022-04-15 07:01:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:47,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:01:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:01:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:47,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {38869#(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(12, 2);call #Ultimate.allocInit(12, 3); {38863#true} is VALID [2022-04-15 07:01:47,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {38863#true} assume true; {38863#true} is VALID [2022-04-15 07:01:47,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38863#true} {38863#true} #63#return; {38863#true} is VALID [2022-04-15 07:01:47,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {38863#true} call ULTIMATE.init(); {38869#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:01:47,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {38869#(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(12, 2);call #Ultimate.allocInit(12, 3); {38863#true} is VALID [2022-04-15 07:01:47,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {38863#true} assume true; {38863#true} is VALID [2022-04-15 07:01:47,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38863#true} {38863#true} #63#return; {38863#true} is VALID [2022-04-15 07:01:47,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {38863#true} call #t~ret7 := main(); {38863#true} is VALID [2022-04-15 07:01:47,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {38863#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {38863#true} is VALID [2022-04-15 07:01:47,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {38863#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {38868#(= main_~y~0 0)} is VALID [2022-04-15 07:01:47,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {38868#(= main_~y~0 0)} [203] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post5_324| |v_main_#t~post5_323|) (= |v_main_#t~post4_2799| |v_main_#t~post4_2734|) (= v_main_~y~0_394 v_main_~y~0_393) (= v_main_~z~0_5146 v_main_~z~0_5080)) InVars {main_#t~post4=|v_main_#t~post4_2799|, main_~y~0=v_main_~y~0_394, main_#t~post5=|v_main_#t~post5_324|, main_~z~0=v_main_~z~0_5146} OutVars{main_#t~post4=|v_main_#t~post4_2734|, main_#t~post5=|v_main_#t~post5_323|, main_~y~0=v_main_~y~0_393, main_~z~0=v_main_~z~0_5080} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {38868#(= main_~y~0 0)} is VALID [2022-04-15 07:01:47,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {38868#(= main_~y~0 0)} [202] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {38864#false} is VALID [2022-04-15 07:01:47,447 INFO L272 TraceCheckUtils]: 9: Hoare triple {38864#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {38864#false} is VALID [2022-04-15 07:01:47,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {38864#false} ~cond := #in~cond; {38864#false} is VALID [2022-04-15 07:01:47,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {38864#false} assume 0 == ~cond; {38864#false} is VALID [2022-04-15 07:01:47,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {38864#false} assume !false; {38864#false} is VALID [2022-04-15 07:01:47,447 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 07:01:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:01:47,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62940985] [2022-04-15 07:01:47,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62940985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:47,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:47,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:01:49,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:01:49,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566352625] [2022-04-15 07:01:49,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566352625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:49,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:49,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-15 07:01:49,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498257561] [2022-04-15 07:01:49,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:01:49,717 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2022-04-15 07:01:49,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:01:49,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:49,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:49,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-15 07:01:49,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:49,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-15 07:01:49,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=4627, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 07:01:49,764 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 70 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:58,507 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2022-04-15 07:01:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-15 07:01:58,507 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2022-04-15 07:01:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 117 transitions. [2022-04-15 07:01:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 117 transitions. [2022-04-15 07:01:58,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 117 transitions. [2022-04-15 07:01:58,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:58,616 INFO L225 Difference]: With dead ends: 181 [2022-04-15 07:01:58,616 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 07:01:58,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=603, Invalid=18029, Unknown=0, NotChecked=0, Total=18632 [2022-04-15 07:01:58,617 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 4806 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 4951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 4806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:58,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 4951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 4806 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 07:01:58,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 07:01:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-04-15 07:01:58,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:58,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 92 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 84 states have internal predecessors, (87), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:58,852 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 92 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 84 states have internal predecessors, (87), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:58,852 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 92 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 84 states have internal predecessors, (87), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:58,853 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-04-15 07:01:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-04-15 07:01:58,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:58,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:58,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 84 states have internal predecessors, (87), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 97 states. [2022-04-15 07:01:58,853 INFO L87 Difference]: Start difference. First operand has 92 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 84 states have internal predecessors, (87), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 97 states. [2022-04-15 07:01:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:58,854 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-04-15 07:01:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-04-15 07:01:58,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:58,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:58,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:58,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 84 states have internal predecessors, (87), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2022-04-15 07:01:58,855 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 85 [2022-04-15 07:01:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:58,855 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2022-04-15 07:01:58,855 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:01:58,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 95 transitions. [2022-04-15 07:01:59,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:59,254 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2022-04-15 07:01:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 07:01:59,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:59,255 INFO L499 BasicCegarLoop]: trace histogram [66, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:59,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-04-15 07:01:59,255 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:59,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:59,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1428300834, now seen corresponding path program 66 times [2022-04-15 07:01:59,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:59,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [884806933] [2022-04-15 07:02:00,655 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:00,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:01,492 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:01,492 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:02:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash 831596152, now seen corresponding path program 1 times [2022-04-15 07:02:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:02:01,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385766123] [2022-04-15 07:02:01,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:02:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:02:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:01,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {39819#(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(12, 2);call #Ultimate.allocInit(12, 3); {39813#true} is VALID [2022-04-15 07:02:01,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {39813#true} assume true; {39813#true} is VALID [2022-04-15 07:02:01,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39813#true} {39813#true} #63#return; {39813#true} is VALID [2022-04-15 07:02:01,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {39813#true} call ULTIMATE.init(); {39819#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:02:01,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {39819#(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(12, 2);call #Ultimate.allocInit(12, 3); {39813#true} is VALID [2022-04-15 07:02:01,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {39813#true} assume true; {39813#true} is VALID [2022-04-15 07:02:01,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39813#true} {39813#true} #63#return; {39813#true} is VALID [2022-04-15 07:02:01,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {39813#true} call #t~ret7 := main(); {39813#true} is VALID [2022-04-15 07:02:01,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {39813#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {39813#true} is VALID [2022-04-15 07:02:01,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {39813#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {39818#(= main_~y~0 0)} is VALID [2022-04-15 07:02:01,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {39818#(= main_~y~0 0)} [205] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post5_329| |v_main_#t~post5_328|) (= v_main_~y~0_400 v_main_~y~0_399) (= |v_main_#t~post4_2875| |v_main_#t~post4_2809|) (= v_main_~z~0_5291 v_main_~z~0_5224)) InVars {main_#t~post4=|v_main_#t~post4_2875|, main_~y~0=v_main_~y~0_400, main_#t~post5=|v_main_#t~post5_329|, main_~z~0=v_main_~z~0_5291} OutVars{main_#t~post4=|v_main_#t~post4_2809|, main_#t~post5=|v_main_#t~post5_328|, main_~y~0=v_main_~y~0_399, main_~z~0=v_main_~z~0_5224} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {39818#(= main_~y~0 0)} is VALID [2022-04-15 07:02:01,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {39818#(= main_~y~0 0)} [204] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {39814#false} is VALID [2022-04-15 07:02:01,537 INFO L272 TraceCheckUtils]: 9: Hoare triple {39814#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {39814#false} is VALID [2022-04-15 07:02:01,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {39814#false} ~cond := #in~cond; {39814#false} is VALID [2022-04-15 07:02:01,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {39814#false} assume 0 == ~cond; {39814#false} is VALID [2022-04-15 07:02:01,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {39814#false} assume !false; {39814#false} is VALID [2022-04-15 07:02:01,537 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 07:02:01,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:02:01,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385766123] [2022-04-15 07:02:01,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385766123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:01,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:01,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:02:03,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:02:03,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [884806933] [2022-04-15 07:02:03,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [884806933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:03,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:03,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-04-15 07:02:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045962977] [2022-04-15 07:02:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:02:03,707 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 70 states have internal predecessors, (79), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2022-04-15 07:02:03,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:02:03,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 71 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 70 states have internal predecessors, (79), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:03,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:03,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-04-15 07:02:03,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:03,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-04-15 07:02:03,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=4764, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 07:02:03,755 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 71 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 70 states have internal predecessors, (79), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:12,648 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2022-04-15 07:02:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-15 07:02:12,648 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 70 states have internal predecessors, (79), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2022-04-15 07:02:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:02:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 70 states have internal predecessors, (79), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 118 transitions. [2022-04-15 07:02:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 70 states have internal predecessors, (79), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 118 transitions. [2022-04-15 07:02:12,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 118 transitions. [2022-04-15 07:02:12,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:12,730 INFO L225 Difference]: With dead ends: 183 [2022-04-15 07:02:12,730 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 07:02:12,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=612, Invalid=18570, Unknown=0, NotChecked=0, Total=19182 [2022-04-15 07:02:12,732 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 4930 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 4930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:02:12,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 5077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 4930 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 07:02:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 07:02:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2022-04-15 07:02:12,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:02:12,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 93 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 85 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:12,967 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 93 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 85 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:12,967 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 93 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 85 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:12,968 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-04-15 07:02:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-04-15 07:02:12,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:12,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:12,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 85 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 98 states. [2022-04-15 07:02:12,968 INFO L87 Difference]: Start difference. First operand has 93 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 85 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 98 states. [2022-04-15 07:02:12,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:12,969 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-04-15 07:02:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-04-15 07:02:12,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:12,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:12,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:02:12,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:02:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 85 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-15 07:02:12,970 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 86 [2022-04-15 07:02:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:02:12,970 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-15 07:02:12,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 70 states have internal predecessors, (79), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:12,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 96 transitions. [2022-04-15 07:02:13,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-15 07:02:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 07:02:13,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:02:13,376 INFO L499 BasicCegarLoop]: trace histogram [67, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:02:13,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-04-15 07:02:13,376 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:02:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:02:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2015031806, now seen corresponding path program 67 times [2022-04-15 07:02:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:13,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243457975] [2022-04-15 07:02:14,207 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:14,707 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:14,707 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:02:14,708 INFO L85 PathProgramCache]: Analyzing trace with hash 890701496, now seen corresponding path program 1 times [2022-04-15 07:02:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:02:14,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914364747] [2022-04-15 07:02:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:14,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:02:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:14,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:02:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:14,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {40780#(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(12, 2);call #Ultimate.allocInit(12, 3); {40774#true} is VALID [2022-04-15 07:02:14,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {40774#true} assume true; {40774#true} is VALID [2022-04-15 07:02:14,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40774#true} {40774#true} #63#return; {40774#true} is VALID [2022-04-15 07:02:14,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {40774#true} call ULTIMATE.init(); {40780#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:02:14,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {40780#(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(12, 2);call #Ultimate.allocInit(12, 3); {40774#true} is VALID [2022-04-15 07:02:14,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {40774#true} assume true; {40774#true} is VALID [2022-04-15 07:02:14,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40774#true} {40774#true} #63#return; {40774#true} is VALID [2022-04-15 07:02:14,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {40774#true} call #t~ret7 := main(); {40774#true} is VALID [2022-04-15 07:02:14,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {40774#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {40774#true} is VALID [2022-04-15 07:02:14,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {40774#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {40779#(= main_~y~0 0)} is VALID [2022-04-15 07:02:14,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {40779#(= main_~y~0 0)} [207] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post4_2952| |v_main_#t~post4_2885|) (= |v_main_#t~post5_334| |v_main_#t~post5_333|) (= v_main_~y~0_406 v_main_~y~0_405) (= v_main_~z~0_5438 v_main_~z~0_5370)) InVars {main_#t~post4=|v_main_#t~post4_2952|, main_~y~0=v_main_~y~0_406, main_#t~post5=|v_main_#t~post5_334|, main_~z~0=v_main_~z~0_5438} OutVars{main_#t~post4=|v_main_#t~post4_2885|, main_#t~post5=|v_main_#t~post5_333|, main_~y~0=v_main_~y~0_405, main_~z~0=v_main_~z~0_5370} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {40779#(= main_~y~0 0)} is VALID [2022-04-15 07:02:14,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {40779#(= main_~y~0 0)} [206] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {40775#false} is VALID [2022-04-15 07:02:14,747 INFO L272 TraceCheckUtils]: 9: Hoare triple {40775#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {40775#false} is VALID [2022-04-15 07:02:14,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {40775#false} ~cond := #in~cond; {40775#false} is VALID [2022-04-15 07:02:14,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {40775#false} assume 0 == ~cond; {40775#false} is VALID [2022-04-15 07:02:14,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {40775#false} assume !false; {40775#false} is VALID [2022-04-15 07:02:14,748 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 07:02:14,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:02:14,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914364747] [2022-04-15 07:02:14,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914364747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:14,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:14,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:02:16,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:02:16,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243457975] [2022-04-15 07:02:16,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243457975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:16,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:16,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-15 07:02:16,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703867097] [2022-04-15 07:02:16,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:02:16,948 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 71 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 87 [2022-04-15 07:02:16,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:02:16,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 72 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 71 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:16,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:16,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-15 07:02:16,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:16,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-15 07:02:16,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4903, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 07:02:16,996 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 72 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 71 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:26,661 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2022-04-15 07:02:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-15 07:02:26,661 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 71 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 87 [2022-04-15 07:02:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:02:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 71 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 119 transitions. [2022-04-15 07:02:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 71 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 119 transitions. [2022-04-15 07:02:26,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 119 transitions. [2022-04-15 07:02:26,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:26,743 INFO L225 Difference]: With dead ends: 185 [2022-04-15 07:02:26,743 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 07:02:26,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=621, Invalid=19119, Unknown=0, NotChecked=0, Total=19740 [2022-04-15 07:02:26,744 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 5392 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 5541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 5392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:02:26,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 171 Invalid, 5541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 5392 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 07:02:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 07:02:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2022-04-15 07:02:26,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:02:26,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 94 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 86 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:26,979 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 94 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 86 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:26,980 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 94 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 86 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:26,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:26,980 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-15 07:02:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-15 07:02:26,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:26,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:26,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 86 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 99 states. [2022-04-15 07:02:26,981 INFO L87 Difference]: Start difference. First operand has 94 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 86 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 99 states. [2022-04-15 07:02:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:26,982 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-15 07:02:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-15 07:02:26,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:26,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:26,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:02:26,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:02:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 86 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-15 07:02:26,983 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 87 [2022-04-15 07:02:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:02:26,983 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-15 07:02:26,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 71 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:26,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-15 07:02:27,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-15 07:02:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-15 07:02:27,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:02:27,389 INFO L499 BasicCegarLoop]: trace histogram [68, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:02:27,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-04-15 07:02:27,389 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:02:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:02:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1384161246, now seen corresponding path program 68 times [2022-04-15 07:02:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:27,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1722815912] [2022-04-15 07:02:30,070 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:30,200 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:30,716 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:30,716 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:02:30,717 INFO L85 PathProgramCache]: Analyzing trace with hash 949806840, now seen corresponding path program 1 times [2022-04-15 07:02:30,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:02:30,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079703803] [2022-04-15 07:02:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:30,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:02:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:30,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:02:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:30,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {41752#(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(12, 2);call #Ultimate.allocInit(12, 3); {41746#true} is VALID [2022-04-15 07:02:30,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {41746#true} assume true; {41746#true} is VALID [2022-04-15 07:02:30,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41746#true} {41746#true} #63#return; {41746#true} is VALID [2022-04-15 07:02:30,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {41746#true} call ULTIMATE.init(); {41752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:02:30,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {41752#(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(12, 2);call #Ultimate.allocInit(12, 3); {41746#true} is VALID [2022-04-15 07:02:30,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {41746#true} assume true; {41746#true} is VALID [2022-04-15 07:02:30,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41746#true} {41746#true} #63#return; {41746#true} is VALID [2022-04-15 07:02:30,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {41746#true} call #t~ret7 := main(); {41746#true} is VALID [2022-04-15 07:02:30,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {41746#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {41746#true} is VALID [2022-04-15 07:02:30,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {41746#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {41751#(= main_~y~0 0)} is VALID [2022-04-15 07:02:30,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {41751#(= main_~y~0 0)} [209] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_412 v_main_~y~0_411)) (.cse1 (= |v_main_#t~post5_339| |v_main_#t~post5_338|)) (.cse2 (= v_main_~z~0_5587 v_main_~z~0_5518))) (or (and .cse0 .cse1 (= |v_main_#t~post4_3030| |v_main_#t~post4_2962|) .cse2) (and .cse0 .cse1 (= |v_main_#t~post4_2962| |v_main_#t~post4_3030|) .cse2))) InVars {main_#t~post4=|v_main_#t~post4_3030|, main_~y~0=v_main_~y~0_412, main_#t~post5=|v_main_#t~post5_339|, main_~z~0=v_main_~z~0_5587} OutVars{main_#t~post4=|v_main_#t~post4_2962|, main_#t~post5=|v_main_#t~post5_338|, main_~y~0=v_main_~y~0_411, main_~z~0=v_main_~z~0_5518} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {41751#(= main_~y~0 0)} is VALID [2022-04-15 07:02:30,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {41751#(= main_~y~0 0)} [208] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {41747#false} is VALID [2022-04-15 07:02:30,761 INFO L272 TraceCheckUtils]: 9: Hoare triple {41747#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {41747#false} is VALID [2022-04-15 07:02:30,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {41747#false} ~cond := #in~cond; {41747#false} is VALID [2022-04-15 07:02:30,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {41747#false} assume 0 == ~cond; {41747#false} is VALID [2022-04-15 07:02:30,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {41747#false} assume !false; {41747#false} is VALID [2022-04-15 07:02:30,761 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 07:02:30,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:02:30,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079703803] [2022-04-15 07:02:30,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079703803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:30,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:30,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:02:33,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:02:33,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1722815912] [2022-04-15 07:02:33,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1722815912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:33,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:33,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-04-15 07:02:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225586103] [2022-04-15 07:02:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:02:33,044 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 72 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2022-04-15 07:02:33,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:02:33,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 73 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 72 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:33,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:33,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-04-15 07:02:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:33,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-04-15 07:02:33,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=5044, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 07:02:33,093 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 73 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 72 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:42,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:42,973 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2022-04-15 07:02:42,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-04-15 07:02:42,973 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 72 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2022-04-15 07:02:42,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:02:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 72 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2022-04-15 07:02:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 72 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2022-04-15 07:02:42,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 120 transitions. [2022-04-15 07:02:43,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:43,060 INFO L225 Difference]: With dead ends: 187 [2022-04-15 07:02:43,060 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 07:02:43,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=630, Invalid=19676, Unknown=0, NotChecked=0, Total=20306 [2022-04-15 07:02:43,061 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 5534 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 5685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 5534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:02:43,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 171 Invalid, 5685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 5534 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 07:02:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 07:02:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-04-15 07:02:43,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:02:43,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 95 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:43,309 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 95 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:43,309 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 95 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:43,310 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-04-15 07:02:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2022-04-15 07:02:43,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:43,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:43,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 100 states. [2022-04-15 07:02:43,310 INFO L87 Difference]: Start difference. First operand has 95 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 100 states. [2022-04-15 07:02:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:43,311 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-04-15 07:02:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2022-04-15 07:02:43,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:43,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:43,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:02:43,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:02:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2022-04-15 07:02:43,312 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 88 [2022-04-15 07:02:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:02:43,312 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2022-04-15 07:02:43,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 72 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:43,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 98 transitions. [2022-04-15 07:02:43,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-15 07:02:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 07:02:43,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:02:43,747 INFO L499 BasicCegarLoop]: trace histogram [69, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:02:43,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-04-15 07:02:43,748 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:02:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:02:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash 992956930, now seen corresponding path program 69 times [2022-04-15 07:02:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:43,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054765334] [2022-04-15 07:02:45,590 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:45,721 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:46,251 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:46,251 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:02:46,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1008912184, now seen corresponding path program 1 times [2022-04-15 07:02:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:02:46,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486754894] [2022-04-15 07:02:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:02:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:46,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:02:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:46,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {42735#(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(12, 2);call #Ultimate.allocInit(12, 3); {42729#true} is VALID [2022-04-15 07:02:46,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {42729#true} assume true; {42729#true} is VALID [2022-04-15 07:02:46,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42729#true} {42729#true} #63#return; {42729#true} is VALID [2022-04-15 07:02:46,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {42729#true} call ULTIMATE.init(); {42735#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:02:46,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {42735#(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(12, 2);call #Ultimate.allocInit(12, 3); {42729#true} is VALID [2022-04-15 07:02:46,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {42729#true} assume true; {42729#true} is VALID [2022-04-15 07:02:46,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42729#true} {42729#true} #63#return; {42729#true} is VALID [2022-04-15 07:02:46,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {42729#true} call #t~ret7 := main(); {42729#true} is VALID [2022-04-15 07:02:46,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {42729#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {42729#true} is VALID [2022-04-15 07:02:46,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {42729#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {42734#(= main_~y~0 0)} is VALID [2022-04-15 07:02:46,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {42734#(= main_~y~0 0)} [211] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_5738 v_main_~z~0_5668) (= |v_main_#t~post5_344| |v_main_#t~post5_343|) (= v_main_~y~0_418 v_main_~y~0_417) (= |v_main_#t~post4_3109| |v_main_#t~post4_3040|)) InVars {main_#t~post4=|v_main_#t~post4_3109|, main_~y~0=v_main_~y~0_418, main_#t~post5=|v_main_#t~post5_344|, main_~z~0=v_main_~z~0_5738} OutVars{main_#t~post4=|v_main_#t~post4_3040|, main_#t~post5=|v_main_#t~post5_343|, main_~y~0=v_main_~y~0_417, main_~z~0=v_main_~z~0_5668} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {42734#(= main_~y~0 0)} is VALID [2022-04-15 07:02:46,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {42734#(= main_~y~0 0)} [210] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {42730#false} is VALID [2022-04-15 07:02:46,312 INFO L272 TraceCheckUtils]: 9: Hoare triple {42730#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {42730#false} is VALID [2022-04-15 07:02:46,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {42730#false} ~cond := #in~cond; {42730#false} is VALID [2022-04-15 07:02:46,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {42730#false} assume 0 == ~cond; {42730#false} is VALID [2022-04-15 07:02:46,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {42730#false} assume !false; {42730#false} is VALID [2022-04-15 07:02:46,312 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 07:02:46,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:02:46,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486754894] [2022-04-15 07:02:46,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486754894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:46,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:46,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:02:48,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:02:48,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1054765334] [2022-04-15 07:02:48,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1054765334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:48,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:48,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2022-04-15 07:02:48,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401951670] [2022-04-15 07:02:48,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:02:48,667 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 73 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2022-04-15 07:02:48,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:02:48,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 74 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 73 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:48,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:48,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-04-15 07:02:48,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:48,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-04-15 07:02:48,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=5187, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 07:02:48,717 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 74 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 73 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:58,725 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2022-04-15 07:02:58,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-04-15 07:02:58,725 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 73 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2022-04-15 07:02:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:02:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 73 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 121 transitions. [2022-04-15 07:02:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 73 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 121 transitions. [2022-04-15 07:02:58,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 121 transitions. [2022-04-15 07:02:58,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:58,829 INFO L225 Difference]: With dead ends: 189 [2022-04-15 07:02:58,829 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 07:02:58,830 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=639, Invalid=20241, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 07:02:58,830 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5581 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 5733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 5581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:02:58,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 136 Invalid, 5733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 5581 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 07:02:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 07:02:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2022-04-15 07:02:59,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:02:59,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 96 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:59,094 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 96 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:59,094 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 96 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:59,095 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-04-15 07:02:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-04-15 07:02:59,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:59,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:59,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 101 states. [2022-04-15 07:02:59,095 INFO L87 Difference]: Start difference. First operand has 96 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 101 states. [2022-04-15 07:02:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:59,096 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-04-15 07:02:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-04-15 07:02:59,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:59,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:59,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:02:59,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:02:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:02:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2022-04-15 07:02:59,098 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 89 [2022-04-15 07:02:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:02:59,098 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2022-04-15 07:02:59,098 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 73 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:02:59,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 99 transitions. [2022-04-15 07:02:59,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2022-04-15 07:02:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 07:02:59,595 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:02:59,595 INFO L499 BasicCegarLoop]: trace histogram [70, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:02:59,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-04-15 07:02:59,596 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:02:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:02:59,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1669176354, now seen corresponding path program 70 times [2022-04-15 07:02:59,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:59,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [656839072] [2022-04-15 07:03:00,070 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:00,861 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:00,861 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:03:00,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1068017528, now seen corresponding path program 1 times [2022-04-15 07:03:00,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:03:00,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804778376] [2022-04-15 07:03:00,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:03:00,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:03:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:03:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:00,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {43729#(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(12, 2);call #Ultimate.allocInit(12, 3); {43723#true} is VALID [2022-04-15 07:03:00,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {43723#true} assume true; {43723#true} is VALID [2022-04-15 07:03:00,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43723#true} {43723#true} #63#return; {43723#true} is VALID [2022-04-15 07:03:00,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {43723#true} call ULTIMATE.init(); {43729#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:03:00,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {43729#(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(12, 2);call #Ultimate.allocInit(12, 3); {43723#true} is VALID [2022-04-15 07:03:00,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {43723#true} assume true; {43723#true} is VALID [2022-04-15 07:03:00,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43723#true} {43723#true} #63#return; {43723#true} is VALID [2022-04-15 07:03:00,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {43723#true} call #t~ret7 := main(); {43723#true} is VALID [2022-04-15 07:03:00,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {43723#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {43723#true} is VALID [2022-04-15 07:03:00,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {43723#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {43728#(= main_~y~0 0)} is VALID [2022-04-15 07:03:00,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {43728#(= main_~y~0 0)} [213] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_424 v_main_~y~0_423) (= |v_main_#t~post5_349| |v_main_#t~post5_348|) (= v_main_~z~0_5891 v_main_~z~0_5820) (= |v_main_#t~post4_3189| |v_main_#t~post4_3119|)) InVars {main_#t~post4=|v_main_#t~post4_3189|, main_~y~0=v_main_~y~0_424, main_#t~post5=|v_main_#t~post5_349|, main_~z~0=v_main_~z~0_5891} OutVars{main_#t~post4=|v_main_#t~post4_3119|, main_#t~post5=|v_main_#t~post5_348|, main_~y~0=v_main_~y~0_423, main_~z~0=v_main_~z~0_5820} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {43728#(= main_~y~0 0)} is VALID [2022-04-15 07:03:00,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {43728#(= main_~y~0 0)} [212] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {43724#false} is VALID [2022-04-15 07:03:00,906 INFO L272 TraceCheckUtils]: 9: Hoare triple {43724#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {43724#false} is VALID [2022-04-15 07:03:00,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {43724#false} ~cond := #in~cond; {43724#false} is VALID [2022-04-15 07:03:00,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {43724#false} assume 0 == ~cond; {43724#false} is VALID [2022-04-15 07:03:00,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {43724#false} assume !false; {43724#false} is VALID [2022-04-15 07:03:00,906 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 07:03:00,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:03:00,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804778376] [2022-04-15 07:03:00,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804778376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:03:00,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:03:00,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:03:03,292 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:03:03,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [656839072] [2022-04-15 07:03:03,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [656839072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:03:03,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:03:03,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-04-15 07:03:03,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989056832] [2022-04-15 07:03:03,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:03:03,293 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2022-04-15 07:03:03,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:03:03,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 75 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:03,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:03,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-04-15 07:03:03,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:03,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-04-15 07:03:03,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=5332, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 07:03:03,343 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand has 75 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:13,818 INFO L93 Difference]: Finished difference Result 191 states and 200 transitions. [2022-04-15 07:03:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-04-15 07:03:13,819 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2022-04-15 07:03:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:03:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 122 transitions. [2022-04-15 07:03:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 122 transitions. [2022-04-15 07:03:13,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 122 transitions. [2022-04-15 07:03:13,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:13,910 INFO L225 Difference]: With dead ends: 191 [2022-04-15 07:03:13,910 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 07:03:13,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=648, Invalid=20814, Unknown=0, NotChecked=0, Total=21462 [2022-04-15 07:03:13,911 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 5825 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 5979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 5825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:03:13,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 171 Invalid, 5979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 5825 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 07:03:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 07:03:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-04-15 07:03:14,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:03:14,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 97 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 89 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:14,164 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 97 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 89 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:14,164 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 97 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 89 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:14,165 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-04-15 07:03:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-04-15 07:03:14,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:14,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:14,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 89 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-04-15 07:03:14,165 INFO L87 Difference]: Start difference. First operand has 97 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 89 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-04-15 07:03:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:14,166 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-04-15 07:03:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-04-15 07:03:14,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:14,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:14,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:03:14,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:03:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 89 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2022-04-15 07:03:14,167 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 90 [2022-04-15 07:03:14,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:03:14,167 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2022-04-15 07:03:14,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:14,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 100 transitions. [2022-04-15 07:03:14,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-04-15 07:03:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 07:03:14,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:03:14,611 INFO L499 BasicCegarLoop]: trace histogram [71, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:03:14,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-04-15 07:03:14,612 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:03:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:03:14,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1157142018, now seen corresponding path program 71 times [2022-04-15 07:03:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:14,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617273683] [2022-04-15 07:03:17,566 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:03:17,800 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:18,390 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:18,390 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:03:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1127122872, now seen corresponding path program 1 times [2022-04-15 07:03:18,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:03:18,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718824139] [2022-04-15 07:03:18,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:03:18,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:03:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:03:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:18,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {44734#(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(12, 2);call #Ultimate.allocInit(12, 3); {44728#true} is VALID [2022-04-15 07:03:18,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {44728#true} assume true; {44728#true} is VALID [2022-04-15 07:03:18,422 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44728#true} {44728#true} #63#return; {44728#true} is VALID [2022-04-15 07:03:18,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {44728#true} call ULTIMATE.init(); {44734#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:03:18,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {44734#(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(12, 2);call #Ultimate.allocInit(12, 3); {44728#true} is VALID [2022-04-15 07:03:18,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {44728#true} assume true; {44728#true} is VALID [2022-04-15 07:03:18,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44728#true} {44728#true} #63#return; {44728#true} is VALID [2022-04-15 07:03:18,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {44728#true} call #t~ret7 := main(); {44728#true} is VALID [2022-04-15 07:03:18,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {44728#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {44728#true} is VALID [2022-04-15 07:03:18,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {44728#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {44733#(= main_~y~0 0)} is VALID [2022-04-15 07:03:18,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {44733#(= main_~y~0 0)} [215] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_354| |v_main_#t~post5_353|)) (.cse1 (= |v_main_#t~post4_3270| |v_main_#t~post4_3199|))) (or (and (= v_main_~y~0_430 v_main_~y~0_429) .cse0 (= v_main_~z~0_6046 v_main_~z~0_5974) .cse1) (and (= v_main_~y~0_429 v_main_~y~0_430) (= v_main_~z~0_5974 v_main_~z~0_6046) .cse0 .cse1))) InVars {main_#t~post4=|v_main_#t~post4_3270|, main_~y~0=v_main_~y~0_430, main_#t~post5=|v_main_#t~post5_354|, main_~z~0=v_main_~z~0_6046} OutVars{main_#t~post4=|v_main_#t~post4_3199|, main_#t~post5=|v_main_#t~post5_353|, main_~y~0=v_main_~y~0_429, main_~z~0=v_main_~z~0_5974} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {44733#(= main_~y~0 0)} is VALID [2022-04-15 07:03:18,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {44733#(= main_~y~0 0)} [214] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {44729#false} is VALID [2022-04-15 07:03:18,433 INFO L272 TraceCheckUtils]: 9: Hoare triple {44729#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {44729#false} is VALID [2022-04-15 07:03:18,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {44729#false} ~cond := #in~cond; {44729#false} is VALID [2022-04-15 07:03:18,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {44729#false} assume 0 == ~cond; {44729#false} is VALID [2022-04-15 07:03:18,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {44729#false} assume !false; {44729#false} is VALID [2022-04-15 07:03:18,433 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 07:03:18,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:03:18,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718824139] [2022-04-15 07:03:18,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718824139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:03:18,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:03:18,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:03:20,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:03:20,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617273683] [2022-04-15 07:03:20,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617273683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:03:20,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:03:20,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2022-04-15 07:03:20,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722173124] [2022-04-15 07:03:20,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:03:20,861 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.105263157894737) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2022-04-15 07:03:20,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:03:20,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 76 states, 76 states have (on average 1.105263157894737) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:20,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:20,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-04-15 07:03:20,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:20,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-04-15 07:03:20,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=5479, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 07:03:20,912 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand has 76 states, 76 states have (on average 1.105263157894737) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:31,828 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2022-04-15 07:03:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-04-15 07:03:31,828 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.105263157894737) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2022-04-15 07:03:31,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:03:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.105263157894737) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2022-04-15 07:03:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.105263157894737) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2022-04-15 07:03:31,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 123 transitions. [2022-04-15 07:03:31,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:31,912 INFO L225 Difference]: With dead ends: 193 [2022-04-15 07:03:31,912 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 07:03:31,913 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=657, Invalid=21395, Unknown=0, NotChecked=0, Total=22052 [2022-04-15 07:03:31,913 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 6183 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 6339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 6183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:03:31,913 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 246 Invalid, 6339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 6183 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 07:03:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 07:03:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2022-04-15 07:03:32,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:03:32,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 98 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:32,165 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 98 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:32,165 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 98 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:32,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:32,166 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2022-04-15 07:03:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2022-04-15 07:03:32,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:32,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:32,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 103 states. [2022-04-15 07:03:32,167 INFO L87 Difference]: Start difference. First operand has 98 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 103 states. [2022-04-15 07:03:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:32,168 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2022-04-15 07:03:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2022-04-15 07:03:32,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:32,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:32,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:03:32,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:03:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2022-04-15 07:03:32,169 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 91 [2022-04-15 07:03:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:03:32,169 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2022-04-15 07:03:32,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.105263157894737) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:32,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 101 transitions. [2022-04-15 07:03:32,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2022-04-15 07:03:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 07:03:32,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:03:32,627 INFO L499 BasicCegarLoop]: trace histogram [72, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:03:32,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-04-15 07:03:32,627 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:03:32,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:03:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1831020510, now seen corresponding path program 72 times [2022-04-15 07:03:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:32,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [655173975] [2022-04-15 07:03:34,023 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:03:34,241 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:34,976 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:34,976 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:03:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1186228216, now seen corresponding path program 1 times [2022-04-15 07:03:34,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:03:34,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93845770] [2022-04-15 07:03:34,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:03:34,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:03:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:35,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:03:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:35,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {45750#(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(12, 2);call #Ultimate.allocInit(12, 3); {45744#true} is VALID [2022-04-15 07:03:35,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {45744#true} assume true; {45744#true} is VALID [2022-04-15 07:03:35,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45744#true} {45744#true} #63#return; {45744#true} is VALID [2022-04-15 07:03:35,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {45744#true} call ULTIMATE.init(); {45750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:03:35,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {45750#(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(12, 2);call #Ultimate.allocInit(12, 3); {45744#true} is VALID [2022-04-15 07:03:35,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {45744#true} assume true; {45744#true} is VALID [2022-04-15 07:03:35,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45744#true} {45744#true} #63#return; {45744#true} is VALID [2022-04-15 07:03:35,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {45744#true} call #t~ret7 := main(); {45744#true} is VALID [2022-04-15 07:03:35,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {45744#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {45744#true} is VALID [2022-04-15 07:03:35,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {45744#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {45749#(= main_~y~0 0)} is VALID [2022-04-15 07:03:35,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {45749#(= main_~y~0 0)} [217] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_6203 v_main_~z~0_6130) (= |v_main_#t~post4_3352| |v_main_#t~post4_3280|) (= v_main_~y~0_436 v_main_~y~0_435) (= |v_main_#t~post5_359| |v_main_#t~post5_358|)) InVars {main_#t~post4=|v_main_#t~post4_3352|, main_~y~0=v_main_~y~0_436, main_#t~post5=|v_main_#t~post5_359|, main_~z~0=v_main_~z~0_6203} OutVars{main_#t~post4=|v_main_#t~post4_3280|, main_#t~post5=|v_main_#t~post5_358|, main_~y~0=v_main_~y~0_435, main_~z~0=v_main_~z~0_6130} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {45749#(= main_~y~0 0)} is VALID [2022-04-15 07:03:35,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {45749#(= main_~y~0 0)} [216] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {45745#false} is VALID [2022-04-15 07:03:35,012 INFO L272 TraceCheckUtils]: 9: Hoare triple {45745#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {45745#false} is VALID [2022-04-15 07:03:35,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {45745#false} ~cond := #in~cond; {45745#false} is VALID [2022-04-15 07:03:35,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {45745#false} assume 0 == ~cond; {45745#false} is VALID [2022-04-15 07:03:35,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {45745#false} assume !false; {45745#false} is VALID [2022-04-15 07:03:35,012 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 07:03:35,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:03:35,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93845770] [2022-04-15 07:03:35,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93845770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:03:35,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:03:35,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:03:37,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:03:37,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [655173975] [2022-04-15 07:03:37,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [655173975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:03:37,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:03:37,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-04-15 07:03:37,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091366523] [2022-04-15 07:03:37,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:03:37,454 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.103896103896104) internal successors, (85), 76 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 92 [2022-04-15 07:03:37,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:03:37,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 77 states, 77 states have (on average 1.103896103896104) internal successors, (85), 76 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:37,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:37,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-04-15 07:03:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:37,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-04-15 07:03:37,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=5628, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 07:03:37,505 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 77 states, 77 states have (on average 1.103896103896104) internal successors, (85), 76 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:48,105 INFO L93 Difference]: Finished difference Result 195 states and 204 transitions. [2022-04-15 07:03:48,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-04-15 07:03:48,105 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.103896103896104) internal successors, (85), 76 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 92 [2022-04-15 07:03:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:03:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.103896103896104) internal successors, (85), 76 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 124 transitions. [2022-04-15 07:03:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.103896103896104) internal successors, (85), 76 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 124 transitions. [2022-04-15 07:03:48,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 124 transitions. [2022-04-15 07:03:48,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:48,189 INFO L225 Difference]: With dead ends: 195 [2022-04-15 07:03:48,190 INFO L226 Difference]: Without dead ends: 104 [2022-04-15 07:03:48,191 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=666, Invalid=21984, Unknown=0, NotChecked=0, Total=22650 [2022-04-15 07:03:48,191 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5954 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 5954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:03:48,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 111 Invalid, 6113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 5954 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 07:03:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-15 07:03:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2022-04-15 07:03:48,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:03:48,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 99 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 91 states have internal predecessors, (94), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:48,443 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 99 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 91 states have internal predecessors, (94), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:48,443 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 99 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 91 states have internal predecessors, (94), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:48,444 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-04-15 07:03:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2022-04-15 07:03:48,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:48,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:48,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 91 states have internal predecessors, (94), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 104 states. [2022-04-15 07:03:48,444 INFO L87 Difference]: Start difference. First operand has 99 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 91 states have internal predecessors, (94), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 104 states. [2022-04-15 07:03:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:48,445 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-04-15 07:03:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2022-04-15 07:03:48,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:48,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:48,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:03:48,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:03:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 91 states have internal predecessors, (94), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:03:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2022-04-15 07:03:48,446 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 92 [2022-04-15 07:03:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:03:48,446 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2022-04-15 07:03:48,446 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.103896103896104) internal successors, (85), 76 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:48,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 102 transitions. [2022-04-15 07:03:48,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-04-15 07:03:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 07:03:48,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:03:48,922 INFO L499 BasicCegarLoop]: trace histogram [73, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:03:48,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-04-15 07:03:48,923 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:03:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:03:48,923 INFO L85 PathProgramCache]: Analyzing trace with hash 25221634, now seen corresponding path program 73 times [2022-04-15 07:03:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:48,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829874068] [2022-04-15 07:03:49,389 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:49,930 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:49,930 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:03:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1245333560, now seen corresponding path program 1 times [2022-04-15 07:03:49,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:03:49,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000237477] [2022-04-15 07:03:49,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:03:49,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:03:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:03:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:49,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {46777#(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(12, 2);call #Ultimate.allocInit(12, 3); {46771#true} is VALID [2022-04-15 07:03:49,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {46771#true} assume true; {46771#true} is VALID [2022-04-15 07:03:49,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46771#true} {46771#true} #63#return; {46771#true} is VALID [2022-04-15 07:03:49,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {46771#true} call ULTIMATE.init(); {46777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:03:49,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {46777#(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(12, 2);call #Ultimate.allocInit(12, 3); {46771#true} is VALID [2022-04-15 07:03:49,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {46771#true} assume true; {46771#true} is VALID [2022-04-15 07:03:49,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46771#true} {46771#true} #63#return; {46771#true} is VALID [2022-04-15 07:03:49,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {46771#true} call #t~ret7 := main(); {46771#true} is VALID [2022-04-15 07:03:49,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {46771#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {46771#true} is VALID [2022-04-15 07:03:49,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {46771#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {46776#(= main_~y~0 0)} is VALID [2022-04-15 07:03:49,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {46776#(= main_~y~0 0)} [219] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_442 v_main_~y~0_441) (= v_main_~z~0_6362 v_main_~z~0_6288) (= |v_main_#t~post5_364| |v_main_#t~post5_363|) (= |v_main_#t~post4_3435| |v_main_#t~post4_3362|)) InVars {main_#t~post4=|v_main_#t~post4_3435|, main_~y~0=v_main_~y~0_442, main_#t~post5=|v_main_#t~post5_364|, main_~z~0=v_main_~z~0_6362} OutVars{main_#t~post4=|v_main_#t~post4_3362|, main_#t~post5=|v_main_#t~post5_363|, main_~y~0=v_main_~y~0_441, main_~z~0=v_main_~z~0_6288} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {46776#(= main_~y~0 0)} is VALID [2022-04-15 07:03:49,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {46776#(= main_~y~0 0)} [218] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {46772#false} is VALID [2022-04-15 07:03:49,983 INFO L272 TraceCheckUtils]: 9: Hoare triple {46772#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {46772#false} is VALID [2022-04-15 07:03:49,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {46772#false} ~cond := #in~cond; {46772#false} is VALID [2022-04-15 07:03:49,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {46772#false} assume 0 == ~cond; {46772#false} is VALID [2022-04-15 07:03:49,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {46772#false} assume !false; {46772#false} is VALID [2022-04-15 07:03:49,983 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 07:03:49,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:03:49,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000237477] [2022-04-15 07:03:49,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000237477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:03:49,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:03:49,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:03:52,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:03:52,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829874068] [2022-04-15 07:03:52,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829874068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:03:52,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:03:52,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2022-04-15 07:03:52,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823964760] [2022-04-15 07:03:52,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:03:52,554 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 77 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2022-04-15 07:03:52,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:03:52,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 78 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 77 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:03:52,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:52,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-04-15 07:03:52,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:52,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-04-15 07:03:52,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=5779, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 07:03:52,611 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand has 78 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 77 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:04,614 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2022-04-15 07:04:04,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-04-15 07:04:04,614 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 77 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2022-04-15 07:04:04,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:04:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 77 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 125 transitions. [2022-04-15 07:04:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 77 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 125 transitions. [2022-04-15 07:04:04,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 125 transitions. [2022-04-15 07:04:04,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:04,700 INFO L225 Difference]: With dead ends: 197 [2022-04-15 07:04:04,700 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 07:04:04,701 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=675, Invalid=22581, Unknown=0, NotChecked=0, Total=23256 [2022-04-15 07:04:04,701 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 6849 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 7009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 6849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:04:04,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 376 Invalid, 7009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 6849 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 07:04:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 07:04:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2022-04-15 07:04:04,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:04:04,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 100 states, 91 states have (on average 1.043956043956044) internal successors, (95), 92 states have internal predecessors, (95), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:04,963 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 100 states, 91 states have (on average 1.043956043956044) internal successors, (95), 92 states have internal predecessors, (95), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:04,963 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 100 states, 91 states have (on average 1.043956043956044) internal successors, (95), 92 states have internal predecessors, (95), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:04,965 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-04-15 07:04:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-04-15 07:04:04,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:04,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:04,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 91 states have (on average 1.043956043956044) internal successors, (95), 92 states have internal predecessors, (95), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 105 states. [2022-04-15 07:04:04,965 INFO L87 Difference]: Start difference. First operand has 100 states, 91 states have (on average 1.043956043956044) internal successors, (95), 92 states have internal predecessors, (95), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 105 states. [2022-04-15 07:04:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:04,967 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-04-15 07:04:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-04-15 07:04:04,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:04,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:04,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:04:04,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:04:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.043956043956044) internal successors, (95), 92 states have internal predecessors, (95), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2022-04-15 07:04:04,968 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 93 [2022-04-15 07:04:04,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:04:04,969 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2022-04-15 07:04:04,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 77 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:04,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 103 transitions. [2022-04-15 07:04:05,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2022-04-15 07:04:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 07:04:05,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:04:05,490 INFO L499 BasicCegarLoop]: trace histogram [74, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:04:05,490 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-04-15 07:04:05,490 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:04:05,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:04:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1734153250, now seen corresponding path program 74 times [2022-04-15 07:04:05,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:05,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877210148] [2022-04-15 07:04:10,236 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:04:10,362 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:10,951 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:10,952 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:04:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1304438904, now seen corresponding path program 1 times [2022-04-15 07:04:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:04:10,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629451922] [2022-04-15 07:04:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:04:10,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:04:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:04:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:10,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {47815#(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(12, 2);call #Ultimate.allocInit(12, 3); {47809#true} is VALID [2022-04-15 07:04:10,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {47809#true} assume true; {47809#true} is VALID [2022-04-15 07:04:10,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47809#true} {47809#true} #63#return; {47809#true} is VALID [2022-04-15 07:04:10,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {47809#true} call ULTIMATE.init(); {47815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:04:10,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {47815#(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(12, 2);call #Ultimate.allocInit(12, 3); {47809#true} is VALID [2022-04-15 07:04:10,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {47809#true} assume true; {47809#true} is VALID [2022-04-15 07:04:10,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47809#true} {47809#true} #63#return; {47809#true} is VALID [2022-04-15 07:04:10,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {47809#true} call #t~ret7 := main(); {47809#true} is VALID [2022-04-15 07:04:10,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {47809#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {47809#true} is VALID [2022-04-15 07:04:10,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {47809#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {47814#(= main_~y~0 0)} is VALID [2022-04-15 07:04:10,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {47814#(= main_~y~0 0)} [221] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_448 v_main_~y~0_447) (= v_main_~z~0_6523 v_main_~z~0_6448) (= |v_main_#t~post5_369| |v_main_#t~post5_368|) (= |v_main_#t~post4_3519| |v_main_#t~post4_3445|)) InVars {main_#t~post4=|v_main_#t~post4_3519|, main_~y~0=v_main_~y~0_448, main_#t~post5=|v_main_#t~post5_369|, main_~z~0=v_main_~z~0_6523} OutVars{main_#t~post4=|v_main_#t~post4_3445|, main_#t~post5=|v_main_#t~post5_368|, main_~y~0=v_main_~y~0_447, main_~z~0=v_main_~z~0_6448} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {47814#(= main_~y~0 0)} is VALID [2022-04-15 07:04:10,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {47814#(= main_~y~0 0)} [220] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {47810#false} is VALID [2022-04-15 07:04:10,991 INFO L272 TraceCheckUtils]: 9: Hoare triple {47810#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {47810#false} is VALID [2022-04-15 07:04:10,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {47810#false} ~cond := #in~cond; {47810#false} is VALID [2022-04-15 07:04:10,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {47810#false} assume 0 == ~cond; {47810#false} is VALID [2022-04-15 07:04:10,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {47810#false} assume !false; {47810#false} is VALID [2022-04-15 07:04:10,991 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 07:04:10,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:04:10,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629451922] [2022-04-15 07:04:10,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629451922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:10,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:10,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:04:13,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:04:13,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877210148] [2022-04-15 07:04:13,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877210148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:13,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:13,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2022-04-15 07:04:13,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284184806] [2022-04-15 07:04:13,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:04:13,601 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2022-04-15 07:04:13,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:04:13,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 79 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:13,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:13,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-04-15 07:04:13,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:13,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-04-15 07:04:13,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=5932, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 07:04:13,654 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand has 79 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:25,743 INFO L93 Difference]: Finished difference Result 199 states and 208 transitions. [2022-04-15 07:04:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-04-15 07:04:25,744 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2022-04-15 07:04:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:04:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 126 transitions. [2022-04-15 07:04:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 126 transitions. [2022-04-15 07:04:25,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 126 transitions. [2022-04-15 07:04:25,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:25,830 INFO L225 Difference]: With dead ends: 199 [2022-04-15 07:04:25,831 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 07:04:25,832 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=684, Invalid=23186, Unknown=0, NotChecked=0, Total=23870 [2022-04-15 07:04:25,832 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 6877 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 7039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 6877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:04:25,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 331 Invalid, 7039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 6877 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 07:04:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 07:04:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2022-04-15 07:04:26,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:04:26,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 101 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 93 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:26,107 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 101 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 93 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:26,107 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 101 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 93 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:26,108 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-15 07:04:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-15 07:04:26,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:26,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:26,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 93 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 106 states. [2022-04-15 07:04:26,108 INFO L87 Difference]: Start difference. First operand has 101 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 93 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 106 states. [2022-04-15 07:04:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:26,109 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-15 07:04:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-15 07:04:26,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:26,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:26,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:04:26,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:04:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 93 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2022-04-15 07:04:26,111 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 94 [2022-04-15 07:04:26,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:04:26,111 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2022-04-15 07:04:26,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:26,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 104 transitions. [2022-04-15 07:04:26,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-04-15 07:04:26,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 07:04:26,610 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:04:26,610 INFO L499 BasicCegarLoop]: trace histogram [75, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:04:26,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-04-15 07:04:26,611 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:04:26,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:04:26,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1123541502, now seen corresponding path program 75 times [2022-04-15 07:04:26,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:26,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [755794564] [2022-04-15 07:04:28,860 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:04:29,019 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:29,550 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:29,551 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:04:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1363544248, now seen corresponding path program 1 times [2022-04-15 07:04:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:04:29,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154468627] [2022-04-15 07:04:29,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:04:29,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:04:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:04:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:29,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {48864#(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(12, 2);call #Ultimate.allocInit(12, 3); {48858#true} is VALID [2022-04-15 07:04:29,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {48858#true} assume true; {48858#true} is VALID [2022-04-15 07:04:29,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48858#true} {48858#true} #63#return; {48858#true} is VALID [2022-04-15 07:04:29,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {48858#true} call ULTIMATE.init(); {48864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:04:29,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {48864#(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(12, 2);call #Ultimate.allocInit(12, 3); {48858#true} is VALID [2022-04-15 07:04:29,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {48858#true} assume true; {48858#true} is VALID [2022-04-15 07:04:29,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48858#true} {48858#true} #63#return; {48858#true} is VALID [2022-04-15 07:04:29,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {48858#true} call #t~ret7 := main(); {48858#true} is VALID [2022-04-15 07:04:29,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {48858#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {48858#true} is VALID [2022-04-15 07:04:29,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {48858#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {48863#(= main_~y~0 0)} is VALID [2022-04-15 07:04:29,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {48863#(= main_~y~0 0)} [223] L22-2-->L22-3_primed: Formula: (and (= |v_main_#t~post5_374| |v_main_#t~post5_373|) (= |v_main_#t~post4_3604| |v_main_#t~post4_3529|) (= v_main_~z~0_6686 v_main_~z~0_6610) (= v_main_~y~0_454 v_main_~y~0_453)) InVars {main_#t~post4=|v_main_#t~post4_3604|, main_~y~0=v_main_~y~0_454, main_#t~post5=|v_main_#t~post5_374|, main_~z~0=v_main_~z~0_6686} OutVars{main_#t~post4=|v_main_#t~post4_3529|, main_#t~post5=|v_main_#t~post5_373|, main_~y~0=v_main_~y~0_453, main_~z~0=v_main_~z~0_6610} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {48863#(= main_~y~0 0)} is VALID [2022-04-15 07:04:29,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {48863#(= main_~y~0 0)} [222] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {48859#false} is VALID [2022-04-15 07:04:29,587 INFO L272 TraceCheckUtils]: 9: Hoare triple {48859#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {48859#false} is VALID [2022-04-15 07:04:29,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {48859#false} ~cond := #in~cond; {48859#false} is VALID [2022-04-15 07:04:29,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {48859#false} assume 0 == ~cond; {48859#false} is VALID [2022-04-15 07:04:29,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {48859#false} assume !false; {48859#false} is VALID [2022-04-15 07:04:29,587 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 07:04:29,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:04:29,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154468627] [2022-04-15 07:04:29,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154468627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:29,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:29,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:04:32,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:04:32,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [755794564] [2022-04-15 07:04:32,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [755794564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:32,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:32,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2022-04-15 07:04:32,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016628206] [2022-04-15 07:04:32,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:04:32,218 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.1) internal successors, (88), 79 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2022-04-15 07:04:32,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:04:32,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 80 states, 80 states have (on average 1.1) internal successors, (88), 79 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:32,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:32,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-04-15 07:04:32,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:32,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-04-15 07:04:32,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=6087, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 07:04:32,270 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand has 80 states, 80 states have (on average 1.1) internal successors, (88), 79 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:44,345 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2022-04-15 07:04:44,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-04-15 07:04:44,345 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.1) internal successors, (88), 79 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2022-04-15 07:04:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:04:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.1) internal successors, (88), 79 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 127 transitions. [2022-04-15 07:04:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.1) internal successors, (88), 79 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 127 transitions. [2022-04-15 07:04:44,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 127 transitions. [2022-04-15 07:04:44,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:44,431 INFO L225 Difference]: With dead ends: 201 [2022-04-15 07:04:44,431 INFO L226 Difference]: Without dead ends: 107 [2022-04-15 07:04:44,432 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=693, Invalid=23799, Unknown=0, NotChecked=0, Total=24492 [2022-04-15 07:04:44,433 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 6864 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 7029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 6864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:04:44,433 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 271 Invalid, 7029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 6864 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 07:04:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-15 07:04:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2022-04-15 07:04:44,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:04:44,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 102 states, 93 states have (on average 1.043010752688172) internal successors, (97), 94 states have internal predecessors, (97), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:44,699 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 102 states, 93 states have (on average 1.043010752688172) internal successors, (97), 94 states have internal predecessors, (97), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:44,699 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 102 states, 93 states have (on average 1.043010752688172) internal successors, (97), 94 states have internal predecessors, (97), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:44,700 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-04-15 07:04:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-04-15 07:04:44,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:44,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:44,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 93 states have (on average 1.043010752688172) internal successors, (97), 94 states have internal predecessors, (97), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 107 states. [2022-04-15 07:04:44,701 INFO L87 Difference]: Start difference. First operand has 102 states, 93 states have (on average 1.043010752688172) internal successors, (97), 94 states have internal predecessors, (97), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 107 states. [2022-04-15 07:04:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:44,701 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-04-15 07:04:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-04-15 07:04:44,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:44,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:44,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:04:44,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:04:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 93 states have (on average 1.043010752688172) internal successors, (97), 94 states have internal predecessors, (97), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:04:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-15 07:04:44,703 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 95 [2022-04-15 07:04:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:04:44,703 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-15 07:04:44,703 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.1) internal successors, (88), 79 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:44,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-15 07:04:45,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 07:04:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 07:04:45,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:04:45,214 INFO L499 BasicCegarLoop]: trace histogram [76, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:04:45,214 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-04-15 07:04:45,214 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:04:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:04:45,214 INFO L85 PathProgramCache]: Analyzing trace with hash 482234402, now seen corresponding path program 76 times [2022-04-15 07:04:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:45,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2058805428] [2022-04-15 07:04:47,396 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:04:47,592 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:48,191 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:48,191 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:04:48,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1422649592, now seen corresponding path program 1 times [2022-04-15 07:04:48,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:04:48,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557936389] [2022-04-15 07:04:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:04:48,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:04:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:04:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:48,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {49924#(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(12, 2);call #Ultimate.allocInit(12, 3); {49918#true} is VALID [2022-04-15 07:04:48,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {49918#true} assume true; {49918#true} is VALID [2022-04-15 07:04:48,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49918#true} {49918#true} #63#return; {49918#true} is VALID [2022-04-15 07:04:48,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {49918#true} call ULTIMATE.init(); {49924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:04:48,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {49924#(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(12, 2);call #Ultimate.allocInit(12, 3); {49918#true} is VALID [2022-04-15 07:04:48,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {49918#true} assume true; {49918#true} is VALID [2022-04-15 07:04:48,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49918#true} {49918#true} #63#return; {49918#true} is VALID [2022-04-15 07:04:48,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {49918#true} call #t~ret7 := main(); {49918#true} is VALID [2022-04-15 07:04:48,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {49918#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {49918#true} is VALID [2022-04-15 07:04:48,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {49918#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {49923#(= main_~y~0 0)} is VALID [2022-04-15 07:04:48,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {49923#(= main_~y~0 0)} [225] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_379| |v_main_#t~post5_378|)) (.cse1 (= |v_main_#t~post4_3690| |v_main_#t~post4_3614|)) (.cse2 (= v_main_~z~0_6851 v_main_~z~0_6774))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_459 v_main_~y~0_460)) (and .cse0 .cse1 (= v_main_~y~0_460 v_main_~y~0_459) .cse2))) InVars {main_#t~post4=|v_main_#t~post4_3690|, main_~y~0=v_main_~y~0_460, main_#t~post5=|v_main_#t~post5_379|, main_~z~0=v_main_~z~0_6851} OutVars{main_#t~post4=|v_main_#t~post4_3614|, main_#t~post5=|v_main_#t~post5_378|, main_~y~0=v_main_~y~0_459, main_~z~0=v_main_~z~0_6774} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {49923#(= main_~y~0 0)} is VALID [2022-04-15 07:04:48,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {49923#(= main_~y~0 0)} [224] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {49919#false} is VALID [2022-04-15 07:04:48,230 INFO L272 TraceCheckUtils]: 9: Hoare triple {49919#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {49919#false} is VALID [2022-04-15 07:04:48,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {49919#false} ~cond := #in~cond; {49919#false} is VALID [2022-04-15 07:04:48,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {49919#false} assume 0 == ~cond; {49919#false} is VALID [2022-04-15 07:04:48,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {49919#false} assume !false; {49919#false} is VALID [2022-04-15 07:04:48,230 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 07:04:48,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:04:48,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557936389] [2022-04-15 07:04:48,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557936389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:48,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:48,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:04:50,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:04:50,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2058805428] [2022-04-15 07:04:50,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2058805428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:50,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:50,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2022-04-15 07:04:50,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309051101] [2022-04-15 07:04:50,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:04:50,863 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2022-04-15 07:04:50,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:04:50,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 81 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:04:50,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:50,914 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-04-15 07:04:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:50,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-04-15 07:04:50,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=6244, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 07:04:50,915 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand has 81 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:02,933 INFO L93 Difference]: Finished difference Result 203 states and 212 transitions. [2022-04-15 07:05:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-04-15 07:05:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2022-04-15 07:05:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:05:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 128 transitions. [2022-04-15 07:05:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 128 transitions. [2022-04-15 07:05:02,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 128 transitions. [2022-04-15 07:05:03,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:03,022 INFO L225 Difference]: With dead ends: 203 [2022-04-15 07:05:03,022 INFO L226 Difference]: Without dead ends: 108 [2022-04-15 07:05:03,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=702, Invalid=24420, Unknown=0, NotChecked=0, Total=25122 [2022-04-15 07:05:03,023 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 6840 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 7007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 6840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:05:03,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 206 Invalid, 7007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 6840 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 07:05:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-15 07:05:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2022-04-15 07:05:03,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:05:03,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 103 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 95 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:03,327 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 103 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 95 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:03,327 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 103 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 95 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:03,332 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-04-15 07:05:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-04-15 07:05:03,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:03,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:03,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 95 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 108 states. [2022-04-15 07:05:03,333 INFO L87 Difference]: Start difference. First operand has 103 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 95 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 108 states. [2022-04-15 07:05:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:03,334 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-04-15 07:05:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-04-15 07:05:03,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:03,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:03,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:05:03,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:05:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 95 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2022-04-15 07:05:03,336 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 96 [2022-04-15 07:05:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:05:03,336 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2022-04-15 07:05:03,336 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:03,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 106 transitions. [2022-04-15 07:05:03,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-04-15 07:05:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 07:05:03,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:05:03,852 INFO L499 BasicCegarLoop]: trace histogram [77, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:05:03,852 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-04-15 07:05:03,852 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:05:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:05:03,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1278320126, now seen corresponding path program 77 times [2022-04-15 07:05:03,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:03,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063404111] [2022-04-15 07:05:04,242 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:04,761 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:04,761 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:05:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1481754936, now seen corresponding path program 1 times [2022-04-15 07:05:04,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:05:04,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280184576] [2022-04-15 07:05:04,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:05:04,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:05:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:05:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:04,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {50995#(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(12, 2);call #Ultimate.allocInit(12, 3); {50989#true} is VALID [2022-04-15 07:05:04,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {50989#true} assume true; {50989#true} is VALID [2022-04-15 07:05:04,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50989#true} {50989#true} #63#return; {50989#true} is VALID [2022-04-15 07:05:04,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {50989#true} call ULTIMATE.init(); {50995#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:05:04,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {50995#(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(12, 2);call #Ultimate.allocInit(12, 3); {50989#true} is VALID [2022-04-15 07:05:04,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {50989#true} assume true; {50989#true} is VALID [2022-04-15 07:05:04,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50989#true} {50989#true} #63#return; {50989#true} is VALID [2022-04-15 07:05:04,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {50989#true} call #t~ret7 := main(); {50989#true} is VALID [2022-04-15 07:05:04,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {50989#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {50989#true} is VALID [2022-04-15 07:05:04,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {50989#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {50994#(= main_~y~0 0)} is VALID [2022-04-15 07:05:04,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {50994#(= main_~y~0 0)} [227] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_384| |v_main_#t~post5_383|)) (.cse1 (= v_main_~y~0_466 v_main_~y~0_465)) (.cse2 (= |v_main_#t~post4_3777| |v_main_#t~post4_3700|))) (or (and .cse0 .cse1 (= v_main_~z~0_7018 v_main_~z~0_6940) .cse2) (and .cse0 .cse1 (= v_main_~z~0_6940 v_main_~z~0_7018) .cse2))) InVars {main_#t~post4=|v_main_#t~post4_3777|, main_~y~0=v_main_~y~0_466, main_#t~post5=|v_main_#t~post5_384|, main_~z~0=v_main_~z~0_7018} OutVars{main_#t~post4=|v_main_#t~post4_3700|, main_#t~post5=|v_main_#t~post5_383|, main_~y~0=v_main_~y~0_465, main_~z~0=v_main_~z~0_6940} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {50994#(= main_~y~0 0)} is VALID [2022-04-15 07:05:04,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {50994#(= main_~y~0 0)} [226] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {50990#false} is VALID [2022-04-15 07:05:04,792 INFO L272 TraceCheckUtils]: 9: Hoare triple {50990#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {50990#false} is VALID [2022-04-15 07:05:04,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {50990#false} ~cond := #in~cond; {50990#false} is VALID [2022-04-15 07:05:04,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {50990#false} assume 0 == ~cond; {50990#false} is VALID [2022-04-15 07:05:04,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {50990#false} assume !false; {50990#false} is VALID [2022-04-15 07:05:04,793 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 07:05:04,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:05:04,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280184576] [2022-04-15 07:05:04,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280184576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:05:04,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:05:04,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:05:07,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:05:07,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063404111] [2022-04-15 07:05:07,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063404111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:05:07,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:05:07,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2022-04-15 07:05:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597519572] [2022-04-15 07:05:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:05:07,557 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.0975609756097562) internal successors, (90), 81 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2022-04-15 07:05:07,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:05:07,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 82 states, 82 states have (on average 1.0975609756097562) internal successors, (90), 81 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:07,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:07,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-04-15 07:05:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:07,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-04-15 07:05:07,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=6403, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 07:05:07,609 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand has 82 states, 82 states have (on average 1.0975609756097562) internal successors, (90), 81 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:19,956 INFO L93 Difference]: Finished difference Result 205 states and 214 transitions. [2022-04-15 07:05:19,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-04-15 07:05:19,957 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.0975609756097562) internal successors, (90), 81 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2022-04-15 07:05:19,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:05:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.0975609756097562) internal successors, (90), 81 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2022-04-15 07:05:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.0975609756097562) internal successors, (90), 81 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2022-04-15 07:05:19,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 129 transitions. [2022-04-15 07:05:20,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:20,054 INFO L225 Difference]: With dead ends: 205 [2022-04-15 07:05:20,054 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 07:05:20,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=711, Invalid=25049, Unknown=0, NotChecked=0, Total=25760 [2022-04-15 07:05:20,056 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 7029 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 7029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:05:20,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 216 Invalid, 7197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 7029 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 07:05:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 07:05:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2022-04-15 07:05:20,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:05:20,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 104 states, 95 states have (on average 1.0421052631578946) internal successors, (99), 96 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:20,338 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 104 states, 95 states have (on average 1.0421052631578946) internal successors, (99), 96 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:20,338 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 104 states, 95 states have (on average 1.0421052631578946) internal successors, (99), 96 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:20,339 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2022-04-15 07:05:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2022-04-15 07:05:20,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:20,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:20,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 95 states have (on average 1.0421052631578946) internal successors, (99), 96 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 109 states. [2022-04-15 07:05:20,340 INFO L87 Difference]: Start difference. First operand has 104 states, 95 states have (on average 1.0421052631578946) internal successors, (99), 96 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 109 states. [2022-04-15 07:05:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:20,340 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2022-04-15 07:05:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2022-04-15 07:05:20,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:20,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:20,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:05:20,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:05:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 95 states have (on average 1.0421052631578946) internal successors, (99), 96 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2022-04-15 07:05:20,341 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 97 [2022-04-15 07:05:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:05:20,342 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2022-04-15 07:05:20,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 1.0975609756097562) internal successors, (90), 81 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:20,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 107 transitions. [2022-04-15 07:05:20,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2022-04-15 07:05:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 07:05:20,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:05:20,861 INFO L499 BasicCegarLoop]: trace histogram [78, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:05:20,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-04-15 07:05:20,862 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:05:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:05:20,862 INFO L85 PathProgramCache]: Analyzing trace with hash -20935646, now seen corresponding path program 78 times [2022-04-15 07:05:20,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:20,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [481689051] [2022-04-15 07:05:23,358 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:05:23,495 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:24,206 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:24,206 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:05:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1540860280, now seen corresponding path program 1 times [2022-04-15 07:05:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:05:24,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070232123] [2022-04-15 07:05:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:05:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:05:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:24,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:05:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:24,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {52077#(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(12, 2);call #Ultimate.allocInit(12, 3); {52071#true} is VALID [2022-04-15 07:05:24,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {52071#true} assume true; {52071#true} is VALID [2022-04-15 07:05:24,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52071#true} {52071#true} #63#return; {52071#true} is VALID [2022-04-15 07:05:24,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {52071#true} call ULTIMATE.init(); {52077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:05:24,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {52077#(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(12, 2);call #Ultimate.allocInit(12, 3); {52071#true} is VALID [2022-04-15 07:05:24,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {52071#true} assume true; {52071#true} is VALID [2022-04-15 07:05:24,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52071#true} {52071#true} #63#return; {52071#true} is VALID [2022-04-15 07:05:24,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {52071#true} call #t~ret7 := main(); {52071#true} is VALID [2022-04-15 07:05:24,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {52071#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {52071#true} is VALID [2022-04-15 07:05:24,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {52071#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {52076#(= main_~y~0 0)} is VALID [2022-04-15 07:05:24,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {52076#(= main_~y~0 0)} [229] L22-2-->L22-3_primed: Formula: (and (= v_main_~z~0_7187 v_main_~z~0_7108) (= v_main_~y~0_472 v_main_~y~0_471) (= |v_main_#t~post5_389| |v_main_#t~post5_388|) (= |v_main_#t~post4_3865| |v_main_#t~post4_3787|)) InVars {main_#t~post4=|v_main_#t~post4_3865|, main_~y~0=v_main_~y~0_472, main_#t~post5=|v_main_#t~post5_389|, main_~z~0=v_main_~z~0_7187} OutVars{main_#t~post4=|v_main_#t~post4_3787|, main_#t~post5=|v_main_#t~post5_388|, main_~y~0=v_main_~y~0_471, main_~z~0=v_main_~z~0_7108} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {52076#(= main_~y~0 0)} is VALID [2022-04-15 07:05:24,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {52076#(= main_~y~0 0)} [228] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {52072#false} is VALID [2022-04-15 07:05:24,248 INFO L272 TraceCheckUtils]: 9: Hoare triple {52072#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {52072#false} is VALID [2022-04-15 07:05:24,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {52072#false} ~cond := #in~cond; {52072#false} is VALID [2022-04-15 07:05:24,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {52072#false} assume 0 == ~cond; {52072#false} is VALID [2022-04-15 07:05:24,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {52072#false} assume !false; {52072#false} is VALID [2022-04-15 07:05:24,249 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 07:05:24,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:05:24,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070232123] [2022-04-15 07:05:24,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070232123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:05:24,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:05:24,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:05:27,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:05:27,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [481689051] [2022-04-15 07:05:27,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [481689051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:05:27,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:05:27,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2022-04-15 07:05:27,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924205217] [2022-04-15 07:05:27,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:05:27,146 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 82 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2022-04-15 07:05:27,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:05:27,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 83 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 82 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:27,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:27,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-04-15 07:05:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:27,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-04-15 07:05:27,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=6564, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 07:05:27,200 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand has 83 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 82 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:39,545 INFO L93 Difference]: Finished difference Result 207 states and 216 transitions. [2022-04-15 07:05:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-15 07:05:39,545 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 82 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2022-04-15 07:05:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:05:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 82 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2022-04-15 07:05:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 82 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2022-04-15 07:05:39,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 130 transitions. [2022-04-15 07:05:39,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:39,636 INFO L225 Difference]: With dead ends: 207 [2022-04-15 07:05:39,636 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 07:05:39,637 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=720, Invalid=25686, Unknown=0, NotChecked=0, Total=26406 [2022-04-15 07:05:39,637 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6798 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 6798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:05:39,637 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 76 Invalid, 6969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 6798 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 07:05:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 07:05:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2022-04-15 07:05:39,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:05:39,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 105 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 97 states have internal predecessors, (100), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:39,926 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 105 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 97 states have internal predecessors, (100), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:39,926 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 105 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 97 states have internal predecessors, (100), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:39,927 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2022-04-15 07:05:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2022-04-15 07:05:39,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:39,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:39,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 97 states have internal predecessors, (100), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 110 states. [2022-04-15 07:05:39,927 INFO L87 Difference]: Start difference. First operand has 105 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 97 states have internal predecessors, (100), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 110 states. [2022-04-15 07:05:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:39,928 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2022-04-15 07:05:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2022-04-15 07:05:39,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:39,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:39,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:05:39,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:05:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 97 states have internal predecessors, (100), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:05:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2022-04-15 07:05:39,929 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 98 [2022-04-15 07:05:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:05:39,929 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2022-04-15 07:05:39,929 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 82 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:39,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 108 transitions. [2022-04-15 07:05:40,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2022-04-15 07:05:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 07:05:40,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:05:40,475 INFO L499 BasicCegarLoop]: trace histogram [79, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:05:40,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-04-15 07:05:40,475 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:05:40,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:05:40,475 INFO L85 PathProgramCache]: Analyzing trace with hash 303277570, now seen corresponding path program 79 times [2022-04-15 07:05:40,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:40,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957507134] [2022-04-15 07:05:44,222 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:05:44,379 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:45,038 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:45,038 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:05:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1599965624, now seen corresponding path program 1 times [2022-04-15 07:05:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:05:45,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580069732] [2022-04-15 07:05:45,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:05:45,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:05:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:45,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:05:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:45,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {53170#(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(12, 2);call #Ultimate.allocInit(12, 3); {53164#true} is VALID [2022-04-15 07:05:45,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {53164#true} assume true; {53164#true} is VALID [2022-04-15 07:05:45,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53164#true} {53164#true} #63#return; {53164#true} is VALID [2022-04-15 07:05:45,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {53164#true} call ULTIMATE.init(); {53170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:05:45,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {53170#(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(12, 2);call #Ultimate.allocInit(12, 3); {53164#true} is VALID [2022-04-15 07:05:45,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {53164#true} assume true; {53164#true} is VALID [2022-04-15 07:05:45,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53164#true} {53164#true} #63#return; {53164#true} is VALID [2022-04-15 07:05:45,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {53164#true} call #t~ret7 := main(); {53164#true} is VALID [2022-04-15 07:05:45,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {53164#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {53164#true} is VALID [2022-04-15 07:05:45,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {53164#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {53169#(= main_~y~0 0)} is VALID [2022-04-15 07:05:45,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {53169#(= main_~y~0 0)} [231] L22-2-->L22-3_primed: Formula: (and (= v_main_~y~0_478 v_main_~y~0_477) (= |v_main_#t~post4_3954| |v_main_#t~post4_3875|) (= v_main_~z~0_7358 v_main_~z~0_7278) (= |v_main_#t~post5_394| |v_main_#t~post5_393|)) InVars {main_#t~post4=|v_main_#t~post4_3954|, main_~y~0=v_main_~y~0_478, main_#t~post5=|v_main_#t~post5_394|, main_~z~0=v_main_~z~0_7358} OutVars{main_#t~post4=|v_main_#t~post4_3875|, main_#t~post5=|v_main_#t~post5_393|, main_~y~0=v_main_~y~0_477, main_~z~0=v_main_~z~0_7278} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {53169#(= main_~y~0 0)} is VALID [2022-04-15 07:05:45,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {53169#(= main_~y~0 0)} [230] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {53165#false} is VALID [2022-04-15 07:05:45,072 INFO L272 TraceCheckUtils]: 9: Hoare triple {53165#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {53165#false} is VALID [2022-04-15 07:05:45,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {53165#false} ~cond := #in~cond; {53165#false} is VALID [2022-04-15 07:05:45,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {53165#false} assume 0 == ~cond; {53165#false} is VALID [2022-04-15 07:05:45,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {53165#false} assume !false; {53165#false} is VALID [2022-04-15 07:05:45,072 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 07:05:45,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:05:45,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580069732] [2022-04-15 07:05:45,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580069732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:05:45,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:05:45,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:05:48,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:05:48,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957507134] [2022-04-15 07:05:48,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957507134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:05:48,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:05:48,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2022-04-15 07:05:48,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665583218] [2022-04-15 07:05:48,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:05:48,105 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 83 states have internal predecessors, (92), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2022-04-15 07:05:48,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:05:48,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 84 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 83 states have internal predecessors, (92), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:05:48,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:48,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-04-15 07:05:48,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:48,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-04-15 07:05:48,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=6727, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 07:05:48,159 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand has 84 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 83 states have internal predecessors, (92), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:06:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:02,188 INFO L93 Difference]: Finished difference Result 209 states and 218 transitions. [2022-04-15 07:06:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-04-15 07:06:02,188 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 83 states have internal predecessors, (92), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2022-04-15 07:06:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:06:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 83 states have internal predecessors, (92), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:06:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2022-04-15 07:06:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 83 states have internal predecessors, (92), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:06:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2022-04-15 07:06:02,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 131 transitions. [2022-04-15 07:06:02,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:06:02,284 INFO L225 Difference]: With dead ends: 209 [2022-04-15 07:06:02,284 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 07:06:02,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=729, Invalid=26331, Unknown=0, NotChecked=0, Total=27060 [2022-04-15 07:06:02,286 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 7845 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 8017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 7845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:06:02,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 391 Invalid, 8017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 7845 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 07:06:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 07:06:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-04-15 07:06:02,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:06:02,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 106 states, 97 states have (on average 1.041237113402062) internal successors, (101), 98 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:06:02,626 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 106 states, 97 states have (on average 1.041237113402062) internal successors, (101), 98 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:06:02,626 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 106 states, 97 states have (on average 1.041237113402062) internal successors, (101), 98 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:06:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:02,627 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-04-15 07:06:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2022-04-15 07:06:02,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:06:02,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:06:02,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 97 states have (on average 1.041237113402062) internal successors, (101), 98 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 111 states. [2022-04-15 07:06:02,628 INFO L87 Difference]: Start difference. First operand has 106 states, 97 states have (on average 1.041237113402062) internal successors, (101), 98 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 111 states. [2022-04-15 07:06:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:02,629 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-04-15 07:06:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2022-04-15 07:06:02,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:06:02,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:06:02,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:06:02,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:06:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 97 states have (on average 1.041237113402062) internal successors, (101), 98 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:06:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2022-04-15 07:06:02,631 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 99 [2022-04-15 07:06:02,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:06:02,631 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2022-04-15 07:06:02,631 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 83 states have internal predecessors, (92), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:06:02,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 109 transitions. [2022-04-15 07:06:03,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:06:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2022-04-15 07:06:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 07:06:03,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:06:03,199 INFO L499 BasicCegarLoop]: trace histogram [80, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:06:03,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-04-15 07:06:03,199 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:06:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:06:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1763952674, now seen corresponding path program 80 times [2022-04-15 07:06:03,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:06:03,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92370897] [2022-04-15 07:06:06,056 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:06:06,228 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:06:07,135 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:06:07,136 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:06:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1659070968, now seen corresponding path program 1 times [2022-04-15 07:06:07,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:06:07,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226035910] [2022-04-15 07:06:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:06:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:06:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:07,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:06:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:07,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {54274#(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(12, 2);call #Ultimate.allocInit(12, 3); {54268#true} is VALID [2022-04-15 07:06:07,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {54268#true} assume true; {54268#true} is VALID [2022-04-15 07:06:07,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54268#true} {54268#true} #63#return; {54268#true} is VALID [2022-04-15 07:06:07,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {54268#true} call ULTIMATE.init(); {54274#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:06:07,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {54274#(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(12, 2);call #Ultimate.allocInit(12, 3); {54268#true} is VALID [2022-04-15 07:06:07,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {54268#true} assume true; {54268#true} is VALID [2022-04-15 07:06:07,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54268#true} {54268#true} #63#return; {54268#true} is VALID [2022-04-15 07:06:07,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {54268#true} call #t~ret7 := main(); {54268#true} is VALID [2022-04-15 07:06:07,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {54268#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {54268#true} is VALID [2022-04-15 07:06:07,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {54268#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {54273#(= main_~y~0 0)} is VALID [2022-04-15 07:06:07,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {54273#(= main_~y~0 0)} [233] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~z~0_7531 v_main_~z~0_7450)) (.cse1 (= v_main_~y~0_484 v_main_~y~0_483)) (.cse2 (= |v_main_#t~post5_399| |v_main_#t~post5_398|))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post4_3964| |v_main_#t~post4_4044|)) (and .cse0 .cse1 (= |v_main_#t~post4_4044| |v_main_#t~post4_3964|) .cse2))) InVars {main_#t~post4=|v_main_#t~post4_4044|, main_~y~0=v_main_~y~0_484, main_#t~post5=|v_main_#t~post5_399|, main_~z~0=v_main_~z~0_7531} OutVars{main_#t~post4=|v_main_#t~post4_3964|, main_#t~post5=|v_main_#t~post5_398|, main_~y~0=v_main_~y~0_483, main_~z~0=v_main_~z~0_7450} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {54273#(= main_~y~0 0)} is VALID [2022-04-15 07:06:07,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {54273#(= main_~y~0 0)} [232] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {54269#false} is VALID [2022-04-15 07:06:07,168 INFO L272 TraceCheckUtils]: 9: Hoare triple {54269#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {54269#false} is VALID [2022-04-15 07:06:07,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {54269#false} ~cond := #in~cond; {54269#false} is VALID [2022-04-15 07:06:07,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {54269#false} assume 0 == ~cond; {54269#false} is VALID [2022-04-15 07:06:07,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {54269#false} assume !false; {54269#false} is VALID [2022-04-15 07:06:07,168 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 07:06:07,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:06:07,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226035910] [2022-04-15 07:06:07,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226035910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:06:07,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:06:07,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:06:10,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:06:10,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92370897] [2022-04-15 07:06:10,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92370897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:06:10,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:06:10,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [85] imperfect sequences [] total 85 [2022-04-15 07:06:10,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772721680] [2022-04-15 07:06:10,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:06:10,177 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2022-04-15 07:06:10,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:06:10,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 85 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:06:10,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:06:10,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-04-15 07:06:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:06:10,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-04-15 07:06:10,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=6892, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 07:06:10,232 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand has 85 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)