/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested3-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:04:03,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:04:03,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:04:03,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:04:03,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:04:03,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:04:03,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:04:03,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:04:03,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:04:03,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:04:03,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:04:03,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:04:03,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:04:03,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:04:03,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:04:03,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:04:03,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:04:03,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:04:03,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:04:03,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:04:03,271 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:04:03,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:04:03,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:04:03,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:04:03,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:04:03,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:04:03,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:04:03,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:04:03,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:04:03,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:04:03,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:04:03,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:04:03,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:04:03,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:04:03,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:04:03,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:04:03,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:04:03,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:04:03,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:04:03,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:04:03,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:04:03,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:04:03,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:04:03,293 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:04:03,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:04:03,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:04:03,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:04:03,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:04:03,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:04:03,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:04:03,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:04:03,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:04:03,296 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:04:03,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:04:03,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:04:03,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:04:03,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:04:03,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:04:03,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:04:03,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:04:03,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:04:03,296 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:04:03,296 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:04:03,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:04:03,297 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:04:03,297 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:04:03,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:04:03,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:04:03,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:04:03,451 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:04:03,451 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:04:03,452 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 13:04:03,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d72cb230c/2a2b0f987af34f8dab18583a68aedc0b/FLAGdb9f14e2c [2022-04-15 13:04:03,841 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:04:03,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-1.c [2022-04-15 13:04:03,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d72cb230c/2a2b0f987af34f8dab18583a68aedc0b/FLAGdb9f14e2c [2022-04-15 13:04:03,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d72cb230c/2a2b0f987af34f8dab18583a68aedc0b [2022-04-15 13:04:03,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:04:03,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:04:03,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:04:03,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:04:03,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:04:03,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:03" (1/1) ... [2022-04-15 13:04:03,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496fb656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:03, skipping insertion in model container [2022-04-15 13:04:03,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:03" (1/1) ... [2022-04-15 13:04:03,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:04:03,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:04:03,989 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 13:04:03,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:04:04,004 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:04:04,017 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 13:04:04,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:04:04,029 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:04:04,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:04 WrapperNode [2022-04-15 13:04:04,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:04:04,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:04:04,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:04:04,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:04:04,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:04" (1/1) ... [2022-04-15 13:04:04,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:04" (1/1) ... [2022-04-15 13:04:04,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:04" (1/1) ... [2022-04-15 13:04:04,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:04" (1/1) ... [2022-04-15 13:04:04,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:04" (1/1) ... [2022-04-15 13:04:04,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:04" (1/1) ... [2022-04-15 13:04:04,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:04" (1/1) ... [2022-04-15 13:04:04,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:04:04,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:04:04,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:04:04,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:04:04,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:04" (1/1) ... [2022-04-15 13:04:04,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:04:04,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:04,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:04:04,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:04:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:04:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:04:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:04:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:04:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:04:04,122 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:04:04,122 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:04:04,122 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:04:04,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:04:04,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:04:04,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:04:04,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:04:04,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:04:04,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:04:04,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:04:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:04:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:04:04,173 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:04:04,174 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:04:04,331 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:04:04,336 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:04:04,336 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 13:04:04,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:04:04 BoogieIcfgContainer [2022-04-15 13:04:04,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:04:04,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:04:04,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:04:04,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:04:04,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:04:03" (1/3) ... [2022-04-15 13:04:04,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cc0cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:04:04, skipping insertion in model container [2022-04-15 13:04:04,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:04" (2/3) ... [2022-04-15 13:04:04,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cc0cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:04:04, skipping insertion in model container [2022-04-15 13:04:04,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:04:04" (3/3) ... [2022-04-15 13:04:04,355 INFO L111 eAbstractionObserver]: Analyzing ICFG nested3-1.c [2022-04-15 13:04:04,358 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:04:04,358 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:04:04,390 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:04:04,396 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:04:04,396 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:04:04,407 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 13:04:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:04:04,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:04,416 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:04,416 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:04,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1794590667, now seen corresponding path program 1 times [2022-04-15 13:04:04,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:04,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201465110] [2022-04-15 13:04:04,432 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:04:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1794590667, now seen corresponding path program 2 times [2022-04-15 13:04:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:04,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421227562] [2022-04-15 13:04:04,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:04,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:04,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:04,585 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 13:04:04,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 13:04:04,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-15 13:04:04,588 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 13:04:04,589 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 13:04:04,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 13:04:04,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-15 13:04:04,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret7 := main(); {28#true} is VALID [2022-04-15 13:04:04,590 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 13:04:04,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-15 13:04:04,596 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 13:04:04,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 13:04:04,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 13:04:04,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 13:04:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:04,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:04,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421227562] [2022-04-15 13:04:04,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421227562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:04,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:04,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:04:04,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:04,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201465110] [2022-04-15 13:04:04,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201465110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:04,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:04,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:04:04,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721997914] [2022-04-15 13:04:04,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:04,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:04:04,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:04,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:04,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:04,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:04:04,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:04,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:04:04,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:04:04,652 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 13:04:04,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:04,760 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-15 13:04:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:04:04,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:04:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-15 13:04:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-15 13:04:04,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-15 13:04:04,851 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 13:04:04,860 INFO L225 Difference]: With dead ends: 44 [2022-04-15 13:04:04,860 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 13:04:04,862 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:04:04,865 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 13:04:04,867 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 13:04:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 13:04:04,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 13:04:04,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:04,897 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 13:04:04,898 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 13:04:04,898 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 13:04:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:04,902 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 13:04:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 13:04:04,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:04,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:04,903 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 13:04:04,903 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 13:04:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:04,905 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 13:04:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 13:04:04,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:04,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:04,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:04,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:04,907 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 13:04:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-15 13:04:04,909 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-04-15 13:04:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:04,910 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-15 13:04:04,910 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:04,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-15 13:04:04,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 13:04:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:04:04,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:04,936 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:04,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:04:04,939 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:04,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1824143339, now seen corresponding path program 1 times [2022-04-15 13:04:04,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:04,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [381601156] [2022-04-15 13:04:04,949 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:04:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1824143339, now seen corresponding path program 2 times [2022-04-15 13:04:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:04,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826825077] [2022-04-15 13:04:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:05,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:05,028 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 13:04:05,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-15 13:04:05,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} #63#return; {204#true} is VALID [2022-04-15 13:04:05,029 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 13:04:05,029 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 13:04:05,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-15 13:04:05,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #63#return; {204#true} is VALID [2022-04-15 13:04:05,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret7 := main(); {204#true} is VALID [2022-04-15 13:04:05,030 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 13:04:05,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {205#false} is VALID [2022-04-15 13:04:05,031 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 13:04:05,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {205#false} ~cond := #in~cond; {205#false} is VALID [2022-04-15 13:04:05,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {205#false} assume 0 == ~cond; {205#false} is VALID [2022-04-15 13:04:05,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {205#false} assume !false; {205#false} is VALID [2022-04-15 13:04:05,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 13:04:05,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:05,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826825077] [2022-04-15 13:04:05,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826825077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:05,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:05,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:05,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:05,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [381601156] [2022-04-15 13:04:05,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [381601156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:05,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:05,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:05,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346029221] [2022-04-15 13:04:05,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:05,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:04:05,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:05,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:05,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:05,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:04:05,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:05,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:04:05,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:04:05,045 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 13:04:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:05,160 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 13:04:05,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:04:05,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:04:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-15 13:04:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-15 13:04:05,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-15 13:04:05,219 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 13:04:05,222 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:04:05,222 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:04:05,222 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:04:05,225 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 13:04:05,225 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 13:04:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:04:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-04-15 13:04:05,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:05,235 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 13:04:05,237 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 13:04:05,237 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 13:04:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:05,241 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-15 13:04:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 13:04:05,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:05,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:05,243 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 13:04:05,243 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 13:04:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:05,246 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-15 13:04:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 13:04:05,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:05,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:05,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:05,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:05,247 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 13:04:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-15 13:04:05,248 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2022-04-15 13:04:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:05,248 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-15 13:04:05,248 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:05,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2022-04-15 13:04:05,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-15 13:04:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:04:05,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:05,270 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:05,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:04:05,270 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:05,270 INFO L85 PathProgramCache]: Analyzing trace with hash -699512288, now seen corresponding path program 1 times [2022-04-15 13:04:05,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:05,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2071868831] [2022-04-15 13:04:05,271 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:04:05,271 INFO L85 PathProgramCache]: Analyzing trace with hash -699512288, now seen corresponding path program 2 times [2022-04-15 13:04:05,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:05,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923643251] [2022-04-15 13:04:05,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:05,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:05,317 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 13:04:05,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-15 13:04:05,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} #63#return; {379#true} is VALID [2022-04-15 13:04:05,318 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 13:04:05,318 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 13:04:05,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-15 13:04:05,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #63#return; {379#true} is VALID [2022-04-15 13:04:05,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret7 := main(); {379#true} is VALID [2022-04-15 13:04:05,318 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 13:04:05,319 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 13:04:05,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#(= main_~y~0 0)} assume !(~y~0 % 4294967296 < 268435455); {380#false} is VALID [2022-04-15 13:04:05,319 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 13:04:05,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2022-04-15 13:04:05,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {380#false} assume 0 == ~cond; {380#false} is VALID [2022-04-15 13:04:05,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-15 13:04:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:05,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:05,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923643251] [2022-04-15 13:04:05,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923643251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:05,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:05,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:05,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:05,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2071868831] [2022-04-15 13:04:05,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2071868831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:05,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:05,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:05,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891464781] [2022-04-15 13:04:05,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:05,321 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 13:04:05,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:05,321 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 13:04:05,329 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 13:04:05,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:04:05,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:05,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:04:05,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:04:05,330 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 13:04:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:05,400 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 13:04:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:04:05,400 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 13:04:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:05,401 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 13:04:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 13:04:05,402 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 13:04:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 13:04:05,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 13:04:05,439 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 13:04:05,440 INFO L225 Difference]: With dead ends: 39 [2022-04-15 13:04:05,440 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 13:04:05,441 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 13:04:05,441 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 13:04:05,442 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 13:04:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 13:04:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-15 13:04:05,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:05,445 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 13:04:05,445 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 13:04:05,445 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 13:04:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:05,446 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 13:04:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 13:04:05,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:05,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:05,447 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 13:04:05,447 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 13:04:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:05,448 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 13:04:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 13:04:05,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:05,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:05,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:05,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:05,449 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 13:04:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-15 13:04:05,450 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2022-04-15 13:04:05,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:05,450 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-15 13:04:05,450 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 13:04:05,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-15 13:04:05,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 13:04:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 13:04:05,472 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:05,472 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:05,472 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:04:05,472 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:05,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:05,473 INFO L85 PathProgramCache]: Analyzing trace with hash -185588926, now seen corresponding path program 1 times [2022-04-15 13:04:05,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:05,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1647142777] [2022-04-15 13:04:05,473 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:04:05,473 INFO L85 PathProgramCache]: Analyzing trace with hash -185588926, now seen corresponding path program 2 times [2022-04-15 13:04:05,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:05,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16096054] [2022-04-15 13:04:05,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:05,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:05,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:05,514 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 13:04:05,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-15 13:04:05,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {563#true} {563#true} #63#return; {563#true} is VALID [2022-04-15 13:04:05,515 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 13:04:05,515 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 13:04:05,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-15 13:04:05,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} #63#return; {563#true} is VALID [2022-04-15 13:04:05,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {563#true} call #t~ret7 := main(); {563#true} is VALID [2022-04-15 13:04:05,516 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 13:04:05,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {563#true} is VALID [2022-04-15 13:04:05,516 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 13:04:05,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {568#(= main_~z~0 0)} assume !(~z~0 % 4294967296 < 268435455); {564#false} is VALID [2022-04-15 13:04:05,517 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 13:04:05,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {564#false} ~cond := #in~cond; {564#false} is VALID [2022-04-15 13:04:05,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#false} assume 0 == ~cond; {564#false} is VALID [2022-04-15 13:04:05,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#false} assume !false; {564#false} is VALID [2022-04-15 13:04:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:05,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:05,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16096054] [2022-04-15 13:04:05,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16096054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:05,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:05,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:05,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:05,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1647142777] [2022-04-15 13:04:05,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1647142777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:05,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:05,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514169923] [2022-04-15 13:04:05,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:05,519 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 13:04:05,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:05,519 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 13:04:05,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:05,527 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:04:05,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:05,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:04:05,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:04:05,528 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 13:04:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:05,591 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-15 13:04:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:04:05,591 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 13:04:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:05,592 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 13:04:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 13:04:05,593 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 13:04:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 13:04:05,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-15 13:04:05,625 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 13:04:05,626 INFO L225 Difference]: With dead ends: 39 [2022-04-15 13:04:05,626 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 13:04:05,626 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 13:04:05,627 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 13:04:05,627 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 13:04:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 13:04:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-15 13:04:05,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:05,630 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 13:04:05,630 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 13:04:05,630 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 13:04:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:05,631 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 13:04:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 13:04:05,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:05,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:05,632 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 13:04:05,632 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 13:04:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:05,633 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 13:04:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 13:04:05,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:05,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:05,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:05,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:05,634 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 13:04:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-15 13:04:05,634 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-04-15 13:04:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:05,634 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-15 13:04:05,635 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 13:04:05,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-15 13:04:05,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 13:04:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:04:05,657 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:05,657 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:05,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 13:04:05,657 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:05,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:05,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1431986846, now seen corresponding path program 1 times [2022-04-15 13:04:05,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:05,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1084579602] [2022-04-15 13:04:05,737 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash -278509117, now seen corresponding path program 1 times [2022-04-15 13:04:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:05,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649191244] [2022-04-15 13:04:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:05,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:05,908 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 13:04:05,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-15 13:04:05,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {747#true} {747#true} #63#return; {747#true} is VALID [2022-04-15 13:04:05,909 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 13:04:05,909 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 13:04:05,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-15 13:04:05,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {747#true} {747#true} #63#return; {747#true} is VALID [2022-04-15 13:04:05,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {747#true} call #t~ret7 := main(); {747#true} is VALID [2022-04-15 13:04:05,909 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 13:04:05,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {747#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {747#true} is VALID [2022-04-15 13:04:05,910 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 13:04:05,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {752#(= main_~z~0 0)} [73] L24-2-->L24-3_primed: Formula: (or (= v_main_~z~0_In_1 v_main_~z~0_Out_2) (and (= |v_main_#t~post4_Out_2| 0) (<= v_main_~z~0_In_1 v_main_~z~0_Out_2) (< (mod (+ v_main_~z~0_Out_2 4294967295) 4294967296) 268435455))) InVars {main_~z~0=v_main_~z~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~z~0=v_main_~z~0_Out_2} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {753#(or (<= (+ main_~z~0 4026531841) (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296)) (<= main_~z~0 (+ (* (div main_~z~0 4294967296) 3221225472) 201326591 (div main_~z~0 4))))} is VALID [2022-04-15 13:04:05,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#(or (<= (+ main_~z~0 4026531841) (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296)) (<= main_~z~0 (+ (* (div main_~z~0 4294967296) 3221225472) 201326591 (div main_~z~0 4))))} [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 (<= (+ main_~z~0 4026531841) (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296)) (<= (+ 268435455 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0))} is VALID [2022-04-15 13:04:05,914 INFO L272 TraceCheckUtils]: 10: Hoare triple {754#(and (<= (+ main_~z~0 4026531841) (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296)) (<= (+ 268435455 (* (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 13:04:05,914 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 13:04:05,914 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 13:04:05,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-04-15 13:04:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:05,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649191244] [2022-04-15 13:04:05,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649191244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:05,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:05,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:04:05,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:05,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1084579602] [2022-04-15 13:04:05,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1084579602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:05,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:05,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:04:05,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465631643] [2022-04-15 13:04:05,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:05,976 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 13:04:05,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:05,977 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 13:04:06,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:06,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:04:06,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:06,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:04:06,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:04:06,001 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 13:04:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:06,430 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-15 13:04:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:04:06,430 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 13:04:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:06,430 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 13:04:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 13:04:06,431 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 13:04:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 13:04:06,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-15 13:04:06,597 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 13:04:06,598 INFO L225 Difference]: With dead ends: 30 [2022-04-15 13:04:06,598 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 13:04:06,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:04:06,599 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:06,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 47 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 13:04:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-15 13:04:06,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:06,645 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 13:04:06,645 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 13:04:06,645 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 13:04:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:06,646 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 13:04:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 13:04:06,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:06,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:06,647 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 13:04:06,647 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 13:04:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:06,649 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 13:04:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 13:04:06,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:06,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:06,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:06,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:06,650 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 13:04:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 13:04:06,651 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 14 [2022-04-15 13:04:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:06,651 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 13:04:06,651 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 13:04:06,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 13:04:06,688 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 13:04:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 13:04:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:04:06,688 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:06,689 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 13:04:06,689 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 13:04:06,689 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:06,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash -413054462, now seen corresponding path program 1 times [2022-04-15 13:04:06,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:06,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [665196962] [2022-04-15 13:04:06,939 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:06,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1284716088, now seen corresponding path program 1 times [2022-04-15 13:04:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:06,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862200453] [2022-04-15 13:04:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:07,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {950#(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); {944#true} is VALID [2022-04-15 13:04:07,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {944#true} assume true; {944#true} is VALID [2022-04-15 13:04:07,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {944#true} {944#true} #63#return; {944#true} is VALID [2022-04-15 13:04:07,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {944#true} call ULTIMATE.init(); {950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:07,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#(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); {944#true} is VALID [2022-04-15 13:04:07,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {944#true} assume true; {944#true} is VALID [2022-04-15 13:04:07,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {944#true} {944#true} #63#return; {944#true} is VALID [2022-04-15 13:04:07,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {944#true} call #t~ret7 := main(); {944#true} is VALID [2022-04-15 13:04:07,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {944#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {944#true} is VALID [2022-04-15 13:04:07,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {944#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {949#(= main_~y~0 0)} is VALID [2022-04-15 13:04:07,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {949#(= main_~y~0 0)} [75] L22-2-->L22-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_1 v_main_~y~0_Out_2))) (or (and (not (= (mod v_main_~z~0_Out_6 4) 0)) (= v_main_~z~0_Out_6 1) .cse0 (= |v_main_#t~post5_Out_2| 0) (<= 268435455 (mod v_main_~z~0_Out_6 4294967296)) (< (mod (+ 4294967295 v_main_~y~0_Out_2) 4294967296) 268435455) (= v_main_~y~0_Out_2 0)) .cse0)) InVars {main_~y~0=v_main_~y~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_6|, main_#t~post5=|v_main_#t~post5_Out_2|, main_~y~0=v_main_~y~0_Out_2, main_~z~0=v_main_~z~0_Out_6} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {949#(= main_~y~0 0)} is VALID [2022-04-15 13:04:07,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {949#(= 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[] {945#false} is VALID [2022-04-15 13:04:07,006 INFO L272 TraceCheckUtils]: 9: Hoare triple {945#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)); {945#false} is VALID [2022-04-15 13:04:07,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {945#false} ~cond := #in~cond; {945#false} is VALID [2022-04-15 13:04:07,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {945#false} assume 0 == ~cond; {945#false} is VALID [2022-04-15 13:04:07,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {945#false} assume !false; {945#false} is VALID [2022-04-15 13:04:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:07,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:07,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862200453] [2022-04-15 13:04:07,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862200453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:07,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:07,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:07,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:07,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [665196962] [2022-04-15 13:04:07,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [665196962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:07,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:07,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:04:07,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747879777] [2022-04-15 13:04:07,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:07,034 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 13:04:07,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:07,034 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 13:04:07,044 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 13:04:07,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:04:07,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:07,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:04:07,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:04:07,045 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 13:04:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:07,193 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-15 13:04:07,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:04:07,193 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 13:04:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:07,193 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 13:04:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-15 13:04:07,194 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 13:04:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-15 13:04:07,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-15 13:04:07,251 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 13:04:07,252 INFO L225 Difference]: With dead ends: 53 [2022-04-15 13:04:07,252 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 13:04:07,253 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 13:04:07,253 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:07,253 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 13:04:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-15 13:04:07,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:07,275 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 13:04:07,275 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 13:04:07,275 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 13:04:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:07,276 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 13:04:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-15 13:04:07,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:07,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:07,276 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 13:04:07,277 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 13:04:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:07,277 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 13:04:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-15 13:04:07,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:07,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:07,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:07,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:07,278 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 13:04:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-15 13:04:07,279 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 21 [2022-04-15 13:04:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:07,279 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-15 13:04:07,279 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 13:04:07,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-15 13:04:07,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 13:04:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:04:07,320 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:07,320 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 13:04:07,320 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 13:04:07,320 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1032496162, now seen corresponding path program 2 times [2022-04-15 13:04:07,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:07,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758461796] [2022-04-15 13:04:07,494 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:07,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1343821432, now seen corresponding path program 1 times [2022-04-15 13:04:07,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:07,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484442901] [2022-04-15 13:04:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:07,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:07,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {1196#(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); {1190#true} is VALID [2022-04-15 13:04:07,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1190#true} assume true; {1190#true} is VALID [2022-04-15 13:04:07,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1190#true} {1190#true} #63#return; {1190#true} is VALID [2022-04-15 13:04:07,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {1190#true} call ULTIMATE.init(); {1196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:07,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1196#(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); {1190#true} is VALID [2022-04-15 13:04:07,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {1190#true} assume true; {1190#true} is VALID [2022-04-15 13:04:07,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} #63#return; {1190#true} is VALID [2022-04-15 13:04:07,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {1190#true} call #t~ret7 := main(); {1190#true} is VALID [2022-04-15 13:04:07,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {1190#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1190#true} is VALID [2022-04-15 13:04:07,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {1190#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1195#(= main_~y~0 0)} is VALID [2022-04-15 13:04:07,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {1195#(= main_~y~0 0)} [77] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* 2 v_main_~y~0_Out_4))) (and (not (= (mod v_main_~z~0_Out_10 4) 0)) (<= 268435455 (mod v_main_~z~0_Out_10 4294967296)) (= .cse0 0) (< (mod (+ v_main_~z~0_Out_10 4294967295) 4294967296) 268435455) (= .cse0 (* 2 v_main_~y~0_In_2)) (< (mod (+ 4294967295 v_main_~y~0_Out_4) 4294967296) 268435455) (= (* 2 |v_main_#t~post5_Out_4|) 0) (= 2 v_main_~z~0_Out_10))) (= v_main_~y~0_In_2 v_main_~y~0_Out_4)) InVars {main_~y~0=v_main_~y~0_In_2} OutVars{main_#t~post4=|v_main_#t~post4_Out_10|, main_#t~post5=|v_main_#t~post5_Out_4|, main_~y~0=v_main_~y~0_Out_4, main_~z~0=v_main_~z~0_Out_10} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {1195#(= main_~y~0 0)} is VALID [2022-04-15 13:04:07,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {1195#(= 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[] {1191#false} is VALID [2022-04-15 13:04:07,539 INFO L272 TraceCheckUtils]: 9: Hoare triple {1191#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)); {1191#false} is VALID [2022-04-15 13:04:07,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {1191#false} ~cond := #in~cond; {1191#false} is VALID [2022-04-15 13:04:07,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {1191#false} assume 0 == ~cond; {1191#false} is VALID [2022-04-15 13:04:07,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {1191#false} assume !false; {1191#false} is VALID [2022-04-15 13:04:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:07,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:07,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484442901] [2022-04-15 13:04:07,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484442901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:07,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:07,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:07,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:07,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758461796] [2022-04-15 13:04:07,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758461796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:07,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:07,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:04:07,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382045940] [2022-04-15 13:04:07,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:07,580 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 13:04:07,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:07,581 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 13:04:07,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:07,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:04:07,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:07,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:04:07,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:04:07,592 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 13:04:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:07,812 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-15 13:04:07,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:04:07,813 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 13:04:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:07,813 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 13:04:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 13:04:07,815 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 13:04:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 13:04:07,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-15 13:04:07,864 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 13:04:07,866 INFO L225 Difference]: With dead ends: 55 [2022-04-15 13:04:07,866 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 13:04:07,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:04:07,867 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:07,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 13:04:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-15 13:04:07,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:07,889 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 13:04:07,889 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 13:04:07,889 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 13:04:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:07,891 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 13:04:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-15 13:04:07,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:07,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:07,892 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 13:04:07,892 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 13:04:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:07,894 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 13:04:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-15 13:04:07,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:07,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:07,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:07,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:07,894 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 13:04:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-15 13:04:07,908 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2022-04-15 13:04:07,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:07,909 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-15 13:04:07,909 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 13:04:07,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-15 13:04:07,946 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 13:04:07,947 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 13:04:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 13:04:07,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:07,947 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 13:04:07,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 13:04:07,947 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:07,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1400074750, now seen corresponding path program 3 times [2022-04-15 13:04:07,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:07,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [560182578] [2022-04-15 13:04:08,095 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1402926776, now seen corresponding path program 1 times [2022-04-15 13:04:08,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:08,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531835271] [2022-04-15 13:04:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:08,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:08,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {1453#(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); {1447#true} is VALID [2022-04-15 13:04:08,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {1447#true} assume true; {1447#true} is VALID [2022-04-15 13:04:08,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1447#true} {1447#true} #63#return; {1447#true} is VALID [2022-04-15 13:04:08,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {1447#true} call ULTIMATE.init(); {1453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:08,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {1453#(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); {1447#true} is VALID [2022-04-15 13:04:08,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {1447#true} assume true; {1447#true} is VALID [2022-04-15 13:04:08,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1447#true} {1447#true} #63#return; {1447#true} is VALID [2022-04-15 13:04:08,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {1447#true} call #t~ret7 := main(); {1447#true} is VALID [2022-04-15 13:04:08,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {1447#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1447#true} is VALID [2022-04-15 13:04:08,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {1447#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1452#(= main_~y~0 0)} is VALID [2022-04-15 13:04:08,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {1452#(= main_~y~0 0)} [79] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* 3 v_main_~y~0_Out_6))) (and (not (= (mod v_main_~z~0_Out_14 4) 0)) (= v_main_~z~0_Out_14 3) (<= 268435455 (mod v_main_~z~0_Out_14 4294967296)) (< (mod (+ v_main_~z~0_Out_14 4294967295) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_14 4294967294) 4294967296) 268435455) (= 0 (* 3 |v_main_#t~post5_Out_6|)) (= .cse0 0) (= .cse0 (* 3 v_main_~y~0_In_3)) (< (mod (+ 4294967295 v_main_~y~0_Out_6) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_14 4294967293) 4294967296) 268435455))) (= v_main_~y~0_In_3 v_main_~y~0_Out_6)) InVars {main_~y~0=v_main_~y~0_In_3} OutVars{main_#t~post4=|v_main_#t~post4_Out_14|, main_#t~post5=|v_main_#t~post5_Out_6|, main_~y~0=v_main_~y~0_Out_6, main_~z~0=v_main_~z~0_Out_14} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {1452#(= main_~y~0 0)} is VALID [2022-04-15 13:04:08,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {1452#(= 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[] {1448#false} is VALID [2022-04-15 13:04:08,179 INFO L272 TraceCheckUtils]: 9: Hoare triple {1448#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)); {1448#false} is VALID [2022-04-15 13:04:08,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {1448#false} ~cond := #in~cond; {1448#false} is VALID [2022-04-15 13:04:08,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {1448#false} assume 0 == ~cond; {1448#false} is VALID [2022-04-15 13:04:08,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {1448#false} assume !false; {1448#false} is VALID [2022-04-15 13:04:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:08,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:08,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531835271] [2022-04-15 13:04:08,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531835271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:08,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:08,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:08,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:08,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [560182578] [2022-04-15 13:04:08,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [560182578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:08,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:08,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:04:08,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085609340] [2022-04-15 13:04:08,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:08,231 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 13:04:08,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:08,231 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 13:04:08,242 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 13:04:08,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:04:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:08,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:04:08,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:04:08,243 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 13:04:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:08,422 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-15 13:04:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:04:08,423 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 13:04:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:08,423 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 13:04:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 13:04:08,424 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 13:04:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 13:04:08,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-15 13:04:08,476 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 13:04:08,478 INFO L225 Difference]: With dead ends: 57 [2022-04-15 13:04:08,478 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 13:04:08,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 2 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 13:04:08,479 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:08,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:08,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 13:04:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-04-15 13:04:08,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:08,508 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 13:04:08,508 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 13:04:08,509 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 13:04:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:08,511 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 13:04:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 13:04:08,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:08,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:08,511 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 13:04:08,511 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 13:04:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:08,512 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 13:04:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 13:04:08,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:08,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:08,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:08,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:08,513 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 13:04:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-15 13:04:08,514 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2022-04-15 13:04:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:08,514 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-15 13:04:08,514 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 13:04:08,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-15 13:04:08,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 13:04:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 13:04:08,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:08,566 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 13:04:08,566 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 13:04:08,566 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:08,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash 499638306, now seen corresponding path program 4 times [2022-04-15 13:04:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:08,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2089432940] [2022-04-15 13:04:08,733 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1462032120, now seen corresponding path program 1 times [2022-04-15 13:04:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:08,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680637898] [2022-04-15 13:04:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:08,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:08,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {1721#(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); {1715#true} is VALID [2022-04-15 13:04:08,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {1715#true} assume true; {1715#true} is VALID [2022-04-15 13:04:08,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1715#true} {1715#true} #63#return; {1715#true} is VALID [2022-04-15 13:04:08,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {1715#true} call ULTIMATE.init(); {1721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:08,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {1721#(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); {1715#true} is VALID [2022-04-15 13:04:08,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {1715#true} assume true; {1715#true} is VALID [2022-04-15 13:04:08,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1715#true} {1715#true} #63#return; {1715#true} is VALID [2022-04-15 13:04:08,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {1715#true} call #t~ret7 := main(); {1715#true} is VALID [2022-04-15 13:04:08,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {1715#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1715#true} is VALID [2022-04-15 13:04:08,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {1715#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1720#(= main_~y~0 0)} is VALID [2022-04-15 13:04:08,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {1720#(= main_~y~0 0)} [81] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (let ((.cse0 (* v_main_~y~0_Out_8 4))) (and (< (mod (+ v_main_~z~0_Out_18 4294967294) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_18 4294967296)) (= (* v_main_~y~0_In_4 4) .cse0) (< (mod (+ 4294967295 v_main_~y~0_Out_8) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_8| 4) 0) (not (= (mod v_main_~z~0_Out_18 4) 0)) (< (mod (+ v_main_~z~0_Out_18 4294967295) 4294967296) 268435455) (= 0 .cse0) (= v_main_~z~0_Out_18 4) (< (mod (+ v_main_~z~0_Out_18 4294967293) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_4} OutVars{main_#t~post4=|v_main_#t~post4_Out_18|, main_#t~post5=|v_main_#t~post5_Out_8|, main_~y~0=v_main_~y~0_Out_8, main_~z~0=v_main_~z~0_Out_18} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {1720#(= main_~y~0 0)} is VALID [2022-04-15 13:04:08,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {1720#(= 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[] {1716#false} is VALID [2022-04-15 13:04:08,818 INFO L272 TraceCheckUtils]: 9: Hoare triple {1716#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)); {1716#false} is VALID [2022-04-15 13:04:08,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {1716#false} ~cond := #in~cond; {1716#false} is VALID [2022-04-15 13:04:08,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {1716#false} assume 0 == ~cond; {1716#false} is VALID [2022-04-15 13:04:08,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {1716#false} assume !false; {1716#false} is VALID [2022-04-15 13:04:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:08,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:08,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680637898] [2022-04-15 13:04:08,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680637898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:08,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:08,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:08,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:08,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2089432940] [2022-04-15 13:04:08,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2089432940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:08,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:08,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:04:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59739817] [2022-04-15 13:04:08,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:08,883 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 13:04:08,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:08,883 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 13:04:08,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:08,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:04:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:08,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:04:08,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:04:08,897 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 13:04:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:09,208 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-15 13:04:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:04:09,208 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 13:04:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:09,208 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 13:04:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-15 13:04:09,209 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 13:04:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-15 13:04:09,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-15 13:04:09,256 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 13:04:09,257 INFO L225 Difference]: With dead ends: 59 [2022-04-15 13:04:09,257 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 13:04:09,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 2 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 13:04:09,258 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:09,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 46 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 13:04:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-04-15 13:04:09,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:09,292 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 13:04:09,292 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 13:04:09,293 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 13:04:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:09,294 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 13:04:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-15 13:04:09,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:09,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:09,295 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 13:04:09,295 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 13:04:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:09,295 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 13:04:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-15 13:04:09,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:09,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:09,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:09,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:09,296 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 13:04:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-15 13:04:09,296 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 24 [2022-04-15 13:04:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:09,297 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-15 13:04:09,297 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 13:04:09,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-15 13:04:09,360 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 13:04:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 13:04:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:04:09,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:09,360 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 13:04:09,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 13:04:09,361 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:09,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash -738799102, now seen corresponding path program 5 times [2022-04-15 13:04:09,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:09,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148900770] [2022-04-15 13:04:09,579 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1521137464, now seen corresponding path program 1 times [2022-04-15 13:04:09,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:09,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571884945] [2022-04-15 13:04:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:09,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:09,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {2000#(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); {1994#true} is VALID [2022-04-15 13:04:09,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {1994#true} assume true; {1994#true} is VALID [2022-04-15 13:04:09,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1994#true} {1994#true} #63#return; {1994#true} is VALID [2022-04-15 13:04:09,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {1994#true} call ULTIMATE.init(); {2000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:09,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#(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); {1994#true} is VALID [2022-04-15 13:04:09,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {1994#true} assume true; {1994#true} is VALID [2022-04-15 13:04:09,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1994#true} {1994#true} #63#return; {1994#true} is VALID [2022-04-15 13:04:09,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {1994#true} call #t~ret7 := main(); {1994#true} is VALID [2022-04-15 13:04:09,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {1994#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1994#true} is VALID [2022-04-15 13:04:09,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {1994#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1999#(= main_~y~0 0)} is VALID [2022-04-15 13:04:09,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {1999#(= main_~y~0 0)} [83] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* 5 v_main_~y~0_Out_10))) (and (< (mod (+ v_main_~z~0_Out_22 4294967295) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_10| 5) 0) (not (= 0 (mod v_main_~z~0_Out_22 4))) (< (mod (+ 4294967291 v_main_~z~0_Out_22) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_10) 4294967296) 268435455) (= .cse0 0) (< (mod (+ v_main_~z~0_Out_22 4294967293) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_22 4294967296)) (= 5 v_main_~z~0_Out_22) (< (mod (+ 4294967292 v_main_~z~0_Out_22) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_22 4294967294) 4294967296) 268435455) (= (* 5 v_main_~y~0_In_5) .cse0))) (= v_main_~y~0_In_5 v_main_~y~0_Out_10)) InVars {main_~y~0=v_main_~y~0_In_5} OutVars{main_#t~post4=|v_main_#t~post4_Out_22|, main_#t~post5=|v_main_#t~post5_Out_10|, main_~y~0=v_main_~y~0_Out_10, main_~z~0=v_main_~z~0_Out_22} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {1999#(= main_~y~0 0)} is VALID [2022-04-15 13:04:09,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {1999#(= 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[] {1995#false} is VALID [2022-04-15 13:04:09,627 INFO L272 TraceCheckUtils]: 9: Hoare triple {1995#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)); {1995#false} is VALID [2022-04-15 13:04:09,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {1995#false} ~cond := #in~cond; {1995#false} is VALID [2022-04-15 13:04:09,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {1995#false} assume 0 == ~cond; {1995#false} is VALID [2022-04-15 13:04:09,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {1995#false} assume !false; {1995#false} is VALID [2022-04-15 13:04:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:09,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:09,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571884945] [2022-04-15 13:04:09,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571884945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:09,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:09,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:09,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:09,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148900770] [2022-04-15 13:04:09,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148900770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:09,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:09,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:04:09,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282498599] [2022-04-15 13:04:09,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:09,695 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 13:04:09,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:09,695 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 13:04:09,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:09,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 13:04:09,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:09,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 13:04:09,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:04:09,709 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 13:04:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:10,065 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-15 13:04:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:04:10,065 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 13:04:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:10,065 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 13:04:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-04-15 13:04:10,066 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 13:04:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-04-15 13:04:10,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2022-04-15 13:04:10,113 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 13:04:10,113 INFO L225 Difference]: With dead ends: 61 [2022-04-15 13:04:10,113 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 13:04:10,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 2 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 13:04:10,114 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:10,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:10,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 13:04:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-04-15 13:04:10,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:10,152 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 13:04:10,152 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 13:04:10,153 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 13:04:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:10,153 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 13:04:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 13:04:10,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:10,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:10,154 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 13:04:10,154 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 13:04:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:10,155 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 13:04:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 13:04:10,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:10,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:10,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:10,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:10,155 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 13:04:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-15 13:04:10,156 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2022-04-15 13:04:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:10,156 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-15 13:04:10,156 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 13:04:10,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-15 13:04:10,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 13:04:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 13:04:10,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:10,218 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 13:04:10,218 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 13:04:10,218 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:10,218 INFO L85 PathProgramCache]: Analyzing trace with hash -475653086, now seen corresponding path program 6 times [2022-04-15 13:04:10,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:10,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2048887606] [2022-04-15 13:04:10,430 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:10,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1580242808, now seen corresponding path program 1 times [2022-04-15 13:04:10,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:10,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504410010] [2022-04-15 13:04:10,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:10,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:10,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:10,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {2290#(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); {2284#true} is VALID [2022-04-15 13:04:10,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-04-15 13:04:10,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2284#true} {2284#true} #63#return; {2284#true} is VALID [2022-04-15 13:04:10,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {2284#true} call ULTIMATE.init(); {2290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:10,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {2290#(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); {2284#true} is VALID [2022-04-15 13:04:10,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-04-15 13:04:10,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2284#true} {2284#true} #63#return; {2284#true} is VALID [2022-04-15 13:04:10,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {2284#true} call #t~ret7 := main(); {2284#true} is VALID [2022-04-15 13:04:10,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {2284#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2284#true} is VALID [2022-04-15 13:04:10,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {2284#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2289#(= main_~y~0 0)} is VALID [2022-04-15 13:04:10,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {2289#(= main_~y~0 0)} [85] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_6 v_main_~y~0_Out_12) (let ((.cse0 (* v_main_~y~0_Out_12 6))) (and (not (= (mod v_main_~z~0_Out_26 4) 0)) (< (mod (+ 4294967295 v_main_~y~0_Out_12) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_26 4294967296)) (= (* |v_main_#t~post5_Out_12| 6) 0) (= .cse0 0) (= .cse0 (* 6 v_main_~y~0_In_6)) (= v_main_~z~0_Out_26 6)))) InVars {main_~y~0=v_main_~y~0_In_6} OutVars{main_#t~post4=|v_main_#t~post4_Out_26|, main_#t~post5=|v_main_#t~post5_Out_12|, main_~y~0=v_main_~y~0_Out_12, main_~z~0=v_main_~z~0_Out_26} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {2289#(= main_~y~0 0)} is VALID [2022-04-15 13:04:10,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {2289#(= 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[] {2285#false} is VALID [2022-04-15 13:04:10,476 INFO L272 TraceCheckUtils]: 9: Hoare triple {2285#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)); {2285#false} is VALID [2022-04-15 13:04:10,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {2285#false} ~cond := #in~cond; {2285#false} is VALID [2022-04-15 13:04:10,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#false} assume 0 == ~cond; {2285#false} is VALID [2022-04-15 13:04:10,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {2285#false} assume !false; {2285#false} is VALID [2022-04-15 13:04:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:10,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:10,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504410010] [2022-04-15 13:04:10,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504410010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:10,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:10,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:10,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:10,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2048887606] [2022-04-15 13:04:10,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2048887606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:10,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:10,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:04:10,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684079428] [2022-04-15 13:04:10,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:10,583 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 13:04:10,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:10,583 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 13:04:10,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:10,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 13:04:10,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:10,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 13:04:10,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:04:10,596 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 13:04:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:10,939 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-15 13:04:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:04:10,939 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 13:04:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:10,939 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 13:04:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 13:04:10,940 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 13:04:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 13:04:10,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-15 13:04:10,981 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 13:04:10,982 INFO L225 Difference]: With dead ends: 63 [2022-04-15 13:04:10,982 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 13:04:10,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 2 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 13:04:10,983 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:10,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 13:04:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2022-04-15 13:04:11,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:11,029 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 13:04:11,033 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 13:04:11,033 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 13:04:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:11,041 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-15 13:04:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-15 13:04:11,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:11,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:11,041 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 13:04:11,042 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 13:04:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:11,043 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-15 13:04:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-15 13:04:11,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:11,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:11,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:11,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:11,043 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 13:04:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-15 13:04:11,044 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 26 [2022-04-15 13:04:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:11,044 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-15 13:04:11,044 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 13:04:11,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-15 13:04:11,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 13:04:11,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 13:04:11,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:11,108 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 13:04:11,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 13:04:11,109 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:11,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:11,109 INFO L85 PathProgramCache]: Analyzing trace with hash -908061182, now seen corresponding path program 7 times [2022-04-15 13:04:11,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:11,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [440556257] [2022-04-15 13:04:11,345 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1639348152, now seen corresponding path program 1 times [2022-04-15 13:04:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:11,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459973637] [2022-04-15 13:04:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:11,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:11,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {2591#(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); {2585#true} is VALID [2022-04-15 13:04:11,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {2585#true} assume true; {2585#true} is VALID [2022-04-15 13:04:11,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2585#true} {2585#true} #63#return; {2585#true} is VALID [2022-04-15 13:04:11,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {2585#true} call ULTIMATE.init(); {2591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:11,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {2591#(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); {2585#true} is VALID [2022-04-15 13:04:11,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {2585#true} assume true; {2585#true} is VALID [2022-04-15 13:04:11,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2585#true} {2585#true} #63#return; {2585#true} is VALID [2022-04-15 13:04:11,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {2585#true} call #t~ret7 := main(); {2585#true} is VALID [2022-04-15 13:04:11,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {2585#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2585#true} is VALID [2022-04-15 13:04:11,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {2585#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2590#(= main_~y~0 0)} is VALID [2022-04-15 13:04:11,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {2590#(= main_~y~0 0)} [87] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_7 v_main_~y~0_Out_14) (let ((.cse0 (* 7 v_main_~y~0_Out_14))) (and (<= 268435455 (mod v_main_~z~0_Out_30 4294967296)) (not (= (mod v_main_~z~0_Out_30 4) 0)) (= .cse0 0) (= 7 v_main_~z~0_Out_30) (< (mod (+ v_main_~z~0_Out_30 4294967295) 4294967296) 268435455) (= (* 7 |v_main_#t~post5_Out_14|) 0) (< (mod (+ 4294967295 v_main_~y~0_Out_14) 4294967296) 268435455) (= .cse0 (* 7 v_main_~y~0_In_7))))) InVars {main_~y~0=v_main_~y~0_In_7} OutVars{main_#t~post4=|v_main_#t~post4_Out_30|, main_#t~post5=|v_main_#t~post5_Out_14|, main_~y~0=v_main_~y~0_Out_14, main_~z~0=v_main_~z~0_Out_30} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {2590#(= main_~y~0 0)} is VALID [2022-04-15 13:04:11,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {2590#(= 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[] {2586#false} is VALID [2022-04-15 13:04:11,389 INFO L272 TraceCheckUtils]: 9: Hoare triple {2586#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)); {2586#false} is VALID [2022-04-15 13:04:11,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {2586#false} ~cond := #in~cond; {2586#false} is VALID [2022-04-15 13:04:11,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {2586#false} assume 0 == ~cond; {2586#false} is VALID [2022-04-15 13:04:11,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {2586#false} assume !false; {2586#false} is VALID [2022-04-15 13:04:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:11,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:11,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459973637] [2022-04-15 13:04:11,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459973637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:11,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:11,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:11,514 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:11,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [440556257] [2022-04-15 13:04:11,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [440556257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:11,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:11,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:04:11,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138675424] [2022-04-15 13:04:11,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:11,515 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 13:04:11,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:11,515 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 13:04:11,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:11,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:04:11,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:11,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:04:11,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 13:04:11,532 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 13:04:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:11,937 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-15 13:04:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 13:04:11,937 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 13:04:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:11,938 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 13:04:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 13:04:11,939 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 13:04:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 13:04:11,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-15 13:04:11,985 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 13:04:11,985 INFO L225 Difference]: With dead ends: 65 [2022-04-15 13:04:11,986 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 13:04:11,986 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 2 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 13:04:11,986 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:11,987 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 13:04:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-04-15 13:04:12,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:12,026 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 13:04:12,026 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 13:04:12,026 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 13:04:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:12,027 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-15 13:04:12,027 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-15 13:04:12,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:12,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:12,027 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 13:04:12,027 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 13:04:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:12,028 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-15 13:04:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-15 13:04:12,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:12,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:12,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:12,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:12,029 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 13:04:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-15 13:04:12,029 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 27 [2022-04-15 13:04:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:12,029 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-15 13:04:12,029 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 13:04:12,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-15 13:04:12,084 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 13:04:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 13:04:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 13:04:12,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:12,085 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 13:04:12,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 13:04:12,085 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:12,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:12,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1427810270, now seen corresponding path program 8 times [2022-04-15 13:04:12,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:12,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675716907] [2022-04-15 13:04:12,311 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1698453496, now seen corresponding path program 1 times [2022-04-15 13:04:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:12,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567099285] [2022-04-15 13:04:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:12,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:12,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:12,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {2903#(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); {2897#true} is VALID [2022-04-15 13:04:12,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {2897#true} assume true; {2897#true} is VALID [2022-04-15 13:04:12,363 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2897#true} {2897#true} #63#return; {2897#true} is VALID [2022-04-15 13:04:12,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {2897#true} call ULTIMATE.init(); {2903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:12,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {2903#(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); {2897#true} is VALID [2022-04-15 13:04:12,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {2897#true} assume true; {2897#true} is VALID [2022-04-15 13:04:12,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2897#true} {2897#true} #63#return; {2897#true} is VALID [2022-04-15 13:04:12,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {2897#true} call #t~ret7 := main(); {2897#true} is VALID [2022-04-15 13:04:12,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {2897#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2897#true} is VALID [2022-04-15 13:04:12,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {2897#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2902#(= main_~y~0 0)} is VALID [2022-04-15 13:04:12,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {2902#(= main_~y~0 0)} [89] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_16 8))) (and (= .cse0 0) (< (mod (+ v_main_~z~0_Out_34 4294967294) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_34 4294967296)) (< (mod (+ 4294967290 v_main_~z~0_Out_34) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_16| 8) 0) (= v_main_~z~0_Out_34 8) (< (mod (+ v_main_~z~0_Out_34 4294967295) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_34) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_34 4294967293) 4294967296) 268435455) (= .cse0 (* v_main_~y~0_In_8 8)) (< (mod (+ 4294967292 v_main_~z~0_Out_34) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_16) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_34 4) 0)))) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) InVars {main_~y~0=v_main_~y~0_In_8} OutVars{main_#t~post4=|v_main_#t~post4_Out_34|, main_#t~post5=|v_main_#t~post5_Out_16|, main_~y~0=v_main_~y~0_Out_16, main_~z~0=v_main_~z~0_Out_34} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {2902#(= main_~y~0 0)} is VALID [2022-04-15 13:04:12,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {2902#(= 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[] {2898#false} is VALID [2022-04-15 13:04:12,368 INFO L272 TraceCheckUtils]: 9: Hoare triple {2898#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)); {2898#false} is VALID [2022-04-15 13:04:12,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {2898#false} ~cond := #in~cond; {2898#false} is VALID [2022-04-15 13:04:12,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {2898#false} assume 0 == ~cond; {2898#false} is VALID [2022-04-15 13:04:12,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {2898#false} assume !false; {2898#false} is VALID [2022-04-15 13:04:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:12,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:12,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567099285] [2022-04-15 13:04:12,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567099285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:12,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:12,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:12,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:12,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675716907] [2022-04-15 13:04:12,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675716907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:12,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:12,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:04:12,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472386560] [2022-04-15 13:04:12,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:12,504 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 13:04:12,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:12,504 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 13:04:12,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:12,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:04:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:12,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:04:12,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:04:12,527 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 13:04:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:12,979 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-04-15 13:04:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 13:04:12,979 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 13:04:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:12,979 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 13:04:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-15 13:04:12,980 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 13:04:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-15 13:04:12,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-15 13:04:13,030 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 13:04:13,031 INFO L225 Difference]: With dead ends: 67 [2022-04-15 13:04:13,031 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 13:04:13,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 2 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 13:04:13,032 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:13,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:04:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 13:04:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-04-15 13:04:13,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:13,072 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 13:04:13,072 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 13:04:13,072 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 13:04:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:13,073 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-15 13:04:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-15 13:04:13,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:13,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:13,073 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 13:04:13,079 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 13:04:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:13,080 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-15 13:04:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-15 13:04:13,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:13,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:13,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:13,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:13,081 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 13:04:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-15 13:04:13,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2022-04-15 13:04:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:13,081 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-15 13:04:13,082 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 13:04:13,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-15 13:04:13,139 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 13:04:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 13:04:13,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 13:04:13,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:13,140 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 13:04:13,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 13:04:13,140 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:13,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash -360162814, now seen corresponding path program 9 times [2022-04-15 13:04:13,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:13,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [859680748] [2022-04-15 13:04:13,380 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1757558840, now seen corresponding path program 1 times [2022-04-15 13:04:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:13,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266591979] [2022-04-15 13:04:13,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:13,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:13,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {3226#(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); {3220#true} is VALID [2022-04-15 13:04:13,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {3220#true} assume true; {3220#true} is VALID [2022-04-15 13:04:13,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3220#true} {3220#true} #63#return; {3220#true} is VALID [2022-04-15 13:04:13,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {3220#true} call ULTIMATE.init(); {3226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:13,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {3226#(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); {3220#true} is VALID [2022-04-15 13:04:13,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {3220#true} assume true; {3220#true} is VALID [2022-04-15 13:04:13,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3220#true} {3220#true} #63#return; {3220#true} is VALID [2022-04-15 13:04:13,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {3220#true} call #t~ret7 := main(); {3220#true} is VALID [2022-04-15 13:04:13,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {3220#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3220#true} is VALID [2022-04-15 13:04:13,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {3220#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3225#(= main_~y~0 0)} is VALID [2022-04-15 13:04:13,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {3225#(= main_~y~0 0)} [91] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (let ((.cse0 (* 9 v_main_~y~0_Out_18))) (and (< (mod (+ 4294967290 v_main_~z~0_Out_38) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_38 4294967296)) (< (mod (+ 4294967291 v_main_~z~0_Out_38) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_38 4294967293) 4294967296) 268435455) (= v_main_~z~0_Out_38 9) (< (mod (+ 4294967295 v_main_~y~0_Out_18) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_38 4) 0)) (= .cse0 (* 9 v_main_~y~0_In_9)) (= (* |v_main_#t~post5_Out_18| 9) 0) (< (mod (+ v_main_~z~0_Out_38 4294967295) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_38 4294967294) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_38) 4294967296) 268435455) (= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_In_9} OutVars{main_#t~post4=|v_main_#t~post4_Out_38|, main_#t~post5=|v_main_#t~post5_Out_18|, main_~y~0=v_main_~y~0_Out_18, main_~z~0=v_main_~z~0_Out_38} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {3225#(= main_~y~0 0)} is VALID [2022-04-15 13:04:13,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {3225#(= 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[] {3221#false} is VALID [2022-04-15 13:04:13,442 INFO L272 TraceCheckUtils]: 9: Hoare triple {3221#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)); {3221#false} is VALID [2022-04-15 13:04:13,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {3221#false} ~cond := #in~cond; {3221#false} is VALID [2022-04-15 13:04:13,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {3221#false} assume 0 == ~cond; {3221#false} is VALID [2022-04-15 13:04:13,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {3221#false} assume !false; {3221#false} is VALID [2022-04-15 13:04:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:13,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:13,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266591979] [2022-04-15 13:04:13,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266591979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:13,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:13,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:13,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:13,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [859680748] [2022-04-15 13:04:13,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [859680748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:13,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:13,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 13:04:13,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813333201] [2022-04-15 13:04:13,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:13,600 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 13:04:13,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:13,601 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 13:04:13,615 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 13:04:13,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 13:04:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 13:04:13,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:04:13,616 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 13:04:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:14,277 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-04-15 13:04:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 13:04:14,277 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 13:04:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:14,277 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 13:04:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 61 transitions. [2022-04-15 13:04:14,278 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 13:04:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 61 transitions. [2022-04-15 13:04:14,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 61 transitions. [2022-04-15 13:04:14,329 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 13:04:14,329 INFO L225 Difference]: With dead ends: 69 [2022-04-15 13:04:14,330 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 13:04:14,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 2 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 13:04:14,330 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:14,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:04:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 13:04:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-15 13:04:14,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:14,377 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 13:04:14,377 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 13:04:14,378 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 13:04:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:14,378 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-15 13:04:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-15 13:04:14,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:14,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:14,379 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 13:04:14,379 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 13:04:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:14,379 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-15 13:04:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-15 13:04:14,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:14,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:14,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:14,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:14,380 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 13:04:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-15 13:04:14,380 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 29 [2022-04-15 13:04:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:14,381 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-15 13:04:14,381 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 13:04:14,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-15 13:04:14,460 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 13:04:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 13:04:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 13:04:14,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:14,460 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 13:04:14,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 13:04:14,461 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1622830046, now seen corresponding path program 10 times [2022-04-15 13:04:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:14,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [600843165] [2022-04-15 13:04:14,774 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1816664184, now seen corresponding path program 1 times [2022-04-15 13:04:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:14,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345149531] [2022-04-15 13:04:14,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:14,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:14,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {3560#(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); {3554#true} is VALID [2022-04-15 13:04:14,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {3554#true} assume true; {3554#true} is VALID [2022-04-15 13:04:14,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3554#true} {3554#true} #63#return; {3554#true} is VALID [2022-04-15 13:04:14,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {3554#true} call ULTIMATE.init(); {3560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:14,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {3560#(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); {3554#true} is VALID [2022-04-15 13:04:14,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {3554#true} assume true; {3554#true} is VALID [2022-04-15 13:04:14,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3554#true} {3554#true} #63#return; {3554#true} is VALID [2022-04-15 13:04:14,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {3554#true} call #t~ret7 := main(); {3554#true} is VALID [2022-04-15 13:04:14,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {3554#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3554#true} is VALID [2022-04-15 13:04:14,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {3554#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3559#(= main_~y~0 0)} is VALID [2022-04-15 13:04:14,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {3559#(= main_~y~0 0)} [93] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (let ((.cse0 (* v_main_~y~0_Out_20 10))) (and (< (mod (+ v_main_~z~0_Out_42 4294967287) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_42 4294967295) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_42 4294967294) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_42 4294967286) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_42 4294967293) 4294967296) 268435455) (= (* v_main_~y~0_In_10 10) .cse0) (< (mod (+ 4294967290 v_main_~z~0_Out_42) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_20) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_42 4294967296)) (not (= (mod v_main_~z~0_Out_42 4) 0)) (< (mod (+ 4294967291 v_main_~z~0_Out_42) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_42) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_20| 10) 0) (= .cse0 0) (= v_main_~z~0_Out_42 10) (< (mod (+ v_main_~z~0_Out_42 4294967289) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_42) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_10} OutVars{main_#t~post4=|v_main_#t~post4_Out_42|, main_#t~post5=|v_main_#t~post5_Out_20|, main_~y~0=v_main_~y~0_Out_20, main_~z~0=v_main_~z~0_Out_42} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {3559#(= main_~y~0 0)} is VALID [2022-04-15 13:04:14,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {3559#(= 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[] {3555#false} is VALID [2022-04-15 13:04:14,849 INFO L272 TraceCheckUtils]: 9: Hoare triple {3555#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)); {3555#false} is VALID [2022-04-15 13:04:14,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {3555#false} ~cond := #in~cond; {3555#false} is VALID [2022-04-15 13:04:14,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {3555#false} assume 0 == ~cond; {3555#false} is VALID [2022-04-15 13:04:14,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {3555#false} assume !false; {3555#false} is VALID [2022-04-15 13:04:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:14,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:14,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345149531] [2022-04-15 13:04:14,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345149531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:14,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:14,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:14,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:14,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [600843165] [2022-04-15 13:04:14,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [600843165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:14,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:14,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 13:04:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328005141] [2022-04-15 13:04:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:14,990 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 13:04:14,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:14,991 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 13:04:15,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:15,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 13:04:15,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 13:04:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:04:15,018 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 13:04:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,709 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2022-04-15 13:04:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 13:04:15,709 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 13:04:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:15,709 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 13:04:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-15 13:04:15,710 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 13:04:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-15 13:04:15,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 62 transitions. [2022-04-15 13:04:15,753 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 13:04:15,753 INFO L225 Difference]: With dead ends: 71 [2022-04-15 13:04:15,754 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 13:04:15,754 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 2 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 13:04:15,754 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:15,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 81 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:04:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 13:04:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-04-15 13:04:15,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:15,814 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 13:04:15,815 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 13:04:15,815 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 13:04:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,815 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 13:04:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 13:04:15,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:15,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:15,816 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 13:04:15,816 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 13:04:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,817 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 13:04:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 13:04:15,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:15,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:15,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:15,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:15,817 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 13:04:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-04-15 13:04:15,817 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 30 [2022-04-15 13:04:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:15,818 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-04-15 13:04:15,818 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 13:04:15,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 40 transitions. [2022-04-15 13:04:15,930 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 13:04:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-04-15 13:04:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 13:04:15,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:15,930 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 13:04:15,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 13:04:15,931 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2110808574, now seen corresponding path program 11 times [2022-04-15 13:04:15,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:15,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [678829135] [2022-04-15 13:04:16,165 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1875769528, now seen corresponding path program 1 times [2022-04-15 13:04:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:16,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151312090] [2022-04-15 13:04:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:16,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {3905#(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); {3899#true} is VALID [2022-04-15 13:04:16,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-15 13:04:16,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3899#true} {3899#true} #63#return; {3899#true} is VALID [2022-04-15 13:04:16,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {3899#true} call ULTIMATE.init(); {3905#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:16,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {3905#(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); {3899#true} is VALID [2022-04-15 13:04:16,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-15 13:04:16,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3899#true} {3899#true} #63#return; {3899#true} is VALID [2022-04-15 13:04:16,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {3899#true} call #t~ret7 := main(); {3899#true} is VALID [2022-04-15 13:04:16,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {3899#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3899#true} is VALID [2022-04-15 13:04:16,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {3899#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3904#(= main_~y~0 0)} is VALID [2022-04-15 13:04:16,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {3904#(= main_~y~0 0)} [95] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_22 11))) (and (= (* |v_main_#t~post5_Out_22| 11) 0) (< (mod (+ v_main_~z~0_Out_46 4294967294) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_22) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_46) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_46) 4294967296) 268435455) (= .cse0 (* v_main_~y~0_In_11 11)) (= v_main_~z~0_Out_46 11) (= .cse0 0) (< (mod (+ v_main_~z~0_Out_46 4294967295) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_46 4294967293) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_46 4294967296)) (not (= (mod v_main_~z~0_Out_46 4) 0)))) (= v_main_~y~0_In_11 v_main_~y~0_Out_22)) InVars {main_~y~0=v_main_~y~0_In_11} OutVars{main_#t~post4=|v_main_#t~post4_Out_46|, main_#t~post5=|v_main_#t~post5_Out_22|, main_~y~0=v_main_~y~0_Out_22, main_~z~0=v_main_~z~0_Out_46} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {3904#(= main_~y~0 0)} is VALID [2022-04-15 13:04:16,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {3904#(= 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[] {3900#false} is VALID [2022-04-15 13:04:16,240 INFO L272 TraceCheckUtils]: 9: Hoare triple {3900#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)); {3900#false} is VALID [2022-04-15 13:04:16,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {3900#false} ~cond := #in~cond; {3900#false} is VALID [2022-04-15 13:04:16,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {3900#false} assume 0 == ~cond; {3900#false} is VALID [2022-04-15 13:04:16,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {3900#false} assume !false; {3900#false} is VALID [2022-04-15 13:04:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:16,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151312090] [2022-04-15 13:04:16,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151312090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:16,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:16,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:16,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:16,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [678829135] [2022-04-15 13:04:16,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [678829135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:16,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:16,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 13:04:16,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667979818] [2022-04-15 13:04:16,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:16,382 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 13:04:16,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:16,382 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 13:04:16,396 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 13:04:16,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 13:04:16,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:16,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 13:04:16,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:04:16,396 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 13:04:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:16,980 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-04-15 13:04:16,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 13:04:16,980 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 13:04:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:16,980 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 13:04:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-04-15 13:04:16,981 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 13:04:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-04-15 13:04:16,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 63 transitions. [2022-04-15 13:04:17,019 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 13:04:17,020 INFO L225 Difference]: With dead ends: 73 [2022-04-15 13:04:17,020 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 13:04:17,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 2 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 13:04:17,022 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:17,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 46 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:04:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 13:04:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2022-04-15 13:04:17,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:17,062 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 13:04:17,062 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 13:04:17,062 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 13:04:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:17,063 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-15 13:04:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-15 13:04:17,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:17,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:17,068 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 13:04:17,069 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 13:04:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:17,070 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-15 13:04:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-15 13:04:17,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:17,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:17,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:17,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:17,070 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 13:04:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-15 13:04:17,072 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 31 [2022-04-15 13:04:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:17,072 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-15 13:04:17,072 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 13:04:17,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-15 13:04:17,146 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 13:04:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 13:04:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 13:04:17,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:17,147 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 13:04:17,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 13:04:17,147 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:17,147 INFO L85 PathProgramCache]: Analyzing trace with hash -58273758, now seen corresponding path program 12 times [2022-04-15 13:04:17,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:17,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2486540] [2022-04-15 13:04:17,360 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1934874872, now seen corresponding path program 1 times [2022-04-15 13:04:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:17,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702363291] [2022-04-15 13:04:17,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:17,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:17,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:17,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {4261#(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); {4255#true} is VALID [2022-04-15 13:04:17,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {4255#true} assume true; {4255#true} is VALID [2022-04-15 13:04:17,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4255#true} {4255#true} #63#return; {4255#true} is VALID [2022-04-15 13:04:17,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {4255#true} call ULTIMATE.init(); {4261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:17,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {4261#(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); {4255#true} is VALID [2022-04-15 13:04:17,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {4255#true} assume true; {4255#true} is VALID [2022-04-15 13:04:17,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4255#true} {4255#true} #63#return; {4255#true} is VALID [2022-04-15 13:04:17,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {4255#true} call #t~ret7 := main(); {4255#true} is VALID [2022-04-15 13:04:17,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {4255#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4255#true} is VALID [2022-04-15 13:04:17,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {4255#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4260#(= main_~y~0 0)} is VALID [2022-04-15 13:04:17,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {4260#(= main_~y~0 0)} [97] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_24 12))) (and (= .cse0 0) (< (mod (+ 4294967295 v_main_~y~0_Out_24) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_50 4294967293) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_50 4294967287) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_50 4) 0)) (= (* v_main_~y~0_In_12 12) .cse0) (< (mod (+ v_main_~z~0_Out_50 4294967285) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_50 4294967286) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_50) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_50) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_24| 12) 0) (< (mod (+ v_main_~z~0_Out_50 4294967295) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_50 4294967294) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_50 4294967296)) (< (mod (+ 4294967292 v_main_~z~0_Out_50) 4294967296) 268435455) (= v_main_~z~0_Out_50 12) (< (mod (+ v_main_~z~0_Out_50 4294967289) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_50) 4294967296) 268435455))) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) InVars {main_~y~0=v_main_~y~0_In_12} OutVars{main_#t~post4=|v_main_#t~post4_Out_50|, main_#t~post5=|v_main_#t~post5_Out_24|, main_~y~0=v_main_~y~0_Out_24, main_~z~0=v_main_~z~0_Out_50} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {4260#(= main_~y~0 0)} is VALID [2022-04-15 13:04:17,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {4260#(= 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[] {4256#false} is VALID [2022-04-15 13:04:17,410 INFO L272 TraceCheckUtils]: 9: Hoare triple {4256#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)); {4256#false} is VALID [2022-04-15 13:04:17,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {4256#false} ~cond := #in~cond; {4256#false} is VALID [2022-04-15 13:04:17,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {4256#false} assume 0 == ~cond; {4256#false} is VALID [2022-04-15 13:04:17,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {4256#false} assume !false; {4256#false} is VALID [2022-04-15 13:04:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:17,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:17,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702363291] [2022-04-15 13:04:17,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702363291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:17,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:17,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:17,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:17,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2486540] [2022-04-15 13:04:17,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2486540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:17,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:17,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 13:04:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214863099] [2022-04-15 13:04:17,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:17,591 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 13:04:17,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:17,591 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 13:04:17,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:17,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 13:04:17,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:17,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 13:04:17,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-15 13:04:17,613 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 13:04:18,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:18,466 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 13:04:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 13:04:18,466 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 13:04:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:18,466 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 13:04:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2022-04-15 13:04:18,467 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 13:04:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2022-04-15 13:04:18,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 64 transitions. [2022-04-15 13:04:18,519 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 13:04:18,519 INFO L225 Difference]: With dead ends: 75 [2022-04-15 13:04:18,519 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 13:04:18,520 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 2 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 13:04:18,520 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:18,520 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.4s Time] [2022-04-15 13:04:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 13:04:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-04-15 13:04:18,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:18,597 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 13:04:18,597 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 13:04:18,597 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 13:04:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:18,598 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 13:04:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-15 13:04:18,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:18,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:18,599 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 13:04:18,599 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 13:04:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:18,600 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 13:04:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-15 13:04:18,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:18,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:18,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:18,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:18,600 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 13:04:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-04-15 13:04:18,601 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2022-04-15 13:04:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:18,601 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-04-15 13:04:18,601 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 13:04:18,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 42 transitions. [2022-04-15 13:04:18,695 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 13:04:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 13:04:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 13:04:18,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:18,695 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 13:04:18,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 13:04:18,696 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:18,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:18,696 INFO L85 PathProgramCache]: Analyzing trace with hash -854203902, now seen corresponding path program 13 times [2022-04-15 13:04:18,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:18,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2118012275] [2022-04-15 13:04:18,991 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1993980216, now seen corresponding path program 1 times [2022-04-15 13:04:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:18,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899358418] [2022-04-15 13:04:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:18,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:19,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {4628#(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); {4622#true} is VALID [2022-04-15 13:04:19,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {4622#true} assume true; {4622#true} is VALID [2022-04-15 13:04:19,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4622#true} {4622#true} #63#return; {4622#true} is VALID [2022-04-15 13:04:19,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {4622#true} call ULTIMATE.init(); {4628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:19,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {4628#(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); {4622#true} is VALID [2022-04-15 13:04:19,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {4622#true} assume true; {4622#true} is VALID [2022-04-15 13:04:19,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4622#true} {4622#true} #63#return; {4622#true} is VALID [2022-04-15 13:04:19,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {4622#true} call #t~ret7 := main(); {4622#true} is VALID [2022-04-15 13:04:19,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {4622#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4622#true} is VALID [2022-04-15 13:04:19,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {4622#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4627#(= main_~y~0 0)} is VALID [2022-04-15 13:04:19,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {4627#(= main_~y~0 0)} [99] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_26 13))) (and (= 0 (* |v_main_#t~post5_Out_26| 13)) (< (mod (+ 4294967295 v_main_~y~0_Out_26) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_54 4) 0)) (<= 268435455 (mod v_main_~z~0_Out_54 4294967296)) (= .cse0 (* v_main_~y~0_In_13 13)) (= .cse0 0) (= v_main_~z~0_Out_54 13))) (= v_main_~y~0_In_13 v_main_~y~0_Out_26)) InVars {main_~y~0=v_main_~y~0_In_13} OutVars{main_#t~post4=|v_main_#t~post4_Out_54|, main_#t~post5=|v_main_#t~post5_Out_26|, main_~y~0=v_main_~y~0_Out_26, main_~z~0=v_main_~z~0_Out_54} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {4627#(= main_~y~0 0)} is VALID [2022-04-15 13:04:19,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {4627#(= 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[] {4623#false} is VALID [2022-04-15 13:04:19,084 INFO L272 TraceCheckUtils]: 9: Hoare triple {4623#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)); {4623#false} is VALID [2022-04-15 13:04:19,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {4623#false} ~cond := #in~cond; {4623#false} is VALID [2022-04-15 13:04:19,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {4623#false} assume 0 == ~cond; {4623#false} is VALID [2022-04-15 13:04:19,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {4623#false} assume !false; {4623#false} is VALID [2022-04-15 13:04:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:19,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:19,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899358418] [2022-04-15 13:04:19,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899358418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:19,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:19,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:19,292 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:19,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2118012275] [2022-04-15 13:04:19,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2118012275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:19,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:19,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 13:04:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382519634] [2022-04-15 13:04:19,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:19,293 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 13:04:19,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:19,293 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 13:04:19,315 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 13:04:19,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 13:04:19,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:19,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 13:04:19,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-15 13:04:19,316 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 13:04:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:20,136 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-04-15 13:04:20,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 13:04:20,136 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 13:04:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:20,136 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 13:04:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-15 13:04:20,137 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 13:04:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-15 13:04:20,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2022-04-15 13:04:20,189 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 13:04:20,190 INFO L225 Difference]: With dead ends: 77 [2022-04-15 13:04:20,190 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 13:04:20,190 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 2 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 13:04:20,190 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:20,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:04:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 13:04:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-04-15 13:04:20,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:20,240 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 13:04:20,240 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 13:04:20,240 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 13:04:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:20,240 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 13:04:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-15 13:04:20,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:20,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:20,241 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 13:04:20,241 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 13:04:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:20,242 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 13:04:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-15 13:04:20,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:20,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:20,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:20,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:20,242 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 13:04:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-15 13:04:20,242 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 33 [2022-04-15 13:04:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:20,243 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-15 13:04:20,243 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 13:04:20,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-15 13:04:20,317 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 13:04:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-15 13:04:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 13:04:20,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:20,318 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 13:04:20,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 13:04:20,318 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:20,318 INFO L85 PathProgramCache]: Analyzing trace with hash 241765410, now seen corresponding path program 14 times [2022-04-15 13:04:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:20,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [78311086] [2022-04-15 13:04:20,567 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:20,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2053085560, now seen corresponding path program 1 times [2022-04-15 13:04:20,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:20,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099690853] [2022-04-15 13:04:20,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:20,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:20,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:20,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {5006#(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); {5000#true} is VALID [2022-04-15 13:04:20,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {5000#true} assume true; {5000#true} is VALID [2022-04-15 13:04:20,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5000#true} {5000#true} #63#return; {5000#true} is VALID [2022-04-15 13:04:20,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {5000#true} call ULTIMATE.init(); {5006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:20,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {5006#(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); {5000#true} is VALID [2022-04-15 13:04:20,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {5000#true} assume true; {5000#true} is VALID [2022-04-15 13:04:20,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5000#true} {5000#true} #63#return; {5000#true} is VALID [2022-04-15 13:04:20,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {5000#true} call #t~ret7 := main(); {5000#true} is VALID [2022-04-15 13:04:20,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {5000#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5000#true} is VALID [2022-04-15 13:04:20,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {5000#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5005#(= main_~y~0 0)} is VALID [2022-04-15 13:04:20,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {5005#(= main_~y~0 0)} [101] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (let ((.cse0 (* 14 v_main_~y~0_Out_28))) (and (not (= (mod v_main_~z~0_Out_58 4) 0)) (< (mod (+ 4294967292 v_main_~z~0_Out_58) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_58 4294967294) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_58 4294967295) 4294967296) 268435455) (= (* 14 v_main_~y~0_In_14) .cse0) (< (mod (+ v_main_~z~0_Out_58 4294967293) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_28| 14) 0) (< (mod (+ 4294967295 v_main_~y~0_Out_28) 4294967296) 268435455) (= v_main_~z~0_Out_58 14) (= .cse0 0) (<= 268435455 (mod v_main_~z~0_Out_58 4294967296))))) InVars {main_~y~0=v_main_~y~0_In_14} OutVars{main_#t~post4=|v_main_#t~post4_Out_58|, main_#t~post5=|v_main_#t~post5_Out_28|, main_~y~0=v_main_~y~0_Out_28, main_~z~0=v_main_~z~0_Out_58} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {5005#(= main_~y~0 0)} is VALID [2022-04-15 13:04:20,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {5005#(= 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[] {5001#false} is VALID [2022-04-15 13:04:20,601 INFO L272 TraceCheckUtils]: 9: Hoare triple {5001#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)); {5001#false} is VALID [2022-04-15 13:04:20,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {5001#false} ~cond := #in~cond; {5001#false} is VALID [2022-04-15 13:04:20,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {5001#false} assume 0 == ~cond; {5001#false} is VALID [2022-04-15 13:04:20,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {5001#false} assume !false; {5001#false} is VALID [2022-04-15 13:04:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:20,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099690853] [2022-04-15 13:04:20,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099690853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:20,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:20,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:20,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:20,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [78311086] [2022-04-15 13:04:20,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [78311086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:20,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:20,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 13:04:20,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400414861] [2022-04-15 13:04:20,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:20,761 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 13:04:20,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:20,761 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 13:04:20,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:20,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 13:04:20,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:20,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 13:04:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-04-15 13:04:20,777 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 13:04:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:21,677 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-15 13:04:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 13:04:21,678 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 13:04:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:21,678 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 13:04:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-15 13:04:21,679 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 13:04:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-15 13:04:21,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2022-04-15 13:04:21,719 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 13:04:21,720 INFO L225 Difference]: With dead ends: 79 [2022-04-15 13:04:21,720 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 13:04:21,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 13:04:21,721 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:21,722 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 13:04:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 13:04:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2022-04-15 13:04:21,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:21,759 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 13:04:21,760 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 13:04:21,760 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 13:04:21,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:21,763 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-15 13:04:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 13:04:21,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:21,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:21,766 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 13:04:21,766 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 13:04:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:21,767 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-15 13:04:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 13:04:21,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:21,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:21,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:21,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:21,772 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 13:04:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-04-15 13:04:21,773 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 34 [2022-04-15 13:04:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:21,773 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-04-15 13:04:21,773 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 13:04:21,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 44 transitions. [2022-04-15 13:04:21,866 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 13:04:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-15 13:04:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 13:04:21,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:21,866 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 13:04:21,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 13:04:21,867 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:21,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash -142924286, now seen corresponding path program 15 times [2022-04-15 13:04:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:21,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408275278] [2022-04-15 13:04:22,145 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:22,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2112190904, now seen corresponding path program 1 times [2022-04-15 13:04:22,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:22,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667407791] [2022-04-15 13:04:22,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:22,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:22,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {5395#(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); {5389#true} is VALID [2022-04-15 13:04:22,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {5389#true} assume true; {5389#true} is VALID [2022-04-15 13:04:22,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5389#true} {5389#true} #63#return; {5389#true} is VALID [2022-04-15 13:04:22,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {5389#true} call ULTIMATE.init(); {5395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:22,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {5395#(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); {5389#true} is VALID [2022-04-15 13:04:22,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {5389#true} assume true; {5389#true} is VALID [2022-04-15 13:04:22,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5389#true} {5389#true} #63#return; {5389#true} is VALID [2022-04-15 13:04:22,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {5389#true} call #t~ret7 := main(); {5389#true} is VALID [2022-04-15 13:04:22,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {5389#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5389#true} is VALID [2022-04-15 13:04:22,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {5389#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5394#(= main_~y~0 0)} is VALID [2022-04-15 13:04:22,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {5394#(= main_~y~0 0)} [103] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_30 15))) (and (= .cse0 0) (< (mod (+ 4294967292 v_main_~z~0_Out_62) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_30) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_62 4294967294) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_62 4294967293) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_30| 15) 0) (= (* 15 v_main_~y~0_In_15) .cse0) (not (= (mod v_main_~z~0_Out_62 4) 0)) (= v_main_~z~0_Out_62 15) (<= 268435455 (mod v_main_~z~0_Out_62 4294967296)) (< (mod (+ 4294967290 v_main_~z~0_Out_62) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_62) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_62 4294967295) 4294967296) 268435455))) (= v_main_~y~0_In_15 v_main_~y~0_Out_30)) InVars {main_~y~0=v_main_~y~0_In_15} OutVars{main_#t~post4=|v_main_#t~post4_Out_62|, main_#t~post5=|v_main_#t~post5_Out_30|, main_~y~0=v_main_~y~0_Out_30, main_~z~0=v_main_~z~0_Out_62} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {5394#(= main_~y~0 0)} is VALID [2022-04-15 13:04:22,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {5394#(= 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[] {5390#false} is VALID [2022-04-15 13:04:22,188 INFO L272 TraceCheckUtils]: 9: Hoare triple {5390#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)); {5390#false} is VALID [2022-04-15 13:04:22,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {5390#false} ~cond := #in~cond; {5390#false} is VALID [2022-04-15 13:04:22,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {5390#false} assume 0 == ~cond; {5390#false} is VALID [2022-04-15 13:04:22,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {5390#false} assume !false; {5390#false} is VALID [2022-04-15 13:04:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:22,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667407791] [2022-04-15 13:04:22,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667407791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:22,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:22,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:22,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:22,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408275278] [2022-04-15 13:04:22,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408275278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:22,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:22,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 13:04:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119832261] [2022-04-15 13:04:22,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:22,426 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 13:04:22,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:22,426 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 13:04:22,449 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 13:04:22,450 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 13:04:22,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:22,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 13:04:22,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:04:22,450 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 13:04:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:23,372 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-04-15 13:04:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 13:04:23,372 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 13:04:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:23,395 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 13:04:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2022-04-15 13:04:23,395 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 13:04:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2022-04-15 13:04:23,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 67 transitions. [2022-04-15 13:04:23,442 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 13:04:23,443 INFO L225 Difference]: With dead ends: 81 [2022-04-15 13:04:23,443 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 13:04:23,443 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 13:04:23,444 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 44 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, 44 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:23,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 13:04:23,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 13:04:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-04-15 13:04:23,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:23,478 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 13:04:23,478 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 13:04:23,479 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 13:04:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:23,479 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-15 13:04:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-04-15 13:04:23,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:23,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:23,480 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 13:04:23,480 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 13:04:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:23,480 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-15 13:04:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-04-15 13:04:23,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:23,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:23,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:23,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:23,481 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 13:04:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-04-15 13:04:23,483 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 35 [2022-04-15 13:04:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:23,483 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-04-15 13:04:23,483 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 13:04:23,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2022-04-15 13:04:23,599 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 13:04:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-15 13:04:23,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 13:04:23,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:23,600 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 13:04:23,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 13:04:23,600 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:23,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:23,601 INFO L85 PathProgramCache]: Analyzing trace with hash 816597026, now seen corresponding path program 16 times [2022-04-15 13:04:23,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:23,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [256981543] [2022-04-15 13:04:23,833 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2123671048, now seen corresponding path program 1 times [2022-04-15 13:04:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:23,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942785364] [2022-04-15 13:04:23,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:23,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:23,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:23,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {5795#(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); {5789#true} is VALID [2022-04-15 13:04:23,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {5789#true} assume true; {5789#true} is VALID [2022-04-15 13:04:23,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5789#true} {5789#true} #63#return; {5789#true} is VALID [2022-04-15 13:04:23,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {5789#true} call ULTIMATE.init(); {5795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:23,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {5795#(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); {5789#true} is VALID [2022-04-15 13:04:23,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {5789#true} assume true; {5789#true} is VALID [2022-04-15 13:04:23,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5789#true} {5789#true} #63#return; {5789#true} is VALID [2022-04-15 13:04:23,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {5789#true} call #t~ret7 := main(); {5789#true} is VALID [2022-04-15 13:04:23,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {5789#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5789#true} is VALID [2022-04-15 13:04:23,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {5789#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5794#(= main_~y~0 0)} is VALID [2022-04-15 13:04:23,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {5794#(= main_~y~0 0)} [105] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_16 v_main_~y~0_Out_32) (let ((.cse0 (* 16 v_main_~y~0_Out_32))) (and (= (* |v_main_#t~post5_Out_32| 16) 0) (< (mod (+ v_main_~z~0_Out_66 4294967295) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_66 4294967293) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_66) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_32) 4294967296) 268435455) (= .cse0 0) (<= 268435455 (mod v_main_~z~0_Out_66 4294967296)) (< (mod (+ v_main_~z~0_Out_66 4294967294) 4294967296) 268435455) (= 16 v_main_~z~0_Out_66) (not (= (mod v_main_~z~0_Out_66 4) 0)) (= .cse0 (* 16 v_main_~y~0_In_16)) (< (mod (+ v_main_~z~0_Out_66 4294967289) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_66) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_66) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_66) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_16} OutVars{main_#t~post4=|v_main_#t~post4_Out_66|, main_#t~post5=|v_main_#t~post5_Out_32|, main_~y~0=v_main_~y~0_Out_32, main_~z~0=v_main_~z~0_Out_66} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {5794#(= main_~y~0 0)} is VALID [2022-04-15 13:04:23,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {5794#(= 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[] {5790#false} is VALID [2022-04-15 13:04:23,882 INFO L272 TraceCheckUtils]: 9: Hoare triple {5790#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)); {5790#false} is VALID [2022-04-15 13:04:23,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {5790#false} ~cond := #in~cond; {5790#false} is VALID [2022-04-15 13:04:23,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {5790#false} assume 0 == ~cond; {5790#false} is VALID [2022-04-15 13:04:23,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {5790#false} assume !false; {5790#false} is VALID [2022-04-15 13:04:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:23,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:23,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942785364] [2022-04-15 13:04:23,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942785364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:23,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:23,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:24,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:24,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [256981543] [2022-04-15 13:04:24,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [256981543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:24,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:24,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 13:04:24,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435728371] [2022-04-15 13:04:24,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:24,163 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 13:04:24,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:24,164 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 13:04:24,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:24,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 13:04:24,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:24,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 13:04:24,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-04-15 13:04:24,189 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 13:04:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:25,096 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-04-15 13:04:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 13:04:25,096 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 13:04:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:25,096 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 13:04:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-15 13:04:25,097 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 13:04:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-15 13:04:25,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2022-04-15 13:04:25,160 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 13:04:25,160 INFO L225 Difference]: With dead ends: 83 [2022-04-15 13:04:25,160 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 13:04:25,161 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 2 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 13:04:25,162 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:25,163 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 13:04:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 13:04:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2022-04-15 13:04:25,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:25,220 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 13:04:25,221 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 13:04:25,221 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 13:04:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:25,221 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 13:04:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-15 13:04:25,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:25,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:25,222 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 13:04:25,223 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 13:04:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:25,224 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 13:04:25,224 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-15 13:04:25,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:25,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:25,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:25,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:25,224 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 13:04:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-04-15 13:04:25,225 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 36 [2022-04-15 13:04:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:25,225 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-04-15 13:04:25,225 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 13:04:25,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 46 transitions. [2022-04-15 13:04:25,324 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 13:04:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-15 13:04:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 13:04:25,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:25,325 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 13:04:25,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 13:04:25,325 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:25,326 INFO L85 PathProgramCache]: Analyzing trace with hash 496986626, now seen corresponding path program 17 times [2022-04-15 13:04:25,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:25,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1885776805] [2022-04-15 13:04:25,638 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2064565704, now seen corresponding path program 1 times [2022-04-15 13:04:25,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:25,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710978334] [2022-04-15 13:04:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:25,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:25,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {6206#(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); {6200#true} is VALID [2022-04-15 13:04:25,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-15 13:04:25,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6200#true} {6200#true} #63#return; {6200#true} is VALID [2022-04-15 13:04:25,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {6200#true} call ULTIMATE.init(); {6206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:25,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {6206#(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); {6200#true} is VALID [2022-04-15 13:04:25,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-15 13:04:25,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6200#true} {6200#true} #63#return; {6200#true} is VALID [2022-04-15 13:04:25,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {6200#true} call #t~ret7 := main(); {6200#true} is VALID [2022-04-15 13:04:25,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {6200#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6200#true} is VALID [2022-04-15 13:04:25,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {6200#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6205#(= main_~y~0 0)} is VALID [2022-04-15 13:04:25,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {6205#(= main_~y~0 0)} [107] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_34 17))) (and (= v_main_~z~0_Out_70 17) (= .cse0 0) (< (mod (+ 4294967295 v_main_~y~0_Out_34) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_70 4) 0)) (<= 268435455 (mod v_main_~z~0_Out_70 4294967296)) (= (* |v_main_#t~post5_Out_34| 17) 0) (< (mod (+ v_main_~z~0_Out_70 4294967295) 4294967296) 268435455) (= (* v_main_~y~0_In_17 17) .cse0))) (= v_main_~y~0_In_17 v_main_~y~0_Out_34)) InVars {main_~y~0=v_main_~y~0_In_17} OutVars{main_#t~post4=|v_main_#t~post4_Out_70|, main_#t~post5=|v_main_#t~post5_Out_34|, main_~y~0=v_main_~y~0_Out_34, main_~z~0=v_main_~z~0_Out_70} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {6205#(= main_~y~0 0)} is VALID [2022-04-15 13:04:25,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {6205#(= 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[] {6201#false} is VALID [2022-04-15 13:04:25,699 INFO L272 TraceCheckUtils]: 9: Hoare triple {6201#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)); {6201#false} is VALID [2022-04-15 13:04:25,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {6201#false} ~cond := #in~cond; {6201#false} is VALID [2022-04-15 13:04:25,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {6201#false} assume 0 == ~cond; {6201#false} is VALID [2022-04-15 13:04:25,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {6201#false} assume !false; {6201#false} is VALID [2022-04-15 13:04:25,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 13:04:25,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:25,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710978334] [2022-04-15 13:04:25,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710978334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:25,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:25,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:25,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:25,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1885776805] [2022-04-15 13:04:25,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1885776805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:25,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:25,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 13:04:25,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142297905] [2022-04-15 13:04:25,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:25,962 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 13:04:25,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:25,962 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 13:04:25,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:25,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 13:04:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:25,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 13:04:25,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-15 13:04:25,990 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 13:04:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:27,235 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-04-15 13:04:27,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 13:04:27,235 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 13:04:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:27,235 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 13:04:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 69 transitions. [2022-04-15 13:04:27,236 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 13:04:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 69 transitions. [2022-04-15 13:04:27,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 69 transitions. [2022-04-15 13:04:27,302 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 13:04:27,303 INFO L225 Difference]: With dead ends: 85 [2022-04-15 13:04:27,303 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 13:04:27,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 13:04:27,304 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:27,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 13:04:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 13:04:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-04-15 13:04:27,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:27,344 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 13:04:27,344 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 13:04:27,345 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 13:04:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:27,345 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-15 13:04:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-04-15 13:04:27,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:27,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:27,346 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 13:04:27,346 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 13:04:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:27,347 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-15 13:04:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-04-15 13:04:27,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:27,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:27,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:27,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:27,347 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 13:04:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-15 13:04:27,348 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 37 [2022-04-15 13:04:27,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:27,348 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-15 13:04:27,348 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 13:04:27,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 47 transitions. [2022-04-15 13:04:27,451 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 13:04:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 13:04:27,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 13:04:27,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:27,452 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 13:04:27,452 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 13:04:27,452 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash -821001182, now seen corresponding path program 18 times [2022-04-15 13:04:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:27,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835132622] [2022-04-15 13:04:27,738 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2005460360, now seen corresponding path program 1 times [2022-04-15 13:04:27,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:27,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491397563] [2022-04-15 13:04:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:27,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:27,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:27,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {6628#(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); {6622#true} is VALID [2022-04-15 13:04:27,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {6622#true} assume true; {6622#true} is VALID [2022-04-15 13:04:27,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6622#true} {6622#true} #63#return; {6622#true} is VALID [2022-04-15 13:04:27,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {6622#true} call ULTIMATE.init(); {6628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:27,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {6628#(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); {6622#true} is VALID [2022-04-15 13:04:27,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {6622#true} assume true; {6622#true} is VALID [2022-04-15 13:04:27,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6622#true} {6622#true} #63#return; {6622#true} is VALID [2022-04-15 13:04:27,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {6622#true} call #t~ret7 := main(); {6622#true} is VALID [2022-04-15 13:04:27,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {6622#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6622#true} is VALID [2022-04-15 13:04:27,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {6622#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6627#(= main_~y~0 0)} is VALID [2022-04-15 13:04:27,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {6627#(= main_~y~0 0)} [109] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_18 v_main_~y~0_Out_36) (let ((.cse0 (* v_main_~y~0_Out_36 18))) (and (= .cse0 0) (< (mod (+ v_main_~z~0_Out_74 4294967294) 4294967296) 268435455) (= v_main_~z~0_Out_74 18) (< (mod (+ v_main_~z~0_Out_74 4294967289) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_36| 18) 0) (< (mod (+ v_main_~z~0_Out_74 4294967293) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_74) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_74 4294967287) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_36) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_74) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_74) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_74 4294967296)) (< (mod (+ v_main_~z~0_Out_74 4294967286) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_74 4) 0)) (< (mod (+ v_main_~z~0_Out_74 4294967295) 4294967296) 268435455) (= (* v_main_~y~0_In_18 18) .cse0) (< (mod (+ 4294967290 v_main_~z~0_Out_74) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_18} OutVars{main_#t~post4=|v_main_#t~post4_Out_74|, main_#t~post5=|v_main_#t~post5_Out_36|, main_~y~0=v_main_~y~0_Out_36, main_~z~0=v_main_~z~0_Out_74} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {6627#(= main_~y~0 0)} is VALID [2022-04-15 13:04:27,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {6627#(= 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[] {6623#false} is VALID [2022-04-15 13:04:27,805 INFO L272 TraceCheckUtils]: 9: Hoare triple {6623#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)); {6623#false} is VALID [2022-04-15 13:04:27,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {6623#false} ~cond := #in~cond; {6623#false} is VALID [2022-04-15 13:04:27,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {6623#false} assume 0 == ~cond; {6623#false} is VALID [2022-04-15 13:04:27,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {6623#false} assume !false; {6623#false} is VALID [2022-04-15 13:04:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:27,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:27,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491397563] [2022-04-15 13:04:27,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491397563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:27,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:27,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:28,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:28,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835132622] [2022-04-15 13:04:28,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835132622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:28,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:28,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 13:04:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003319667] [2022-04-15 13:04:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:28,034 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 13:04:28,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:28,034 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 13:04:28,056 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 13:04:28,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 13:04:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:28,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 13:04:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-04-15 13:04:28,057 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 13:04:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:29,125 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-04-15 13:04:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 13:04:29,126 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 13:04:29,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:29,126 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 13:04:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 70 transitions. [2022-04-15 13:04:29,126 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 13:04:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 70 transitions. [2022-04-15 13:04:29,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 70 transitions. [2022-04-15 13:04:29,178 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 13:04:29,179 INFO L225 Difference]: With dead ends: 87 [2022-04-15 13:04:29,179 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 13:04:29,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 13:04:29,180 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:29,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 46 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 13:04:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 13:04:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-04-15 13:04:29,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:29,231 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 13:04:29,231 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 13:04:29,231 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 13:04:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:29,233 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-04-15 13:04:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-15 13:04:29,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:29,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:29,233 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 13:04:29,233 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 13:04:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:29,234 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-04-15 13:04:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-15 13:04:29,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:29,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:29,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:29,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:29,234 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 13:04:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-15 13:04:29,235 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 38 [2022-04-15 13:04:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:29,235 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-15 13:04:29,235 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 13:04:29,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 48 transitions. [2022-04-15 13:04:29,334 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 13:04:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-15 13:04:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 13:04:29,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:29,335 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 13:04:29,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 13:04:29,335 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:29,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1271049730, now seen corresponding path program 19 times [2022-04-15 13:04:29,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:29,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1322359890] [2022-04-15 13:04:29,567 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1946355016, now seen corresponding path program 1 times [2022-04-15 13:04:29,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:29,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154674188] [2022-04-15 13:04:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:29,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:29,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {7061#(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); {7055#true} is VALID [2022-04-15 13:04:29,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {7055#true} assume true; {7055#true} is VALID [2022-04-15 13:04:29,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7055#true} {7055#true} #63#return; {7055#true} is VALID [2022-04-15 13:04:29,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {7055#true} call ULTIMATE.init(); {7061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:29,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {7061#(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); {7055#true} is VALID [2022-04-15 13:04:29,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {7055#true} assume true; {7055#true} is VALID [2022-04-15 13:04:29,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7055#true} {7055#true} #63#return; {7055#true} is VALID [2022-04-15 13:04:29,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {7055#true} call #t~ret7 := main(); {7055#true} is VALID [2022-04-15 13:04:29,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {7055#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7055#true} is VALID [2022-04-15 13:04:29,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {7055#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7060#(= main_~y~0 0)} is VALID [2022-04-15 13:04:29,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {7060#(= main_~y~0 0)} [111] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* 19 v_main_~y~0_Out_38))) (and (not (= (mod v_main_~z~0_Out_78 4) 0)) (< (mod (+ v_main_~z~0_Out_78 4294967287) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_78) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_78 4294967295) 4294967296) 268435455) (< (mod (+ 4294967279 v_main_~z~0_Out_78) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_78 4294967296)) (< (mod (+ 4294967290 v_main_~z~0_Out_78) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_78 4294967289) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_78) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_78) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_78 4294967280) 4294967296) 268435455) (= .cse0 (* 19 v_main_~y~0_In_19)) (< (mod (+ 4294967283 v_main_~z~0_Out_78) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_78 4294967281) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_78 4294967293) 4294967296) 268435455) (= (* 19 |v_main_#t~post5_Out_38|) 0) (< (mod (+ v_main_~z~0_Out_78 4294967286) 4294967296) 268435455) (= .cse0 0) (< (mod (+ v_main_~z~0_Out_78 4294967284) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_38) 4294967296) 268435455) (< (mod (+ 4294967282 v_main_~z~0_Out_78) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_78 4294967294) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_78 4294967278) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_78 4294967285) 4294967296) 268435455) (= 19 v_main_~z~0_Out_78))) (= v_main_~y~0_In_19 v_main_~y~0_Out_38)) InVars {main_~y~0=v_main_~y~0_In_19} OutVars{main_#t~post4=|v_main_#t~post4_Out_78|, main_#t~post5=|v_main_#t~post5_Out_38|, main_~y~0=v_main_~y~0_Out_38, main_~z~0=v_main_~z~0_Out_78} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {7060#(= main_~y~0 0)} is VALID [2022-04-15 13:04:29,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {7060#(= 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[] {7056#false} is VALID [2022-04-15 13:04:29,630 INFO L272 TraceCheckUtils]: 9: Hoare triple {7056#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)); {7056#false} is VALID [2022-04-15 13:04:29,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {7056#false} ~cond := #in~cond; {7056#false} is VALID [2022-04-15 13:04:29,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {7056#false} assume 0 == ~cond; {7056#false} is VALID [2022-04-15 13:04:29,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {7056#false} assume !false; {7056#false} is VALID [2022-04-15 13:04:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:29,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:29,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154674188] [2022-04-15 13:04:29,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154674188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:29,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:29,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:29,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:29,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1322359890] [2022-04-15 13:04:29,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1322359890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:29,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:29,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 13:04:29,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173371143] [2022-04-15 13:04:29,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:29,968 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 13:04:29,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:29,968 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 13:04:29,990 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 13:04:29,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 13:04:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:29,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 13:04:29,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-04-15 13:04:29,991 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 13:04:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:31,386 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-15 13:04:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 13:04:31,386 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 13:04:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:31,387 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 13:04:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 71 transitions. [2022-04-15 13:04:31,387 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 13:04:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 71 transitions. [2022-04-15 13:04:31,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 71 transitions. [2022-04-15 13:04:31,470 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 13:04:31,470 INFO L225 Difference]: With dead ends: 89 [2022-04-15 13:04:31,470 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 13:04:31,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 2 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 13:04:31,471 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:31,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 13:04:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 13:04:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2022-04-15 13:04:31,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:31,532 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 13:04:31,532 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 13:04:31,532 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 13:04:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:31,533 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-15 13:04:31,533 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-15 13:04:31,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:31,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:31,533 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 13:04:31,533 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 13:04:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:31,534 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-15 13:04:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-15 13:04:31,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:31,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:31,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:31,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:31,534 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 13:04:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-15 13:04:31,535 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 39 [2022-04-15 13:04:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:31,535 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-15 13:04:31,535 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 13:04:31,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-15 13:04:31,672 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 13:04:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-15 13:04:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 13:04:31,672 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:31,672 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 13:04:31,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 13:04:31,673 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:31,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:31,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1700118562, now seen corresponding path program 20 times [2022-04-15 13:04:31,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:31,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [686519809] [2022-04-15 13:04:31,952 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:31,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1887249672, now seen corresponding path program 1 times [2022-04-15 13:04:31,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:31,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403800977] [2022-04-15 13:04:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:31,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:31,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {7505#(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); {7499#true} is VALID [2022-04-15 13:04:31,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {7499#true} assume true; {7499#true} is VALID [2022-04-15 13:04:32,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7499#true} {7499#true} #63#return; {7499#true} is VALID [2022-04-15 13:04:32,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {7499#true} call ULTIMATE.init(); {7505#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:32,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {7505#(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); {7499#true} is VALID [2022-04-15 13:04:32,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {7499#true} assume true; {7499#true} is VALID [2022-04-15 13:04:32,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7499#true} {7499#true} #63#return; {7499#true} is VALID [2022-04-15 13:04:32,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {7499#true} call #t~ret7 := main(); {7499#true} is VALID [2022-04-15 13:04:32,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {7499#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7499#true} is VALID [2022-04-15 13:04:32,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {7499#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7504#(= main_~y~0 0)} is VALID [2022-04-15 13:04:32,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {7504#(= main_~y~0 0)} [113] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_20 v_main_~y~0_Out_40) (let ((.cse0 (* v_main_~y~0_Out_40 20))) (and (< (mod (+ v_main_~z~0_Out_82 4294967295) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_82 4294967293) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_82 4294967287) 4294967296) 268435455) (= .cse0 0) (< (mod (+ v_main_~z~0_Out_82 4294967289) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_82 4294967294) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_40) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_82 4294967296)) (< (mod (+ 4294967291 v_main_~z~0_Out_82) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_82) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_82) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_40| 20) 0) (= (* v_main_~y~0_In_20 20) .cse0) (not (= (mod v_main_~z~0_Out_82 4) 0)) (< (mod (+ 4294967292 v_main_~z~0_Out_82) 4294967296) 268435455) (= v_main_~z~0_Out_82 20)))) InVars {main_~y~0=v_main_~y~0_In_20} OutVars{main_#t~post4=|v_main_#t~post4_Out_82|, main_#t~post5=|v_main_#t~post5_Out_40|, main_~y~0=v_main_~y~0_Out_40, main_~z~0=v_main_~z~0_Out_82} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {7504#(= main_~y~0 0)} is VALID [2022-04-15 13:04:32,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {7504#(= 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[] {7500#false} is VALID [2022-04-15 13:04:32,002 INFO L272 TraceCheckUtils]: 9: Hoare triple {7500#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)); {7500#false} is VALID [2022-04-15 13:04:32,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {7500#false} ~cond := #in~cond; {7500#false} is VALID [2022-04-15 13:04:32,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {7500#false} assume 0 == ~cond; {7500#false} is VALID [2022-04-15 13:04:32,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {7500#false} assume !false; {7500#false} is VALID [2022-04-15 13:04:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:32,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:32,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403800977] [2022-04-15 13:04:32,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403800977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:32,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:32,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:32,348 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:32,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [686519809] [2022-04-15 13:04:32,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [686519809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:32,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:32,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 13:04:32,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044671111] [2022-04-15 13:04:32,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:32,349 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 13:04:32,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:32,349 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 13:04:32,378 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 13:04:32,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 13:04:32,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:32,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 13:04:32,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-04-15 13:04:32,379 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 13:04:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:33,615 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-15 13:04:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 13:04:33,615 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 13:04:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:33,616 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 13:04:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions. [2022-04-15 13:04:33,616 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 13:04:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions. [2022-04-15 13:04:33,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 72 transitions. [2022-04-15 13:04:33,659 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 13:04:33,659 INFO L225 Difference]: With dead ends: 91 [2022-04-15 13:04:33,659 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 13:04:33,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=1964, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 13:04:33,661 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:33,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 13:04:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 13:04:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2022-04-15 13:04:33,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:33,723 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 13:04:33,723 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 13:04:33,723 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 13:04:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:33,725 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 13:04:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-15 13:04:33,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:33,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:33,726 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 13:04:33,726 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 13:04:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:33,735 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 13:04:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-15 13:04:33,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:33,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:33,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:33,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:33,736 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 13:04:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-15 13:04:33,756 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 40 [2022-04-15 13:04:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:33,756 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-15 13:04:33,756 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 13:04:33,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-15 13:04:33,863 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 13:04:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 13:04:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 13:04:33,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:33,865 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 13:04:33,865 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 13:04:33,865 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:33,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2116350466, now seen corresponding path program 21 times [2022-04-15 13:04:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:33,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1491719200] [2022-04-15 13:04:34,105 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:34,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1828144328, now seen corresponding path program 1 times [2022-04-15 13:04:34,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:34,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524543448] [2022-04-15 13:04:34,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:34,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:34,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {7960#(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); {7954#true} is VALID [2022-04-15 13:04:34,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {7954#true} assume true; {7954#true} is VALID [2022-04-15 13:04:34,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7954#true} {7954#true} #63#return; {7954#true} is VALID [2022-04-15 13:04:34,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {7954#true} call ULTIMATE.init(); {7960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:34,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {7960#(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); {7954#true} is VALID [2022-04-15 13:04:34,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {7954#true} assume true; {7954#true} is VALID [2022-04-15 13:04:34,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7954#true} {7954#true} #63#return; {7954#true} is VALID [2022-04-15 13:04:34,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {7954#true} call #t~ret7 := main(); {7954#true} is VALID [2022-04-15 13:04:34,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {7954#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7954#true} is VALID [2022-04-15 13:04:34,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {7954#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7959#(= main_~y~0 0)} is VALID [2022-04-15 13:04:34,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {7959#(= main_~y~0 0)} [115] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (let ((.cse0 (* 21 v_main_~y~0_Out_42))) (and (= (* |v_main_#t~post5_Out_42| 21) 0) (not (= 0 (mod v_main_~z~0_Out_86 4))) (= v_main_~z~0_Out_86 21) (< (mod (+ v_main_~z~0_Out_86 4294967295) 4294967296) 268435455) (= .cse0 0) (< (mod (+ v_main_~z~0_Out_86 4294967294) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_86 4294967296)) (< (mod (+ 4294967295 v_main_~y~0_Out_42) 4294967296) 268435455) (= (* 21 v_main_~y~0_In_21) .cse0)))) InVars {main_~y~0=v_main_~y~0_In_21} OutVars{main_#t~post4=|v_main_#t~post4_Out_86|, main_#t~post5=|v_main_#t~post5_Out_42|, main_~y~0=v_main_~y~0_Out_42, main_~z~0=v_main_~z~0_Out_86} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {7959#(= main_~y~0 0)} is VALID [2022-04-15 13:04:34,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {7959#(= 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[] {7955#false} is VALID [2022-04-15 13:04:34,174 INFO L272 TraceCheckUtils]: 9: Hoare triple {7955#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)); {7955#false} is VALID [2022-04-15 13:04:34,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {7955#false} ~cond := #in~cond; {7955#false} is VALID [2022-04-15 13:04:34,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {7955#false} assume 0 == ~cond; {7955#false} is VALID [2022-04-15 13:04:34,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {7955#false} assume !false; {7955#false} is VALID [2022-04-15 13:04:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:34,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:34,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524543448] [2022-04-15 13:04:34,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524543448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:34,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:34,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:34,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:34,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1491719200] [2022-04-15 13:04:34,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1491719200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:34,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:34,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 13:04:34,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41138534] [2022-04-15 13:04:34,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:34,404 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 13:04:34,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:34,404 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 13:04:34,426 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 13:04:34,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 13:04:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:34,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 13:04:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-04-15 13:04:34,427 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 13:04:35,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:35,937 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-04-15 13:04:35,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 13:04:35,937 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 13:04:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:35,938 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 13:04:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 73 transitions. [2022-04-15 13:04:35,938 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 13:04:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 73 transitions. [2022-04-15 13:04:35,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 73 transitions. [2022-04-15 13:04:36,013 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 13:04:36,014 INFO L225 Difference]: With dead ends: 93 [2022-04-15 13:04:36,014 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 13:04:36,015 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=2145, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 13:04:36,015 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:36,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 13:04:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 13:04:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2022-04-15 13:04:36,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:36,087 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 13:04:36,092 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 13:04:36,103 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 13:04:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:36,104 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-15 13:04:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-15 13:04:36,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:36,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:36,105 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 13:04:36,105 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 13:04:36,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:36,105 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-15 13:04:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-15 13:04:36,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:36,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:36,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:36,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:36,106 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 13:04:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-04-15 13:04:36,106 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 41 [2022-04-15 13:04:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:36,107 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-04-15 13:04:36,107 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 13:04:36,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 51 transitions. [2022-04-15 13:04:36,357 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 13:04:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-04-15 13:04:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 13:04:36,357 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:36,357 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 13:04:36,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 13:04:36,376 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2134637602, now seen corresponding path program 22 times [2022-04-15 13:04:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:36,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855894973] [2022-04-15 13:04:36,697 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:36,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1769038984, now seen corresponding path program 1 times [2022-04-15 13:04:36,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:36,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745437403] [2022-04-15 13:04:36,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:36,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:36,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:36,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {8426#(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); {8420#true} is VALID [2022-04-15 13:04:36,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {8420#true} assume true; {8420#true} is VALID [2022-04-15 13:04:36,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8420#true} {8420#true} #63#return; {8420#true} is VALID [2022-04-15 13:04:36,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {8420#true} call ULTIMATE.init(); {8426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:36,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {8426#(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); {8420#true} is VALID [2022-04-15 13:04:36,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {8420#true} assume true; {8420#true} is VALID [2022-04-15 13:04:36,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8420#true} {8420#true} #63#return; {8420#true} is VALID [2022-04-15 13:04:36,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {8420#true} call #t~ret7 := main(); {8420#true} is VALID [2022-04-15 13:04:36,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {8420#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {8420#true} is VALID [2022-04-15 13:04:36,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {8420#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {8425#(= main_~y~0 0)} is VALID [2022-04-15 13:04:36,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {8425#(= main_~y~0 0)} [117] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_22 v_main_~y~0_Out_44) (let ((.cse0 (* 22 v_main_~y~0_Out_44))) (and (< (mod (+ 4294967292 v_main_~z~0_Out_90) 4294967296) 268435455) (= v_main_~z~0_Out_90 22) (< (mod (+ 4294967295 v_main_~y~0_Out_44) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_90 4294967295) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_90 4) 0)) (= .cse0 (* 22 v_main_~y~0_In_22)) (< (mod (+ v_main_~z~0_Out_90 4294967285) 4294967296) 268435455) (= .cse0 0) (<= 268435455 (mod v_main_~z~0_Out_90 4294967296)) (< (mod (+ 4294967288 v_main_~z~0_Out_90) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_44| 22) 0) (< (mod (+ v_main_~z~0_Out_90 4294967294) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_90 4294967293) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_90 4294967286) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_90) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_90 4294967289) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_90) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_90 4294967287) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_22} OutVars{main_#t~post4=|v_main_#t~post4_Out_90|, main_#t~post5=|v_main_#t~post5_Out_44|, main_~y~0=v_main_~y~0_Out_44, main_~z~0=v_main_~z~0_Out_90} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {8425#(= main_~y~0 0)} is VALID [2022-04-15 13:04:36,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {8425#(= 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[] {8421#false} is VALID [2022-04-15 13:04:36,742 INFO L272 TraceCheckUtils]: 9: Hoare triple {8421#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)); {8421#false} is VALID [2022-04-15 13:04:36,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {8421#false} ~cond := #in~cond; {8421#false} is VALID [2022-04-15 13:04:36,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {8421#false} assume 0 == ~cond; {8421#false} is VALID [2022-04-15 13:04:36,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {8421#false} assume !false; {8421#false} is VALID [2022-04-15 13:04:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:36,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:36,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745437403] [2022-04-15 13:04:36,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745437403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:36,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:36,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:37,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:37,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855894973] [2022-04-15 13:04:37,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855894973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:37,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:37,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 13:04:37,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961723917] [2022-04-15 13:04:37,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:37,058 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 13:04:37,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:37,059 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 13:04:37,086 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 13:04:37,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 13:04:37,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:37,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 13:04:37,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:04:37,087 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 13:04:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:38,560 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2022-04-15 13:04:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 13:04:38,560 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 13:04:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:38,561 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 13:04:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 74 transitions. [2022-04-15 13:04:38,561 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 13:04:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 74 transitions. [2022-04-15 13:04:38,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 74 transitions. [2022-04-15 13:04:38,611 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 13:04:38,611 INFO L225 Difference]: With dead ends: 95 [2022-04-15 13:04:38,611 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 13:04:38,612 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=2334, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 13:04:38,613 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:38,613 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 13:04:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 13:04:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-04-15 13:04:38,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:38,659 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 13:04:38,659 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 13:04:38,659 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 13:04:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:38,660 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-04-15 13:04:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-04-15 13:04:38,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:38,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:38,660 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 13:04:38,660 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 13:04:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:38,661 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-04-15 13:04:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-04-15 13:04:38,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:38,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:38,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:38,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:38,661 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 13:04:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-04-15 13:04:38,662 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 42 [2022-04-15 13:04:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:38,662 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-04-15 13:04:38,662 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 13:04:38,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 52 transitions. [2022-04-15 13:04:38,828 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 13:04:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-15 13:04:38,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 13:04:38,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:38,829 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 13:04:38,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 13:04:38,829 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:38,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1593428478, now seen corresponding path program 23 times [2022-04-15 13:04:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:38,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1574934607] [2022-04-15 13:04:39,134 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1709933640, now seen corresponding path program 1 times [2022-04-15 13:04:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:39,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622569075] [2022-04-15 13:04:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:39,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:39,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:39,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {8903#(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); {8897#true} is VALID [2022-04-15 13:04:39,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {8897#true} assume true; {8897#true} is VALID [2022-04-15 13:04:39,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8897#true} {8897#true} #63#return; {8897#true} is VALID [2022-04-15 13:04:39,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {8897#true} call ULTIMATE.init(); {8903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:39,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {8903#(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); {8897#true} is VALID [2022-04-15 13:04:39,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {8897#true} assume true; {8897#true} is VALID [2022-04-15 13:04:39,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8897#true} {8897#true} #63#return; {8897#true} is VALID [2022-04-15 13:04:39,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {8897#true} call #t~ret7 := main(); {8897#true} is VALID [2022-04-15 13:04:39,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {8897#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {8897#true} is VALID [2022-04-15 13:04:39,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {8897#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {8902#(= main_~y~0 0)} is VALID [2022-04-15 13:04:39,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {8902#(= main_~y~0 0)} [119] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_23 v_main_~y~0_Out_46) (let ((.cse0 (* 23 v_main_~y~0_Out_46))) (and (= .cse0 (* 23 v_main_~y~0_In_23)) (<= 268435455 (mod v_main_~z~0_Out_94 4294967296)) (< (mod (+ 4294967295 v_main_~y~0_Out_46) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_94 4) 0)) (= .cse0 0) (= (* 23 |v_main_#t~post5_Out_46|) 0) (= 23 v_main_~z~0_Out_94)))) InVars {main_~y~0=v_main_~y~0_In_23} OutVars{main_#t~post4=|v_main_#t~post4_Out_94|, main_#t~post5=|v_main_#t~post5_Out_46|, main_~y~0=v_main_~y~0_Out_46, main_~z~0=v_main_~z~0_Out_94} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {8902#(= main_~y~0 0)} is VALID [2022-04-15 13:04:39,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {8902#(= 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[] {8898#false} is VALID [2022-04-15 13:04:39,216 INFO L272 TraceCheckUtils]: 9: Hoare triple {8898#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)); {8898#false} is VALID [2022-04-15 13:04:39,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {8898#false} ~cond := #in~cond; {8898#false} is VALID [2022-04-15 13:04:39,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {8898#false} assume 0 == ~cond; {8898#false} is VALID [2022-04-15 13:04:39,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {8898#false} assume !false; {8898#false} is VALID [2022-04-15 13:04:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:39,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:39,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622569075] [2022-04-15 13:04:39,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622569075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:39,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:39,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:39,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:39,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1574934607] [2022-04-15 13:04:39,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1574934607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:39,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:39,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 13:04:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633482835] [2022-04-15 13:04:39,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:39,652 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 13:04:39,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:39,652 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 13:04:39,687 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 13:04:39,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 13:04:39,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:39,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 13:04:39,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2022-04-15 13:04:39,688 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 13:04:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:41,595 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-04-15 13:04:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 13:04:41,595 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 13:04:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:41,595 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 13:04:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-15 13:04:41,596 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 13:04:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-15 13:04:41,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2022-04-15 13:04:41,673 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 13:04:41,674 INFO L225 Difference]: With dead ends: 97 [2022-04-15 13:04:41,674 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 13:04:41,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=2531, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 13:04:41,675 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:41,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 13:04:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 13:04:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-04-15 13:04:41,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:41,726 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 13:04:41,726 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 13:04:41,726 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 13:04:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:41,727 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-04-15 13:04:41,728 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-15 13:04:41,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:41,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:41,729 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 13:04:41,729 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 13:04:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:41,730 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-04-15 13:04:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-15 13:04:41,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:41,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:41,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:41,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:41,730 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 13:04:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-04-15 13:04:41,731 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 43 [2022-04-15 13:04:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:41,731 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-04-15 13:04:41,731 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 13:04:41,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 53 transitions. [2022-04-15 13:04:41,963 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 13:04:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-04-15 13:04:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 13:04:41,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:41,964 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 13:04:41,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 13:04:41,964 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1199359966, now seen corresponding path program 24 times [2022-04-15 13:04:41,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:41,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993783352] [2022-04-15 13:04:42,330 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:42,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1650828296, now seen corresponding path program 1 times [2022-04-15 13:04:42,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:42,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122349262] [2022-04-15 13:04:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:42,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:42,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {9391#(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); {9385#true} is VALID [2022-04-15 13:04:42,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {9385#true} assume true; {9385#true} is VALID [2022-04-15 13:04:42,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9385#true} {9385#true} #63#return; {9385#true} is VALID [2022-04-15 13:04:42,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {9385#true} call ULTIMATE.init(); {9391#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:42,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {9391#(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); {9385#true} is VALID [2022-04-15 13:04:42,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {9385#true} assume true; {9385#true} is VALID [2022-04-15 13:04:42,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9385#true} {9385#true} #63#return; {9385#true} is VALID [2022-04-15 13:04:42,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {9385#true} call #t~ret7 := main(); {9385#true} is VALID [2022-04-15 13:04:42,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {9385#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {9385#true} is VALID [2022-04-15 13:04:42,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {9385#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {9390#(= main_~y~0 0)} is VALID [2022-04-15 13:04:42,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {9390#(= main_~y~0 0)} [121] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_48 24))) (and (< (mod (+ 4294967291 v_main_~z~0_Out_98) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967288 v_main_~z~0_Out_98) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_98 4294967287) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_98) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_48) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_98 4294967285) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_48| 24) 0) (< (mod (+ v_main_~z~0_Out_98 4294967294) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_98 4294967293) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_98 4294967289) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_98 4294967296)) (< (mod (+ 4294967292 v_main_~z~0_Out_98) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_98 4294967295) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_98 4294967286) 4294967296) 268435455) (= v_main_~z~0_Out_98 24) (< (mod (+ v_main_~z~0_Out_98 4294967284) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_98 4) 0)) (= .cse0 (* v_main_~y~0_In_24 24)))) (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) InVars {main_~y~0=v_main_~y~0_In_24} OutVars{main_#t~post4=|v_main_#t~post4_Out_98|, main_#t~post5=|v_main_#t~post5_Out_48|, main_~y~0=v_main_~y~0_Out_48, main_~z~0=v_main_~z~0_Out_98} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {9390#(= main_~y~0 0)} is VALID [2022-04-15 13:04:42,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {9390#(= 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[] {9386#false} is VALID [2022-04-15 13:04:42,416 INFO L272 TraceCheckUtils]: 9: Hoare triple {9386#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)); {9386#false} is VALID [2022-04-15 13:04:42,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {9386#false} ~cond := #in~cond; {9386#false} is VALID [2022-04-15 13:04:42,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {9386#false} assume 0 == ~cond; {9386#false} is VALID [2022-04-15 13:04:42,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {9386#false} assume !false; {9386#false} is VALID [2022-04-15 13:04:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:42,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122349262] [2022-04-15 13:04:42,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122349262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:42,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:42,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:42,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:42,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993783352] [2022-04-15 13:04:42,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993783352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:42,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:42,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 13:04:42,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536854910] [2022-04-15 13:04:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:42,778 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 13:04:42,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:42,779 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 13:04:42,804 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 13:04:42,804 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 13:04:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:42,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 13:04:42,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-04-15 13:04:42,809 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 13:04:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:45,103 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-04-15 13:04:45,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 13:04:45,104 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 13:04:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:45,104 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 13:04:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 76 transitions. [2022-04-15 13:04:45,119 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 13:04:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 76 transitions. [2022-04-15 13:04:45,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 76 transitions. [2022-04-15 13:04:45,230 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 13:04:45,230 INFO L225 Difference]: With dead ends: 99 [2022-04-15 13:04:45,230 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 13:04:45,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=2736, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 13:04:45,232 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:45,232 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 141 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 13:04:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 13:04:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-04-15 13:04:45,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:45,306 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 13:04:45,306 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 13:04:45,306 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 13:04:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:45,307 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 13:04:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 13:04:45,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:45,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:45,308 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 13:04:45,308 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 13:04:45,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:45,309 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 13:04:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 13:04:45,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:45,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:45,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:45,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:45,309 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 13:04:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-04-15 13:04:45,310 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 44 [2022-04-15 13:04:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:45,310 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-04-15 13:04:45,310 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 13:04:45,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2022-04-15 13:04:45,812 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 13:04:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-15 13:04:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 13:04:45,813 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:45,813 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 13:04:45,813 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 13:04:45,813 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:45,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:45,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1868137982, now seen corresponding path program 25 times [2022-04-15 13:04:45,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:45,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553580045] [2022-04-15 13:04:46,075 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:46,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1591722952, now seen corresponding path program 1 times [2022-04-15 13:04:46,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:46,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012711934] [2022-04-15 13:04:46,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:46,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:46,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:46,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {9890#(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); {9884#true} is VALID [2022-04-15 13:04:46,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-15 13:04:46,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9884#true} {9884#true} #63#return; {9884#true} is VALID [2022-04-15 13:04:46,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {9884#true} call ULTIMATE.init(); {9890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:46,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {9890#(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); {9884#true} is VALID [2022-04-15 13:04:46,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-15 13:04:46,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9884#true} {9884#true} #63#return; {9884#true} is VALID [2022-04-15 13:04:46,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {9884#true} call #t~ret7 := main(); {9884#true} is VALID [2022-04-15 13:04:46,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {9884#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {9884#true} is VALID [2022-04-15 13:04:46,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {9884#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {9889#(= main_~y~0 0)} is VALID [2022-04-15 13:04:46,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {9889#(= main_~y~0 0)} [123] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (let ((.cse0 (* v_main_~y~0_Out_50 25))) (and (< (mod (+ 4294967289 v_main_~z~0_Out_102) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_102) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_102) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_102) 4294967296) 268435455) (= (* v_main_~y~0_In_25 25) .cse0) (< (mod (+ 4294967293 v_main_~z~0_Out_102) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_102) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_102 4294967296)) (< (mod (+ 4294967295 v_main_~y~0_Out_50) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_102) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_102) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_102 4) 0)) (< (mod (+ 4294967286 v_main_~z~0_Out_102) 4294967296) 268435455) (= .cse0 0) (= (* |v_main_#t~post5_Out_50| 25) 0) (< (mod (+ 4294967287 v_main_~z~0_Out_102) 4294967296) 268435455) (= 25 v_main_~z~0_Out_102)))) InVars {main_~y~0=v_main_~y~0_In_25} OutVars{main_#t~post4=|v_main_#t~post4_Out_102|, main_#t~post5=|v_main_#t~post5_Out_50|, main_~y~0=v_main_~y~0_Out_50, main_~z~0=v_main_~z~0_Out_102} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {9889#(= main_~y~0 0)} is VALID [2022-04-15 13:04:46,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {9889#(= 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[] {9885#false} is VALID [2022-04-15 13:04:46,124 INFO L272 TraceCheckUtils]: 9: Hoare triple {9885#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)); {9885#false} is VALID [2022-04-15 13:04:46,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {9885#false} ~cond := #in~cond; {9885#false} is VALID [2022-04-15 13:04:46,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {9885#false} assume 0 == ~cond; {9885#false} is VALID [2022-04-15 13:04:46,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {9885#false} assume !false; {9885#false} is VALID [2022-04-15 13:04:46,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 13:04:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:46,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012711934] [2022-04-15 13:04:46,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012711934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:46,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:46,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:46,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:46,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553580045] [2022-04-15 13:04:46,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553580045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:46,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:46,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 13:04:46,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696943674] [2022-04-15 13:04:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:46,468 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 13:04:46,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:46,468 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 13:04:46,494 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 13:04:46,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 13:04:46,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:46,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 13:04:46,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2022-04-15 13:04:46,495 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 13:04:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:49,042 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-04-15 13:04:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 13:04:49,042 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 13:04:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:49,042 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 13:04:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 13:04:49,043 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 13:04:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 13:04:49,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 77 transitions. [2022-04-15 13:04:49,103 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 13:04:49,103 INFO L225 Difference]: With dead ends: 101 [2022-04-15 13:04:49,104 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 13:04:49,105 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=2949, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 13:04:49,105 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:49,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 156 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 13:04:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 13:04:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-04-15 13:04:49,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:49,208 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 13:04:49,208 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 13:04:49,209 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 13:04:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:49,209 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-04-15 13:04:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-15 13:04:49,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:49,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:49,210 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 13:04:49,210 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 13:04:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:49,210 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-04-15 13:04:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-15 13:04:49,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:49,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:49,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:49,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:49,211 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 13:04:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-04-15 13:04:49,211 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 45 [2022-04-15 13:04:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:49,211 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-04-15 13:04:49,212 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 13:04:49,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 55 transitions. [2022-04-15 13:04:49,361 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 13:04:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-04-15 13:04:49,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 13:04:49,363 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:49,363 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 13:04:49,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 13:04:49,363 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1125419998, now seen corresponding path program 26 times [2022-04-15 13:04:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:49,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [371135964] [2022-04-15 13:04:49,717 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1532617608, now seen corresponding path program 1 times [2022-04-15 13:04:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:49,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313907430] [2022-04-15 13:04:49,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:49,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:49,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {10400#(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); {10394#true} is VALID [2022-04-15 13:04:49,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-15 13:04:49,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10394#true} {10394#true} #63#return; {10394#true} is VALID [2022-04-15 13:04:49,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {10394#true} call ULTIMATE.init(); {10400#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:49,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {10400#(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); {10394#true} is VALID [2022-04-15 13:04:49,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-15 13:04:49,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10394#true} {10394#true} #63#return; {10394#true} is VALID [2022-04-15 13:04:49,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {10394#true} call #t~ret7 := main(); {10394#true} is VALID [2022-04-15 13:04:49,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {10394#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {10394#true} is VALID [2022-04-15 13:04:49,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {10394#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {10399#(= main_~y~0 0)} is VALID [2022-04-15 13:04:49,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {10399#(= main_~y~0 0)} [125] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_52 26))) (and (< (mod (+ 4294967292 v_main_~z~0_Out_106) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_106) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_106) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_106) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_106) 4294967296) 268435455) (= .cse0 (* v_main_~y~0_In_26 26)) (< (mod (+ 4294967289 v_main_~z~0_Out_106) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_106) 4294967296) 268435455) (< (mod (+ 4294967287 v_main_~z~0_Out_106) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_106 4) 0)) (< (mod (+ 4294967293 v_main_~z~0_Out_106) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_106) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_52| 26) 0) (< (mod (+ 4294967285 v_main_~z~0_Out_106) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_52) 4294967296) 268435455) (= 26 v_main_~z~0_Out_106) (= .cse0 0) (<= 268435455 (mod v_main_~z~0_Out_106 4294967296)))) (= v_main_~y~0_In_26 v_main_~y~0_Out_52)) InVars {main_~y~0=v_main_~y~0_In_26} OutVars{main_#t~post4=|v_main_#t~post4_Out_106|, main_#t~post5=|v_main_#t~post5_Out_52|, main_~y~0=v_main_~y~0_Out_52, main_~z~0=v_main_~z~0_Out_106} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {10399#(= main_~y~0 0)} is VALID [2022-04-15 13:04:49,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {10399#(= 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[] {10395#false} is VALID [2022-04-15 13:04:49,777 INFO L272 TraceCheckUtils]: 9: Hoare triple {10395#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)); {10395#false} is VALID [2022-04-15 13:04:49,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {10395#false} ~cond := #in~cond; {10395#false} is VALID [2022-04-15 13:04:49,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {10395#false} assume 0 == ~cond; {10395#false} is VALID [2022-04-15 13:04:49,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {10395#false} assume !false; {10395#false} is VALID [2022-04-15 13:04:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:49,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:49,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313907430] [2022-04-15 13:04:49,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313907430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:49,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:49,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:50,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:50,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [371135964] [2022-04-15 13:04:50,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [371135964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:50,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:50,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 13:04:50,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496628305] [2022-04-15 13:04:50,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:50,175 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 13:04:50,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:50,175 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 13:04:50,202 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 13:04:50,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 13:04:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:50,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 13:04:50,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2022-04-15 13:04:50,203 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 13:04:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:52,808 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-04-15 13:04:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 13:04:52,808 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 13:04:52,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:52,808 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 13:04:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2022-04-15 13:04:52,809 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 13:04:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2022-04-15 13:04:52,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 78 transitions. [2022-04-15 13:04:52,881 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 13:04:52,882 INFO L225 Difference]: With dead ends: 103 [2022-04-15 13:04:52,882 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 13:04:52,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=3170, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 13:04:52,883 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:52,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 106 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 13:04:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 13:04:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-04-15 13:04:52,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:52,943 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 13:04:52,944 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 13:04:52,944 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 13:04:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:52,944 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-04-15 13:04:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-04-15 13:04:52,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:52,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:52,945 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 13:04:52,945 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 13:04:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:52,945 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-04-15 13:04:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-04-15 13:04:52,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:52,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:52,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:52,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:52,946 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 13:04:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-04-15 13:04:52,947 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 46 [2022-04-15 13:04:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:52,947 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-04-15 13:04:52,947 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 13:04:52,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 56 transitions. [2022-04-15 13:04:53,133 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 13:04:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 13:04:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 13:04:53,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:53,134 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 13:04:53,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 13:04:53,134 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:53,134 INFO L85 PathProgramCache]: Analyzing trace with hash 424001026, now seen corresponding path program 27 times [2022-04-15 13:04:53,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:53,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520259162] [2022-04-15 13:04:53,429 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:53,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1473512264, now seen corresponding path program 1 times [2022-04-15 13:04:53,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:53,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18731922] [2022-04-15 13:04:53,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:53,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:53,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:53,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {10921#(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); {10915#true} is VALID [2022-04-15 13:04:53,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {10915#true} assume true; {10915#true} is VALID [2022-04-15 13:04:53,469 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10915#true} {10915#true} #63#return; {10915#true} is VALID [2022-04-15 13:04:53,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {10915#true} call ULTIMATE.init(); {10921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:53,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {10921#(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); {10915#true} is VALID [2022-04-15 13:04:53,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {10915#true} assume true; {10915#true} is VALID [2022-04-15 13:04:53,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10915#true} {10915#true} #63#return; {10915#true} is VALID [2022-04-15 13:04:53,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {10915#true} call #t~ret7 := main(); {10915#true} is VALID [2022-04-15 13:04:53,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {10915#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {10915#true} is VALID [2022-04-15 13:04:53,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {10915#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {10920#(= main_~y~0 0)} is VALID [2022-04-15 13:04:53,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {10920#(= main_~y~0 0)} [127] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (let ((.cse0 (* v_main_~y~0_Out_54 27))) (and (< (mod (+ 4294967292 v_main_~z~0_Out_110) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_54| 27) 0) (< (mod (+ 4294967290 v_main_~z~0_Out_110) 4294967296) 268435455) (= (* v_main_~y~0_In_27 27) .cse0) (< (mod (+ 4294967288 v_main_~z~0_Out_110) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_110) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_54) 4294967296) 268435455) (= 27 v_main_~z~0_Out_110) (< (mod (+ 4294967293 v_main_~z~0_Out_110) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967294 v_main_~z~0_Out_110) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_110) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_110 4) 0)) (<= 268435455 (mod v_main_~z~0_Out_110 4294967296)) (< (mod (+ 4294967295 v_main_~z~0_Out_110) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_27} OutVars{main_#t~post4=|v_main_#t~post4_Out_110|, main_#t~post5=|v_main_#t~post5_Out_54|, main_~y~0=v_main_~y~0_Out_54, main_~z~0=v_main_~z~0_Out_110} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {10920#(= main_~y~0 0)} is VALID [2022-04-15 13:04:53,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {10920#(= 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[] {10916#false} is VALID [2022-04-15 13:04:53,476 INFO L272 TraceCheckUtils]: 9: Hoare triple {10916#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)); {10916#false} is VALID [2022-04-15 13:04:53,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {10916#false} ~cond := #in~cond; {10916#false} is VALID [2022-04-15 13:04:53,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {10916#false} assume 0 == ~cond; {10916#false} is VALID [2022-04-15 13:04:53,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {10916#false} assume !false; {10916#false} is VALID [2022-04-15 13:04:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:53,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:53,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18731922] [2022-04-15 13:04:53,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18731922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:53,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:53,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:53,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:53,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520259162] [2022-04-15 13:04:53,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520259162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:53,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:53,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 13:04:53,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667214994] [2022-04-15 13:04:53,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:53,900 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 13:04:53,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:53,900 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 13:04:53,931 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 13:04:53,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 13:04:53,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:53,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 13:04:53,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-04-15 13:04:53,932 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 13:04:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:57,750 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-04-15 13:04:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 13:04:57,750 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 13:04:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:57,750 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 13:04:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 79 transitions. [2022-04-15 13:04:57,751 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 13:04:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 79 transitions. [2022-04-15 13:04:57,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 79 transitions. [2022-04-15 13:04:57,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 13:04:57,853 INFO L225 Difference]: With dead ends: 105 [2022-04-15 13:04:57,853 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 13:04:57,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=3399, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 13:04:57,854 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:57,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 166 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 13:04:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 13:04:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2022-04-15 13:04:57,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:57,934 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 13:04:57,934 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 13:04:57,934 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 13:04:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:57,934 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-15 13:04:57,934 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-15 13:04:57,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:57,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:57,935 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 13:04:57,935 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 13:04:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:57,935 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-15 13:04:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-15 13:04:57,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:57,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:57,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:57,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:57,936 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 13:04:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-15 13:04:57,936 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 47 [2022-04-15 13:04:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:57,937 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-15 13:04:57,937 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 13:04:57,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-15 13:04:58,176 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 13:04:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 13:04:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 13:04:58,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:58,176 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 13:04:58,177 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 13:04:58,177 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:58,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1211412514, now seen corresponding path program 28 times [2022-04-15 13:04:58,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:58,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237372535] [2022-04-15 13:04:58,522 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:58,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1414406920, now seen corresponding path program 1 times [2022-04-15 13:04:58,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:58,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269720882] [2022-04-15 13:04:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:58,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:58,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {11453#(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); {11447#true} is VALID [2022-04-15 13:04:58,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {11447#true} assume true; {11447#true} is VALID [2022-04-15 13:04:58,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11447#true} {11447#true} #63#return; {11447#true} is VALID [2022-04-15 13:04:58,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {11447#true} call ULTIMATE.init(); {11453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:58,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {11453#(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); {11447#true} is VALID [2022-04-15 13:04:58,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {11447#true} assume true; {11447#true} is VALID [2022-04-15 13:04:58,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11447#true} {11447#true} #63#return; {11447#true} is VALID [2022-04-15 13:04:58,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {11447#true} call #t~ret7 := main(); {11447#true} is VALID [2022-04-15 13:04:58,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {11447#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {11447#true} is VALID [2022-04-15 13:04:58,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {11447#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {11452#(= main_~y~0 0)} is VALID [2022-04-15 13:04:58,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {11452#(= main_~y~0 0)} [129] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_56 28))) (and (< (mod (+ 4294967291 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967279 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_114 4294967277) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_56) 4294967296) 268435455) (< (mod (+ 4294967281 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967276 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_114 4294967280) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_114 4294967296)) (< (mod (+ 4294967295 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967282 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967278 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967274 v_main_~z~0_Out_114) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_114 4) 0)) (< (mod (+ 4294967293 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_114) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_56| 28) 0) (= (* v_main_~y~0_In_28 28) .cse0) (< (mod (+ 4294967292 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967287 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967275 v_main_~z~0_Out_114) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_114) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967285 v_main_~z~0_Out_114) 4294967296) 268435455) (= 28 v_main_~z~0_Out_114) (< (mod (+ 4294967283 v_main_~z~0_Out_114) 4294967296) 268435455))) (= v_main_~y~0_In_28 v_main_~y~0_Out_56)) InVars {main_~y~0=v_main_~y~0_In_28} OutVars{main_#t~post4=|v_main_#t~post4_Out_114|, main_#t~post5=|v_main_#t~post5_Out_56|, main_~y~0=v_main_~y~0_Out_56, main_~z~0=v_main_~z~0_Out_114} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {11452#(= main_~y~0 0)} is VALID [2022-04-15 13:04:58,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {11452#(= 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[] {11448#false} is VALID [2022-04-15 13:04:58,593 INFO L272 TraceCheckUtils]: 9: Hoare triple {11448#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)); {11448#false} is VALID [2022-04-15 13:04:58,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {11448#false} ~cond := #in~cond; {11448#false} is VALID [2022-04-15 13:04:58,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {11448#false} assume 0 == ~cond; {11448#false} is VALID [2022-04-15 13:04:58,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {11448#false} assume !false; {11448#false} is VALID [2022-04-15 13:04:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:58,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:58,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269720882] [2022-04-15 13:04:58,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269720882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:58,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:58,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:59,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:59,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [237372535] [2022-04-15 13:04:59,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [237372535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:59,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:59,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 13:04:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972195077] [2022-04-15 13:04:59,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:59,169 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 13:04:59,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:59,169 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 13:04:59,202 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 13:04:59,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 13:04:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:59,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 13:04:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 13:04:59,203 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 13:05:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:02,906 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-04-15 13:05:02,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 13:05:02,906 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 13:05:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:02,907 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 13:05:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-15 13:05:02,907 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 13:05:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-15 13:05:02,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 80 transitions. [2022-04-15 13:05:03,010 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 13:05:03,011 INFO L225 Difference]: With dead ends: 107 [2022-04-15 13:05:03,011 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 13:05:03,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=270, Invalid=3636, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 13:05:03,012 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:03,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 66 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 13:05:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 13:05:03,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2022-04-15 13:05:03,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:03,086 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 13:05:03,086 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 13:05:03,086 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 13:05:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:03,087 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-15 13:05:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-04-15 13:05:03,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:03,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:03,087 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 13:05:03,087 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 13:05:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:03,088 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-15 13:05:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-04-15 13:05:03,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:03,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:03,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:03,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:03,088 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 13:05:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-04-15 13:05:03,088 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 48 [2022-04-15 13:05:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:03,089 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-04-15 13:05:03,089 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 13:05:03,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2022-04-15 13:05:03,266 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 13:05:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-15 13:05:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 13:05:03,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:03,267 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 13:05:03,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 13:05:03,267 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:03,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:03,268 INFO L85 PathProgramCache]: Analyzing trace with hash -148635134, now seen corresponding path program 29 times [2022-04-15 13:05:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:03,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1890538140] [2022-04-15 13:05:03,657 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1355301576, now seen corresponding path program 1 times [2022-04-15 13:05:03,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:03,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822764888] [2022-04-15 13:05:03,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:03,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:03,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {11996#(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); {11990#true} is VALID [2022-04-15 13:05:03,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {11990#true} assume true; {11990#true} is VALID [2022-04-15 13:05:03,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11990#true} {11990#true} #63#return; {11990#true} is VALID [2022-04-15 13:05:03,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {11990#true} call ULTIMATE.init(); {11996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:03,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {11996#(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); {11990#true} is VALID [2022-04-15 13:05:03,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {11990#true} assume true; {11990#true} is VALID [2022-04-15 13:05:03,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11990#true} {11990#true} #63#return; {11990#true} is VALID [2022-04-15 13:05:03,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {11990#true} call #t~ret7 := main(); {11990#true} is VALID [2022-04-15 13:05:03,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {11990#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {11990#true} is VALID [2022-04-15 13:05:03,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {11990#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {11995#(= main_~y~0 0)} is VALID [2022-04-15 13:05:03,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {11995#(= main_~y~0 0)} [131] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_29 v_main_~y~0_Out_58) (let ((.cse0 (* 29 v_main_~y~0_Out_58))) (and (< (mod (+ 4294967274 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967282 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_118 4294967280) 4294967296) 268435455) (= .cse0 (* 29 v_main_~y~0_In_29)) (< (mod (+ 4294967291 v_main_~z~0_Out_118) 4294967296) 268435455) (= 29 v_main_~z~0_Out_118) (< (mod (+ v_main_~z~0_Out_118 4294967277) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_118 4) 0)) (< (mod (+ 4294967286 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_58) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967281 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967273 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967278 v_main_~z~0_Out_118) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_58| 29) 0) (< (mod (+ 4294967283 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967275 v_main_~z~0_Out_118) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967279 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_118) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_118 4294967296)) (< (mod (+ 4294967285 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967276 v_main_~z~0_Out_118) 4294967296) 268435455) (< (mod (+ 4294967287 v_main_~z~0_Out_118) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_29} OutVars{main_#t~post4=|v_main_#t~post4_Out_118|, main_#t~post5=|v_main_#t~post5_Out_58|, main_~y~0=v_main_~y~0_Out_58, main_~z~0=v_main_~z~0_Out_118} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {11995#(= main_~y~0 0)} is VALID [2022-04-15 13:05:03,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {11995#(= 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[] {11991#false} is VALID [2022-04-15 13:05:03,703 INFO L272 TraceCheckUtils]: 9: Hoare triple {11991#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)); {11991#false} is VALID [2022-04-15 13:05:03,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {11991#false} ~cond := #in~cond; {11991#false} is VALID [2022-04-15 13:05:03,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {11991#false} assume 0 == ~cond; {11991#false} is VALID [2022-04-15 13:05:03,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {11991#false} assume !false; {11991#false} is VALID [2022-04-15 13:05:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:03,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822764888] [2022-04-15 13:05:03,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822764888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:03,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:03,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:05:04,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:04,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1890538140] [2022-04-15 13:05:04,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1890538140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:04,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:04,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 13:05:04,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783052456] [2022-04-15 13:05:04,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:04,270 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 13:05:04,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:04,270 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 13:05:04,301 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 13:05:04,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 13:05:04,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:04,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 13:05:04,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 13:05:04,302 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 13:05:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:08,391 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-04-15 13:05:08,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 13:05:08,392 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 13:05:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:08,392 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 13:05:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-15 13:05:08,392 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 13:05:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-15 13:05:08,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 81 transitions. [2022-04-15 13:05:08,487 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 13:05:08,488 INFO L225 Difference]: With dead ends: 109 [2022-04-15 13:05:08,488 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 13:05:08,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=279, Invalid=3881, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 13:05:08,489 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:08,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 116 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 13:05:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 13:05:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-04-15 13:05:08,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:08,582 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 13:05:08,582 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 13:05:08,582 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 13:05:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:08,583 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-15 13:05:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-15 13:05:08,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:08,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:08,583 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 13:05:08,583 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 13:05:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:08,584 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-15 13:05:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-15 13:05:08,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:08,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:08,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:08,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:08,584 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 13:05:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-15 13:05:08,585 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 49 [2022-04-15 13:05:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:08,585 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-15 13:05:08,585 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 13:05:08,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 59 transitions. [2022-04-15 13:05:08,828 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 13:05:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-15 13:05:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 13:05:08,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:08,829 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 13:05:08,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 13:05:08,829 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:08,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:08,829 INFO L85 PathProgramCache]: Analyzing trace with hash 639560738, now seen corresponding path program 30 times [2022-04-15 13:05:08,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:08,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [5548151] [2022-04-15 13:05:09,211 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:09,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1296196232, now seen corresponding path program 1 times [2022-04-15 13:05:09,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:09,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327796498] [2022-04-15 13:05:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:09,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:09,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {12550#(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); {12544#true} is VALID [2022-04-15 13:05:09,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {12544#true} assume true; {12544#true} is VALID [2022-04-15 13:05:09,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12544#true} {12544#true} #63#return; {12544#true} is VALID [2022-04-15 13:05:09,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {12544#true} call ULTIMATE.init(); {12550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:09,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {12550#(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); {12544#true} is VALID [2022-04-15 13:05:09,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {12544#true} assume true; {12544#true} is VALID [2022-04-15 13:05:09,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12544#true} {12544#true} #63#return; {12544#true} is VALID [2022-04-15 13:05:09,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {12544#true} call #t~ret7 := main(); {12544#true} is VALID [2022-04-15 13:05:09,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {12544#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {12544#true} is VALID [2022-04-15 13:05:09,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {12544#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {12549#(= main_~y~0 0)} is VALID [2022-04-15 13:05:09,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {12549#(= main_~y~0 0)} [133] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (let ((.cse0 (* 30 v_main_~y~0_Out_60))) (and (< (mod (+ 4294967287 v_main_~z~0_Out_122) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_122 4) 0)) (< (mod (+ 4294967292 v_main_~z~0_Out_122) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_122) 4294967296) 268435455) (< (mod (+ 4294967285 v_main_~z~0_Out_122) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_122) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_122) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_122 4294967296)) (< (mod (+ 4294967295 v_main_~z~0_Out_122) 4294967296) 268435455) (< (mod (+ 4294967283 v_main_~z~0_Out_122) 4294967296) 268435455) (< (mod (+ 4294967282 v_main_~z~0_Out_122) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967291 v_main_~z~0_Out_122) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_60) 4294967296) 268435455) (= (* 30 v_main_~y~0_In_30) .cse0) (< (mod (+ 4294967293 v_main_~z~0_Out_122) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_122) 4294967296) 268435455) (= 30 v_main_~z~0_Out_122) (< (mod (+ 4294967290 v_main_~z~0_Out_122) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_122) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_60| 30) 0)))) InVars {main_~y~0=v_main_~y~0_In_30} OutVars{main_#t~post4=|v_main_#t~post4_Out_122|, main_#t~post5=|v_main_#t~post5_Out_60|, main_~y~0=v_main_~y~0_Out_60, main_~z~0=v_main_~z~0_Out_122} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {12549#(= main_~y~0 0)} is VALID [2022-04-15 13:05:09,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {12549#(= 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[] {12545#false} is VALID [2022-04-15 13:05:09,277 INFO L272 TraceCheckUtils]: 9: Hoare triple {12545#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)); {12545#false} is VALID [2022-04-15 13:05:09,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {12545#false} ~cond := #in~cond; {12545#false} is VALID [2022-04-15 13:05:09,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {12545#false} assume 0 == ~cond; {12545#false} is VALID [2022-04-15 13:05:09,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {12545#false} assume !false; {12545#false} is VALID [2022-04-15 13:05:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:09,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:09,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327796498] [2022-04-15 13:05:09,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327796498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:09,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:09,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:05:09,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:09,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [5548151] [2022-04-15 13:05:09,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [5548151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:09,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:09,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 13:05:09,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600780828] [2022-04-15 13:05:09,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:09,688 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 13:05:09,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:09,688 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 13:05:09,724 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 13:05:09,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 13:05:09,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 13:05:09,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 13:05:09,726 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 13:05:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:13,888 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-04-15 13:05:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 13:05:13,889 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 13:05:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:13,889 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 13:05:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 82 transitions. [2022-04-15 13:05:13,889 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 13:05:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 82 transitions. [2022-04-15 13:05:13,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 82 transitions. [2022-04-15 13:05:13,998 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 13:05:13,999 INFO L225 Difference]: With dead ends: 111 [2022-04-15 13:05:13,999 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 13:05:14,000 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=288, Invalid=4134, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 13:05:14,000 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:14,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 13:05:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 13:05:14,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2022-04-15 13:05:14,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:14,100 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 13:05:14,100 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 13:05:14,100 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 13:05:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:14,101 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-04-15 13:05:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-04-15 13:05:14,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:14,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:14,101 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 13:05:14,101 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 13:05:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:14,102 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-04-15 13:05:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-04-15 13:05:14,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:14,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:14,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:14,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:14,104 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 13:05:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-04-15 13:05:14,105 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 50 [2022-04-15 13:05:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:14,105 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-04-15 13:05:14,105 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 13:05:14,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2022-04-15 13:05:14,310 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 13:05:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-04-15 13:05:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 13:05:14,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:14,311 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 13:05:14,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 13:05:14,311 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:14,311 INFO L85 PathProgramCache]: Analyzing trace with hash -696171006, now seen corresponding path program 31 times [2022-04-15 13:05:14,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:14,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714648704] [2022-04-15 13:05:14,638 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:14,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1237090888, now seen corresponding path program 1 times [2022-04-15 13:05:14,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:14,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792262313] [2022-04-15 13:05:14,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:14,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:14,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:14,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {13115#(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); {13109#true} is VALID [2022-04-15 13:05:14,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {13109#true} assume true; {13109#true} is VALID [2022-04-15 13:05:14,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13109#true} {13109#true} #63#return; {13109#true} is VALID [2022-04-15 13:05:14,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {13109#true} call ULTIMATE.init(); {13115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:14,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {13115#(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); {13109#true} is VALID [2022-04-15 13:05:14,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {13109#true} assume true; {13109#true} is VALID [2022-04-15 13:05:14,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13109#true} {13109#true} #63#return; {13109#true} is VALID [2022-04-15 13:05:14,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {13109#true} call #t~ret7 := main(); {13109#true} is VALID [2022-04-15 13:05:14,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {13109#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {13109#true} is VALID [2022-04-15 13:05:14,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {13109#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {13114#(= main_~y~0 0)} is VALID [2022-04-15 13:05:14,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {13114#(= main_~y~0 0)} [135] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_62 31))) (and (= (* |v_main_#t~post5_Out_62| 31) 0) (not (= (mod v_main_~z~0_Out_126 4) 0)) (< (mod (+ 4294967293 v_main_~z~0_Out_126) 4294967296) 268435455) (= 31 v_main_~z~0_Out_126) (= .cse0 0) (< (mod (+ 4294967295 v_main_~y~0_Out_62) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_126) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_126) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_126 4294967296)) (= .cse0 (* 31 v_main_~y~0_In_31)) (< (mod (+ 4294967295 v_main_~z~0_Out_126) 4294967296) 268435455))) (= v_main_~y~0_In_31 v_main_~y~0_Out_62)) InVars {main_~y~0=v_main_~y~0_In_31} OutVars{main_#t~post4=|v_main_#t~post4_Out_126|, main_#t~post5=|v_main_#t~post5_Out_62|, main_~y~0=v_main_~y~0_Out_62, main_~z~0=v_main_~z~0_Out_126} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {13114#(= main_~y~0 0)} is VALID [2022-04-15 13:05:14,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {13114#(= 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[] {13110#false} is VALID [2022-04-15 13:05:14,687 INFO L272 TraceCheckUtils]: 9: Hoare triple {13110#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)); {13110#false} is VALID [2022-04-15 13:05:14,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {13110#false} ~cond := #in~cond; {13110#false} is VALID [2022-04-15 13:05:14,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {13110#false} assume 0 == ~cond; {13110#false} is VALID [2022-04-15 13:05:14,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {13110#false} assume !false; {13110#false} is VALID [2022-04-15 13:05:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:14,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:14,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792262313] [2022-04-15 13:05:14,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792262313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:14,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:14,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:05:15,300 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:15,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714648704] [2022-04-15 13:05:15,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714648704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:15,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:15,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 13:05:15,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121606140] [2022-04-15 13:05:15,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:15,301 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 13:05:15,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:15,302 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 13:05:15,353 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 13:05:15,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 13:05:15,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:15,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 13:05:15,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 13:05:15,354 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 13:05:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:20,343 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-04-15 13:05:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 13:05:20,343 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 13:05:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:20,344 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 13:05:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 83 transitions. [2022-04-15 13:05:20,344 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 13:05:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 83 transitions. [2022-04-15 13:05:20,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 83 transitions. [2022-04-15 13:05:20,435 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 13:05:20,436 INFO L225 Difference]: With dead ends: 113 [2022-04-15 13:05:20,436 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 13:05:20,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=297, Invalid=4395, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 13:05:20,437 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:20,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 96 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 13:05:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 13:05:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2022-04-15 13:05:20,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:20,519 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 13:05:20,519 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 13:05:20,519 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 13:05:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:20,520 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-04-15 13:05:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-04-15 13:05:20,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:20,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:20,521 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 13:05:20,521 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 13:05:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:20,522 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-04-15 13:05:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-04-15 13:05:20,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:20,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:20,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:20,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:20,522 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 13:05:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-04-15 13:05:20,523 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 51 [2022-04-15 13:05:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:20,523 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-04-15 13:05:20,523 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 13:05:20,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 61 transitions. [2022-04-15 13:05:20,732 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 13:05:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-15 13:05:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 13:05:20,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:20,739 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 13:05:20,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 13:05:20,740 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash 845817890, now seen corresponding path program 32 times [2022-04-15 13:05:20,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:20,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197273090] [2022-04-15 13:05:21,141 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:21,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1177985544, now seen corresponding path program 1 times [2022-04-15 13:05:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:21,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379311242] [2022-04-15 13:05:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:21,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:21,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:21,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {13691#(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); {13685#true} is VALID [2022-04-15 13:05:21,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {13685#true} assume true; {13685#true} is VALID [2022-04-15 13:05:21,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13685#true} {13685#true} #63#return; {13685#true} is VALID [2022-04-15 13:05:21,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {13685#true} call ULTIMATE.init(); {13691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:21,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {13691#(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); {13685#true} is VALID [2022-04-15 13:05:21,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {13685#true} assume true; {13685#true} is VALID [2022-04-15 13:05:21,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13685#true} {13685#true} #63#return; {13685#true} is VALID [2022-04-15 13:05:21,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {13685#true} call #t~ret7 := main(); {13685#true} is VALID [2022-04-15 13:05:21,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {13685#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {13685#true} is VALID [2022-04-15 13:05:21,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {13685#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {13690#(= main_~y~0 0)} is VALID [2022-04-15 13:05:21,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {13690#(= main_~y~0 0)} [137] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* 32 v_main_~y~0_Out_64))) (and (< (mod (+ 4294967291 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967279 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967282 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967285 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_64) 4294967296) 268435455) (< (mod (+ 4294967281 v_main_~z~0_Out_130) 4294967296) 268435455) (= 0 .cse0) (not (= (mod v_main_~z~0_Out_130 4) 0)) (= (* |v_main_#t~post5_Out_64| 32) 0) (< (mod (+ 4294967287 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_130) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_130 4294967296)) (< (mod (+ v_main_~z~0_Out_130 4294967280) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_130) 4294967296) 268435455) (< (mod (+ 4294967283 v_main_~z~0_Out_130) 4294967296) 268435455) (= (* 32 v_main_~y~0_In_32) .cse0) (< (mod (+ 4294967294 v_main_~z~0_Out_130) 4294967296) 268435455) (= 32 v_main_~z~0_Out_130))) (= v_main_~y~0_In_32 v_main_~y~0_Out_64)) InVars {main_~y~0=v_main_~y~0_In_32} OutVars{main_#t~post4=|v_main_#t~post4_Out_130|, main_#t~post5=|v_main_#t~post5_Out_64|, main_~y~0=v_main_~y~0_Out_64, main_~z~0=v_main_~z~0_Out_130} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {13690#(= main_~y~0 0)} is VALID [2022-04-15 13:05:21,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {13690#(= 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[] {13686#false} is VALID [2022-04-15 13:05:21,213 INFO L272 TraceCheckUtils]: 9: Hoare triple {13686#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)); {13686#false} is VALID [2022-04-15 13:05:21,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {13686#false} ~cond := #in~cond; {13686#false} is VALID [2022-04-15 13:05:21,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {13686#false} assume 0 == ~cond; {13686#false} is VALID [2022-04-15 13:05:21,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {13686#false} assume !false; {13686#false} is VALID [2022-04-15 13:05:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:21,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:21,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379311242] [2022-04-15 13:05:21,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379311242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:21,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:21,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:05:21,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:21,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197273090] [2022-04-15 13:05:21,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197273090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:21,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:21,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 13:05:21,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471305775] [2022-04-15 13:05:21,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:21,687 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 13:05:21,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:21,687 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 13:05:21,727 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 13:05:21,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 13:05:21,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:21,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 13:05:21,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 13:05:21,729 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 13:05:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:28,062 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-04-15 13:05:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 13:05:28,062 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 13:05:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:28,062 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 13:05:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 84 transitions. [2022-04-15 13:05:28,063 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 13:05:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 84 transitions. [2022-04-15 13:05:28,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 84 transitions. [2022-04-15 13:05:28,197 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 13:05:28,198 INFO L225 Difference]: With dead ends: 115 [2022-04-15 13:05:28,198 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 13:05:28,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=4664, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 13:05:28,199 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:28,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 176 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 13:05:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 13:05:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2022-04-15 13:05:28,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:28,282 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 13:05:28,282 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 13:05:28,282 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 13:05:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:28,283 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-04-15 13:05:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-04-15 13:05:28,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:28,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:28,285 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 13:05:28,285 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 13:05:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:28,285 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-04-15 13:05:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-04-15 13:05:28,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:28,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:28,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:28,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:28,286 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 13:05:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-04-15 13:05:28,286 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 52 [2022-04-15 13:05:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:28,286 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-04-15 13:05:28,286 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 13:05:28,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2022-04-15 13:05:28,597 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 13:05:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-04-15 13:05:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 13:05:28,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:28,598 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 13:05:28,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 13:05:28,598 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:28,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1402833410, now seen corresponding path program 33 times [2022-04-15 13:05:28,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:28,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1047380853] [2022-04-15 13:05:28,900 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1118880200, now seen corresponding path program 1 times [2022-04-15 13:05:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:28,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075267934] [2022-04-15 13:05:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:28,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:28,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {14278#(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); {14272#true} is VALID [2022-04-15 13:05:28,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {14272#true} assume true; {14272#true} is VALID [2022-04-15 13:05:28,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14272#true} {14272#true} #63#return; {14272#true} is VALID [2022-04-15 13:05:28,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {14272#true} call ULTIMATE.init(); {14278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:28,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {14278#(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); {14272#true} is VALID [2022-04-15 13:05:28,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {14272#true} assume true; {14272#true} is VALID [2022-04-15 13:05:28,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14272#true} {14272#true} #63#return; {14272#true} is VALID [2022-04-15 13:05:28,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {14272#true} call #t~ret7 := main(); {14272#true} is VALID [2022-04-15 13:05:28,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {14272#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {14272#true} is VALID [2022-04-15 13:05:28,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {14272#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {14277#(= main_~y~0 0)} is VALID [2022-04-15 13:05:28,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {14277#(= main_~y~0 0)} [139] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_33 v_main_~y~0_Out_66) (let ((.cse0 (* v_main_~y~0_Out_66 33))) (and (<= 268435455 (mod v_main_~z~0_Out_134 4294967296)) (= 33 v_main_~z~0_Out_134) (< (mod (+ 4294967295 v_main_~z~0_Out_134) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_134) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_134 4) 0)) (< (mod (+ 4294967293 v_main_~z~0_Out_134) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_66) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_66| 33) 0) (= .cse0 (* 33 v_main_~y~0_In_33)) (< (mod (+ 4294967292 v_main_~z~0_Out_134) 4294967296) 268435455) (= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_In_33} OutVars{main_#t~post4=|v_main_#t~post4_Out_134|, main_#t~post5=|v_main_#t~post5_Out_66|, main_~y~0=v_main_~y~0_Out_66, main_~z~0=v_main_~z~0_Out_134} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {14277#(= main_~y~0 0)} is VALID [2022-04-15 13:05:28,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {14277#(= 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[] {14273#false} is VALID [2022-04-15 13:05:28,951 INFO L272 TraceCheckUtils]: 9: Hoare triple {14273#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)); {14273#false} is VALID [2022-04-15 13:05:28,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {14273#false} ~cond := #in~cond; {14273#false} is VALID [2022-04-15 13:05:28,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {14273#false} assume 0 == ~cond; {14273#false} is VALID [2022-04-15 13:05:28,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {14273#false} assume !false; {14273#false} is VALID [2022-04-15 13:05:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:28,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:28,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075267934] [2022-04-15 13:05:28,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075267934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:28,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:28,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:05:29,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:29,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1047380853] [2022-04-15 13:05:29,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1047380853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:29,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:29,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 13:05:29,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148906251] [2022-04-15 13:05:29,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:29,478 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 13:05:29,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:29,478 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 13:05:29,532 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 13:05:29,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 13:05:29,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:29,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 13:05:29,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 13:05:29,533 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 13:05:36,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:36,344 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-04-15 13:05:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 13:05:36,344 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 13:05:36,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:36,344 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 13:05:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 85 transitions. [2022-04-15 13:05:36,345 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 13:05:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 85 transitions. [2022-04-15 13:05:36,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 85 transitions. [2022-04-15 13:05:36,464 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 13:05:36,464 INFO L225 Difference]: With dead ends: 117 [2022-04-15 13:05:36,465 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 13:05:36,465 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=4941, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 13:05:36,465 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:36,465 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 166 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 13:05:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 13:05:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-04-15 13:05:36,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:36,553 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 13:05:36,553 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 13:05:36,554 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 13:05:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:36,554 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-04-15 13:05:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-15 13:05:36,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:36,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:36,555 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 13:05:36,555 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 13:05:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:36,556 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-04-15 13:05:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-15 13:05:36,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:36,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:36,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:36,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:36,556 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 13:05:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-15 13:05:36,557 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 53 [2022-04-15 13:05:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:36,557 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-15 13:05:36,557 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 13:05:36,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 63 transitions. [2022-04-15 13:05:37,151 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 13:05:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-15 13:05:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 13:05:37,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:37,151 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 13:05:37,152 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 13:05:37,152 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:37,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:37,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1490445346, now seen corresponding path program 34 times [2022-04-15 13:05:37,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:37,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1988903198] [2022-04-15 13:05:37,645 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1059774856, now seen corresponding path program 1 times [2022-04-15 13:05:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:37,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164557387] [2022-04-15 13:05:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:37,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:37,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:37,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {14876#(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); {14870#true} is VALID [2022-04-15 13:05:37,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {14870#true} assume true; {14870#true} is VALID [2022-04-15 13:05:37,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14870#true} {14870#true} #63#return; {14870#true} is VALID [2022-04-15 13:05:37,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {14870#true} call ULTIMATE.init(); {14876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:37,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {14876#(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); {14870#true} is VALID [2022-04-15 13:05:37,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {14870#true} assume true; {14870#true} is VALID [2022-04-15 13:05:37,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14870#true} {14870#true} #63#return; {14870#true} is VALID [2022-04-15 13:05:37,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {14870#true} call #t~ret7 := main(); {14870#true} is VALID [2022-04-15 13:05:37,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {14870#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {14870#true} is VALID [2022-04-15 13:05:37,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {14870#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {14875#(= main_~y~0 0)} is VALID [2022-04-15 13:05:37,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {14875#(= main_~y~0 0)} [141] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_34 v_main_~y~0_Out_68) (let ((.cse0 (* v_main_~y~0_Out_68 34))) (and (< (mod (+ 4294967291 v_main_~z~0_Out_138) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_138 4294967296)) (= .cse0 0) (= (* |v_main_#t~post5_Out_68| 34) 0) (< (mod (+ 4294967295 v_main_~y~0_Out_68) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_138) 4294967296) 268435455) (= 34 v_main_~z~0_Out_138) (not (= (mod v_main_~z~0_Out_138 4) 0)) (< (mod (+ 4294967292 v_main_~z~0_Out_138) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_138) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_138) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_138) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_138) 4294967296) 268435455) (= (* 34 v_main_~y~0_In_34) .cse0)))) InVars {main_~y~0=v_main_~y~0_In_34} OutVars{main_#t~post4=|v_main_#t~post4_Out_138|, main_#t~post5=|v_main_#t~post5_Out_68|, main_~y~0=v_main_~y~0_Out_68, main_~z~0=v_main_~z~0_Out_138} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {14875#(= main_~y~0 0)} is VALID [2022-04-15 13:05:37,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {14875#(= 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[] {14871#false} is VALID [2022-04-15 13:05:37,692 INFO L272 TraceCheckUtils]: 9: Hoare triple {14871#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)); {14871#false} is VALID [2022-04-15 13:05:37,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {14871#false} ~cond := #in~cond; {14871#false} is VALID [2022-04-15 13:05:37,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {14871#false} assume 0 == ~cond; {14871#false} is VALID [2022-04-15 13:05:37,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {14871#false} assume !false; {14871#false} is VALID [2022-04-15 13:05:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:37,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:37,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164557387] [2022-04-15 13:05:37,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164557387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:37,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:37,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:05:38,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:38,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1988903198] [2022-04-15 13:05:38,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1988903198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:38,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:38,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 13:05:38,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13106011] [2022-04-15 13:05:38,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:38,442 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 13:05:38,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:38,442 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 13:05:38,550 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 13:05:38,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 13:05:38,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:38,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 13:05:38,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 13:05:38,551 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 13:06:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:01,741 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-04-15 13:06:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 13:06:01,741 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 13:06:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:01,741 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 13:06:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 86 transitions. [2022-04-15 13:06:01,742 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 13:06:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 86 transitions. [2022-04-15 13:06:01,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 86 transitions. [2022-04-15 13:06:02,175 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 13:06:02,176 INFO L225 Difference]: With dead ends: 119 [2022-04-15 13:06:02,176 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 13:06:02,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 17 SyntacticMatches, 2 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 13:06:02,177 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:02,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2022-04-15 13:06:02,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 13:06:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2022-04-15 13:06:02,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:02,284 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 13:06:02,284 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 13:06:02,284 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 13:06:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:02,285 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-04-15 13:06:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-04-15 13:06:02,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:02,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:02,285 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 13:06:02,285 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 13:06:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:02,286 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-04-15 13:06:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-04-15 13:06:02,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:02,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:02,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:02,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:02,286 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 13:06:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-04-15 13:06:02,287 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 54 [2022-04-15 13:06:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:02,289 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-04-15 13:06:02,289 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 13:06:02,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 64 transitions. [2022-04-15 13:06:02,722 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 13:06:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-04-15 13:06:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 13:06:02,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:02,722 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 13:06:02,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-15 13:06:02,723 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:02,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:02,723 INFO L85 PathProgramCache]: Analyzing trace with hash -88551934, now seen corresponding path program 35 times [2022-04-15 13:06:02,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:02,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [236413171] [2022-04-15 13:06:03,133 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1000669512, now seen corresponding path program 1 times [2022-04-15 13:06:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:03,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382860691] [2022-04-15 13:06:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:03,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:03,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:03,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {15485#(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); {15479#true} is VALID [2022-04-15 13:06:03,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {15479#true} assume true; {15479#true} is VALID [2022-04-15 13:06:03,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15479#true} {15479#true} #63#return; {15479#true} is VALID [2022-04-15 13:06:03,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {15479#true} call ULTIMATE.init(); {15485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:03,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {15485#(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); {15479#true} is VALID [2022-04-15 13:06:03,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {15479#true} assume true; {15479#true} is VALID [2022-04-15 13:06:03,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15479#true} {15479#true} #63#return; {15479#true} is VALID [2022-04-15 13:06:03,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {15479#true} call #t~ret7 := main(); {15479#true} is VALID [2022-04-15 13:06:03,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {15479#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {15479#true} is VALID [2022-04-15 13:06:03,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {15479#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {15484#(= main_~y~0 0)} is VALID [2022-04-15 13:06:03,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {15484#(= main_~y~0 0)} [143] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_35 v_main_~y~0_Out_70) (let ((.cse0 (* 35 v_main_~y~0_Out_70))) (and (= .cse0 0) (= (* 35 v_main_~y~0_In_35) .cse0) (< (mod (+ 4294967295 v_main_~y~0_Out_70) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_142 4) 0)) (< (mod (+ 4294967294 v_main_~z~0_Out_142) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_142) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_142) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_142 4294967296)) (= (* |v_main_#t~post5_Out_70| 35) 0) (< (mod (+ 4294967292 v_main_~z~0_Out_142) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_142) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_142) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_142) 4294967296) 268435455) (= 35 v_main_~z~0_Out_142)))) InVars {main_~y~0=v_main_~y~0_In_35} OutVars{main_#t~post4=|v_main_#t~post4_Out_142|, main_#t~post5=|v_main_#t~post5_Out_70|, main_~y~0=v_main_~y~0_Out_70, main_~z~0=v_main_~z~0_Out_142} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {15484#(= main_~y~0 0)} is VALID [2022-04-15 13:06:03,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {15484#(= 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[] {15480#false} is VALID [2022-04-15 13:06:03,173 INFO L272 TraceCheckUtils]: 9: Hoare triple {15480#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)); {15480#false} is VALID [2022-04-15 13:06:03,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {15480#false} ~cond := #in~cond; {15480#false} is VALID [2022-04-15 13:06:03,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {15480#false} assume 0 == ~cond; {15480#false} is VALID [2022-04-15 13:06:03,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {15480#false} assume !false; {15480#false} is VALID [2022-04-15 13:06:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:03,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382860691] [2022-04-15 13:06:03,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382860691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:03,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:03,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:06:03,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:03,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [236413171] [2022-04-15 13:06:03,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [236413171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:03,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:03,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 13:06:03,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211193476] [2022-04-15 13:06:03,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:03,838 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 13:06:03,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:03,839 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 13:06:03,885 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 13:06:03,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 13:06:03,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:03,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 13:06:03,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 13:06:03,887 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 13:06:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:39,581 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2022-04-15 13:06:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 13:06:39,581 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 13:06:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:39,581 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 13:06:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 87 transitions. [2022-04-15 13:06:39,582 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 13:06:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 87 transitions. [2022-04-15 13:06:39,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 87 transitions. [2022-04-15 13:06:39,705 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 13:06:39,706 INFO L225 Difference]: With dead ends: 121 [2022-04-15 13:06:39,706 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 13:06:39,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=333, Invalid=5519, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 13:06:39,707 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s 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, 22.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:39,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 22.5s Time] [2022-04-15 13:06:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 13:06:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-15 13:06:39,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:39,809 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 13:06:39,809 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 13:06:39,809 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 13:06:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:39,810 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-04-15 13:06:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-04-15 13:06:39,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:39,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:39,810 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 13:06:39,811 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 13:06:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:39,811 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-04-15 13:06:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-04-15 13:06:39,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:39,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:39,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:39,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:39,811 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 13:06:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-15 13:06:39,812 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 55 [2022-04-15 13:06:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:39,812 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-15 13:06:39,812 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 13:06:39,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-15 13:06:40,304 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 13:06:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-15 13:06:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 13:06:40,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:40,304 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 13:06:40,304 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-15 13:06:40,304 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1792827358, now seen corresponding path program 36 times [2022-04-15 13:06:40,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:40,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710239460] [2022-04-15 13:06:40,789 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash -941564168, now seen corresponding path program 1 times [2022-04-15 13:06:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:40,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150746769] [2022-04-15 13:06:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:40,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {16105#(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); {16099#true} is VALID [2022-04-15 13:06:40,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {16099#true} assume true; {16099#true} is VALID [2022-04-15 13:06:40,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16099#true} {16099#true} #63#return; {16099#true} is VALID [2022-04-15 13:06:40,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {16099#true} call ULTIMATE.init(); {16105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:40,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {16105#(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); {16099#true} is VALID [2022-04-15 13:06:40,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {16099#true} assume true; {16099#true} is VALID [2022-04-15 13:06:40,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16099#true} {16099#true} #63#return; {16099#true} is VALID [2022-04-15 13:06:40,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {16099#true} call #t~ret7 := main(); {16099#true} is VALID [2022-04-15 13:06:40,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {16099#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {16099#true} is VALID [2022-04-15 13:06:40,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {16099#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {16104#(= main_~y~0 0)} is VALID [2022-04-15 13:06:40,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {16104#(= main_~y~0 0)} [145] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_36 v_main_~y~0_Out_72) (let ((.cse0 (* v_main_~y~0_Out_72 36))) (and (< (mod (+ 4294967282 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967285 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967274 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_146) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_72| 36) 0) (< (mod (+ 4294967263 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967266 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967264 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967262 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967269 v_main_~z~0_Out_146) 4294967296) 268435455) (= 36 v_main_~z~0_Out_146) (< (mod (+ 4294967287 v_main_~z~0_Out_146) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_146 4294967296)) (not (= (mod v_main_~z~0_Out_146 4) 0)) (< (mod (+ 4294967267 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967268 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967270 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967275 v_main_~z~0_Out_146) 4294967296) 268435455) (= .cse0 (* v_main_~y~0_In_36 36)) (< (mod (+ 4294967290 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967279 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_146 4294967280) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967260 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967273 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_72) 4294967296) 268435455) (< (mod (+ 4294967283 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967276 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967261 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967278 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967265 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967272 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967281 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_146 4294967277) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967271 v_main_~z~0_Out_146) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_146) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_36} OutVars{main_#t~post4=|v_main_#t~post4_Out_146|, main_#t~post5=|v_main_#t~post5_Out_72|, main_~y~0=v_main_~y~0_Out_72, main_~z~0=v_main_~z~0_Out_146} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {16104#(= main_~y~0 0)} is VALID [2022-04-15 13:06:40,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {16104#(= 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[] {16100#false} is VALID [2022-04-15 13:06:40,845 INFO L272 TraceCheckUtils]: 9: Hoare triple {16100#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)); {16100#false} is VALID [2022-04-15 13:06:40,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {16100#false} ~cond := #in~cond; {16100#false} is VALID [2022-04-15 13:06:40,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {16100#false} assume 0 == ~cond; {16100#false} is VALID [2022-04-15 13:06:40,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {16100#false} assume !false; {16100#false} is VALID [2022-04-15 13:06:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:40,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:40,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150746769] [2022-04-15 13:06:40,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150746769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:40,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:40,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:06:41,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:41,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710239460] [2022-04-15 13:06:41,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710239460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:41,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:41,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 13:06:41,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269738937] [2022-04-15 13:06:41,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:41,717 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 13:06:41,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:41,717 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 13:06:41,904 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 13:06:41,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 13:06:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:41,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 13:06:41,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 13:06:41,905 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 13:07:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:14,304 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2022-04-15 13:07:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 13:07:14,304 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 13:07:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:14,305 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 13:07:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 88 transitions. [2022-04-15 13:07:14,306 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 13:07:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 88 transitions. [2022-04-15 13:07:14,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 88 transitions. [2022-04-15 13:07:14,800 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 13:07:14,801 INFO L225 Difference]: With dead ends: 123 [2022-04-15 13:07:14,801 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 13:07:14,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 17 SyntacticMatches, 2 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 13:07:14,802 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s 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, 19.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:14,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 186 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 19.9s Time] [2022-04-15 13:07:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 13:07:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2022-04-15 13:07:14,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:14,913 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 13:07:14,913 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 13:07:14,913 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 13:07:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:14,915 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-04-15 13:07:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-04-15 13:07:14,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:14,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:14,915 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 13:07:14,915 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 13:07:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:14,916 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-04-15 13:07:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-04-15 13:07:14,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:14,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:14,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:14,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:14,916 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 13:07:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-04-15 13:07:14,917 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 56 [2022-04-15 13:07:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:14,917 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-04-15 13:07:14,917 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 13:07:14,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 66 transitions. [2022-04-15 13:07:15,569 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 13:07:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-04-15 13:07:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 13:07:15,570 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:15,570 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 13:07:15,570 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-15 13:07:15,570 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1209209346, now seen corresponding path program 37 times [2022-04-15 13:07:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:15,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085635466] [2022-04-15 13:07:16,146 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash -882458824, now seen corresponding path program 1 times [2022-04-15 13:07:16,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:16,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433190980] [2022-04-15 13:07:16,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:16,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:07:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:16,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {16736#(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); {16730#true} is VALID [2022-04-15 13:07:16,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {16730#true} assume true; {16730#true} is VALID [2022-04-15 13:07:16,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16730#true} {16730#true} #63#return; {16730#true} is VALID [2022-04-15 13:07:16,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {16730#true} call ULTIMATE.init(); {16736#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:07:16,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {16736#(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); {16730#true} is VALID [2022-04-15 13:07:16,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {16730#true} assume true; {16730#true} is VALID [2022-04-15 13:07:16,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16730#true} {16730#true} #63#return; {16730#true} is VALID [2022-04-15 13:07:16,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {16730#true} call #t~ret7 := main(); {16730#true} is VALID [2022-04-15 13:07:16,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {16730#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {16730#true} is VALID [2022-04-15 13:07:16,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {16730#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {16735#(= main_~y~0 0)} is VALID [2022-04-15 13:07:16,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {16735#(= main_~y~0 0)} [147] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_37 v_main_~y~0_Out_74) (let ((.cse0 (* v_main_~y~0_Out_74 37))) (and (< (mod (+ 4294967287 v_main_~z~0_Out_150) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_150) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_150) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_150) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_150) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_150) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_150) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_150 4) 0)) (< (mod (+ 4294967294 v_main_~z~0_Out_150) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_150) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_74| 37) 0) (= 37 v_main_~z~0_Out_150) (< (mod (+ 4294967295 v_main_~y~0_Out_74) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_150 4294967296)) (< (mod (+ 4294967285 v_main_~z~0_Out_150) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_150) 4294967296) 268435455) (= .cse0 (* v_main_~y~0_In_37 37)) (= .cse0 0) (< (mod (+ 4294967292 v_main_~z~0_Out_150) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_37} OutVars{main_#t~post4=|v_main_#t~post4_Out_150|, main_#t~post5=|v_main_#t~post5_Out_74|, main_~y~0=v_main_~y~0_Out_74, main_~z~0=v_main_~z~0_Out_150} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {16735#(= main_~y~0 0)} is VALID [2022-04-15 13:07:16,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {16735#(= 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[] {16731#false} is VALID [2022-04-15 13:07:16,196 INFO L272 TraceCheckUtils]: 9: Hoare triple {16731#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)); {16731#false} is VALID [2022-04-15 13:07:16,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {16731#false} ~cond := #in~cond; {16731#false} is VALID [2022-04-15 13:07:16,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {16731#false} assume 0 == ~cond; {16731#false} is VALID [2022-04-15 13:07:16,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {16731#false} assume !false; {16731#false} is VALID [2022-04-15 13:07:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:16,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433190980] [2022-04-15 13:07:16,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433190980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:16,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:16,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:07:16,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:16,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085635466] [2022-04-15 13:07:16,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085635466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:16,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:16,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 13:07:16,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849557973] [2022-04-15 13:07:16,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:16,903 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 13:07:16,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:16,903 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 13:07:16,963 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 13:07:16,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 13:07:16,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:16,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 13:07:16,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 13:07:16,964 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 13:07:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:38,696 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-04-15 13:07:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 13:07:38,696 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 13:07:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:38,697 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 13:07:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 89 transitions. [2022-04-15 13:07:38,697 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 13:07:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 89 transitions. [2022-04-15 13:07:38,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 89 transitions. [2022-04-15 13:07:38,906 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 13:07:38,907 INFO L225 Difference]: With dead ends: 125 [2022-04-15 13:07:38,907 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 13:07:38,908 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=6129, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 13:07:38,908 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:38,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 116 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2022-04-15 13:07:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 13:07:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-04-15 13:07:39,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:39,018 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 13:07:39,018 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 13:07:39,018 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 13:07:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:39,019 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-04-15 13:07:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-04-15 13:07:39,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:39,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:39,019 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 13:07:39,019 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 13:07:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:39,020 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-04-15 13:07:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-04-15 13:07:39,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:39,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:39,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:39,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:39,020 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 13:07:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2022-04-15 13:07:39,021 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 57 [2022-04-15 13:07:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:39,021 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-04-15 13:07:39,021 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 13:07:39,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 67 transitions. [2022-04-15 13:07:39,391 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 13:07:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-15 13:07:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 13:07:39,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:39,392 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 13:07:39,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-15 13:07:39,392 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:39,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash -216933342, now seen corresponding path program 38 times [2022-04-15 13:07:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:39,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [706580365] [2022-04-15 13:07:39,885 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash -823353480, now seen corresponding path program 1 times [2022-04-15 13:07:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:39,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694988235] [2022-04-15 13:07:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:39,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:07:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:39,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {17378#(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); {17372#true} is VALID [2022-04-15 13:07:39,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {17372#true} assume true; {17372#true} is VALID [2022-04-15 13:07:39,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17372#true} {17372#true} #63#return; {17372#true} is VALID [2022-04-15 13:07:39,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {17372#true} call ULTIMATE.init(); {17378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:07:39,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {17378#(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); {17372#true} is VALID [2022-04-15 13:07:39,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {17372#true} assume true; {17372#true} is VALID [2022-04-15 13:07:39,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17372#true} {17372#true} #63#return; {17372#true} is VALID [2022-04-15 13:07:39,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {17372#true} call #t~ret7 := main(); {17372#true} is VALID [2022-04-15 13:07:39,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {17372#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {17372#true} is VALID [2022-04-15 13:07:39,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {17372#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {17377#(= main_~y~0 0)} is VALID [2022-04-15 13:07:39,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {17377#(= main_~y~0 0)} [149] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_76 38))) (and (< (mod (+ 4294967295 v_main_~z~0_Out_154) 4294967296) 268435455) (= .cse0 (* v_main_~y~0_In_38 38)) (= 38 v_main_~z~0_Out_154) (= (* |v_main_#t~post5_Out_76| 38) 0) (< (mod (+ 4294967291 v_main_~z~0_Out_154) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_154 4294967296)) (< (mod (+ 4294967292 v_main_~z~0_Out_154) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_154 4) 0)) (= .cse0 0) (< (mod (+ 4294967294 v_main_~z~0_Out_154) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_76) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_154) 4294967296) 268435455))) (= v_main_~y~0_In_38 v_main_~y~0_Out_76)) InVars {main_~y~0=v_main_~y~0_In_38} OutVars{main_#t~post4=|v_main_#t~post4_Out_154|, main_#t~post5=|v_main_#t~post5_Out_76|, main_~y~0=v_main_~y~0_Out_76, main_~z~0=v_main_~z~0_Out_154} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {17377#(= main_~y~0 0)} is VALID [2022-04-15 13:07:39,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {17377#(= 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[] {17373#false} is VALID [2022-04-15 13:07:39,923 INFO L272 TraceCheckUtils]: 9: Hoare triple {17373#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)); {17373#false} is VALID [2022-04-15 13:07:39,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {17373#false} ~cond := #in~cond; {17373#false} is VALID [2022-04-15 13:07:39,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {17373#false} assume 0 == ~cond; {17373#false} is VALID [2022-04-15 13:07:39,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {17373#false} assume !false; {17373#false} is VALID [2022-04-15 13:07:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:39,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:39,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694988235] [2022-04-15 13:07:39,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694988235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:39,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:39,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:07:40,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:40,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [706580365] [2022-04-15 13:07:40,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [706580365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:40,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:40,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 13:07:40,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007494516] [2022-04-15 13:07:40,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:40,791 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 13:07:40,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:40,791 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 13:07:40,975 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 13:07:40,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 13:07:40,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:40,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 13:07:40,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 13:07:40,976 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 13:08:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:19,644 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-04-15 13:08:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 13:08:19,645 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 13:08:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:08:19,645 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 13:08:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 90 transitions. [2022-04-15 13:08:19,646 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 13:08:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 90 transitions. [2022-04-15 13:08:19,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 90 transitions. [2022-04-15 13:08:20,043 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 13:08:20,044 INFO L225 Difference]: With dead ends: 127 [2022-04-15 13:08:20,044 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 13:08:20,044 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=360, Invalid=6446, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 13:08:20,048 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:08:20,049 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 211 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 22.9s Time] [2022-04-15 13:08:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 13:08:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-04-15 13:08:20,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:08:20,152 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 13:08:20,152 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 13:08:20,152 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 13:08:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:20,153 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-15 13:08:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-15 13:08:20,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:20,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:20,153 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 13:08:20,153 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 13:08:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:20,154 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-15 13:08:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-15 13:08:20,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:20,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:20,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:08:20,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:08:20,154 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 13:08:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-04-15 13:08:20,155 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 58 [2022-04-15 13:08:20,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:08:20,155 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-04-15 13:08:20,155 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 13:08:20,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 68 transitions. [2022-04-15 13:08:20,735 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 13:08:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-15 13:08:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 13:08:20,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:08:20,736 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 13:08:20,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-15 13:08:20,736 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:08:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:08:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1477683710, now seen corresponding path program 39 times [2022-04-15 13:08:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:20,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1155443919] [2022-04-15 13:08:21,349 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:08:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash -764248136, now seen corresponding path program 1 times [2022-04-15 13:08:21,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:08:21,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887553985] [2022-04-15 13:08:21,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:21,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:08:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:08:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:21,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {18031#(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); {18025#true} is VALID [2022-04-15 13:08:21,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {18025#true} assume true; {18025#true} is VALID [2022-04-15 13:08:21,422 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18025#true} {18025#true} #63#return; {18025#true} is VALID [2022-04-15 13:08:21,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {18025#true} call ULTIMATE.init(); {18031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:08:21,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {18031#(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); {18025#true} is VALID [2022-04-15 13:08:21,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {18025#true} assume true; {18025#true} is VALID [2022-04-15 13:08:21,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18025#true} {18025#true} #63#return; {18025#true} is VALID [2022-04-15 13:08:21,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {18025#true} call #t~ret7 := main(); {18025#true} is VALID [2022-04-15 13:08:21,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {18025#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {18025#true} is VALID [2022-04-15 13:08:21,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {18025#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {18030#(= main_~y~0 0)} is VALID [2022-04-15 13:08:21,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {18030#(= main_~y~0 0)} [151] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_Out_78 39))) (and (< (mod (+ 4294967271 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967269 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967281 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_158 4294967280) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967275 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967262 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967270 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_158 4294967277) 4294967296) 268435455) (< (mod (+ 4294967267 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_158) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_158 4294967296)) (= 39 v_main_~z~0_Out_158) (< (mod (+ 4294967295 v_main_~y~0_Out_78) 4294967296) 268435455) (< (mod (+ 4294967265 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967272 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967287 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967273 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967274 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967266 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967285 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967279 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967282 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967263 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967276 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967283 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967261 v_main_~z~0_Out_158) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_78| 39) 0) (< (mod (+ 4294967264 v_main_~z~0_Out_158) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967278 v_main_~z~0_Out_158) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_158) 4294967296) 268435455) (= .cse0 (* 39 v_main_~y~0_In_39)) (< (mod (+ 4294967268 v_main_~z~0_Out_158) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_158 4) 0)) (< (mod (+ 4294967289 v_main_~z~0_Out_158) 4294967296) 268435455))) (= v_main_~y~0_In_39 v_main_~y~0_Out_78)) InVars {main_~y~0=v_main_~y~0_In_39} OutVars{main_#t~post4=|v_main_#t~post4_Out_158|, main_#t~post5=|v_main_#t~post5_Out_78|, main_~y~0=v_main_~y~0_Out_78, main_~z~0=v_main_~z~0_Out_158} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {18030#(= main_~y~0 0)} is VALID [2022-04-15 13:08:21,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {18030#(= 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[] {18026#false} is VALID [2022-04-15 13:08:21,425 INFO L272 TraceCheckUtils]: 9: Hoare triple {18026#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)); {18026#false} is VALID [2022-04-15 13:08:21,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {18026#false} ~cond := #in~cond; {18026#false} is VALID [2022-04-15 13:08:21,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {18026#false} assume 0 == ~cond; {18026#false} is VALID [2022-04-15 13:08:21,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {18026#false} assume !false; {18026#false} is VALID [2022-04-15 13:08:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:08:21,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:08:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887553985] [2022-04-15 13:08:21,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887553985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:21,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:21,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:08:22,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:08:22,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1155443919] [2022-04-15 13:08:22,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1155443919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:22,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:22,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 13:08:22,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763042275] [2022-04-15 13:08:22,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:08:22,289 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 13:08:22,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:08:22,289 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 13:08:22,553 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 13:08:22,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 13:08:22,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:22,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 13:08:22,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 13:08:22,554 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 13:09:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:16,714 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-04-15 13:09:16,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 13:09:16,714 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 13:09:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:16,714 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 13:09:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 91 transitions. [2022-04-15 13:09:16,715 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 13:09:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 91 transitions. [2022-04-15 13:09:16,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 91 transitions. [2022-04-15 13:09:16,934 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 13:09:16,934 INFO L225 Difference]: With dead ends: 129 [2022-04-15 13:09:16,934 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 13:09:16,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=369, Invalid=6771, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 13:09:16,935 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 2447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:16,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 216 Invalid, 2447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 34.1s Time] [2022-04-15 13:09:16,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 13:09:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2022-04-15 13:09:17,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:17,053 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 13:09:17,053 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 13:09:17,053 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 13:09:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:17,054 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-04-15 13:09:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-04-15 13:09:17,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:17,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:17,054 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 13:09:17,054 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 13:09:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:17,055 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-04-15 13:09:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-04-15 13:09:17,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:17,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:17,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:17,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:17,055 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 13:09:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-04-15 13:09:17,056 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 59 [2022-04-15 13:09:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:17,056 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-04-15 13:09:17,056 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 13:09:17,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 69 transitions. [2022-04-15 13:09:17,486 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 13:09:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-04-15 13:09:17,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 13:09:17,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:17,487 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 13:09:17,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-15 13:09:17,487 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:17,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:17,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1906239454, now seen corresponding path program 40 times [2022-04-15 13:09:17,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:17,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [283806823] [2022-04-15 13:09:17,959 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:09:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash -705142792, now seen corresponding path program 1 times [2022-04-15 13:09:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:17,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103945770] [2022-04-15 13:09:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:17,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:09:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:17,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {18695#(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); {18689#true} is VALID [2022-04-15 13:09:17,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {18689#true} assume true; {18689#true} is VALID [2022-04-15 13:09:17,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18689#true} {18689#true} #63#return; {18689#true} is VALID [2022-04-15 13:09:17,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {18689#true} call ULTIMATE.init(); {18695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:09:17,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {18695#(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); {18689#true} is VALID [2022-04-15 13:09:17,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {18689#true} assume true; {18689#true} is VALID [2022-04-15 13:09:17,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18689#true} {18689#true} #63#return; {18689#true} is VALID [2022-04-15 13:09:17,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {18689#true} call #t~ret7 := main(); {18689#true} is VALID [2022-04-15 13:09:17,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {18689#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {18689#true} is VALID [2022-04-15 13:09:18,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {18689#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {18694#(= main_~y~0 0)} is VALID [2022-04-15 13:09:18,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {18694#(= main_~y~0 0)} [153] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_40 v_main_~y~0_Out_80) (let ((.cse0 (* 40 v_main_~y~0_Out_80))) (and (= 40 v_main_~z~0_Out_162) (< (mod (+ 4294967295 v_main_~y~0_Out_80) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_162 4294967296)) (= (* 40 |v_main_#t~post5_Out_80|) 0) (not (= (mod v_main_~z~0_Out_162 4) 0)) (= .cse0 0) (= (* 40 v_main_~y~0_In_40) .cse0)))) InVars {main_~y~0=v_main_~y~0_In_40} OutVars{main_#t~post4=|v_main_#t~post4_Out_162|, main_#t~post5=|v_main_#t~post5_Out_80|, main_~y~0=v_main_~y~0_Out_80, main_~z~0=v_main_~z~0_Out_162} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {18694#(= main_~y~0 0)} is VALID [2022-04-15 13:09:18,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {18694#(= 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[] {18690#false} is VALID [2022-04-15 13:09:18,003 INFO L272 TraceCheckUtils]: 9: Hoare triple {18690#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)); {18690#false} is VALID [2022-04-15 13:09:18,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {18690#false} ~cond := #in~cond; {18690#false} is VALID [2022-04-15 13:09:18,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {18690#false} assume 0 == ~cond; {18690#false} is VALID [2022-04-15 13:09:18,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {18690#false} assume !false; {18690#false} is VALID [2022-04-15 13:09:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:18,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:18,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103945770] [2022-04-15 13:09:18,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103945770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:18,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:18,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:09:18,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:18,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [283806823] [2022-04-15 13:09:18,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [283806823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:18,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:18,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 13:09:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120864309] [2022-04-15 13:09:18,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:18,745 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 13:09:18,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:18,745 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 13:09:18,845 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 13:09:18,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 13:09:18,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 13:09:18,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 13:09:18,846 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 13:09:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:57,479 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2022-04-15 13:09:57,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 13:09:57,479 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 13:09:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:57,479 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 13:09:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 92 transitions. [2022-04-15 13:09:57,480 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 13:09:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 92 transitions. [2022-04-15 13:09:57,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 92 transitions. [2022-04-15 13:09:58,109 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 13:09:58,110 INFO L225 Difference]: With dead ends: 131 [2022-04-15 13:09:58,110 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 13:09:58,111 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=378, Invalid=7104, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 13:09:58,111 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:58,111 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 22.9s Time] [2022-04-15 13:09:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 13:09:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2022-04-15 13:09:58,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:58,230 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 13:09:58,230 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 13:09:58,231 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 13:09:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:58,231 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-04-15 13:09:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-04-15 13:09:58,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:58,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:58,232 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 13:09:58,232 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 13:09:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:58,232 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-04-15 13:09:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-04-15 13:09:58,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:58,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:58,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:58,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:58,233 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 13:09:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-04-15 13:09:58,233 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 60 [2022-04-15 13:09:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:58,233 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-04-15 13:09:58,234 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 13:09:58,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 70 transitions. [2022-04-15 13:09:59,119 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 13:09:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-15 13:09:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 13:09:59,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:59,120 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 13:09:59,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-15 13:09:59,120 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1988401666, now seen corresponding path program 41 times [2022-04-15 13:09:59,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:59,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [675152082] [2022-04-15 13:09:59,698 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:09:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash -646037448, now seen corresponding path program 1 times [2022-04-15 13:09:59,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:59,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992033804] [2022-04-15 13:09:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:59,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:59,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:09:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:59,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {19370#(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); {19364#true} is VALID [2022-04-15 13:09:59,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {19364#true} assume true; {19364#true} is VALID [2022-04-15 13:09:59,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19364#true} {19364#true} #63#return; {19364#true} is VALID [2022-04-15 13:09:59,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {19364#true} call ULTIMATE.init(); {19370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:09:59,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {19370#(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); {19364#true} is VALID [2022-04-15 13:09:59,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {19364#true} assume true; {19364#true} is VALID [2022-04-15 13:09:59,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19364#true} {19364#true} #63#return; {19364#true} is VALID [2022-04-15 13:09:59,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {19364#true} call #t~ret7 := main(); {19364#true} is VALID [2022-04-15 13:09:59,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {19364#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {19364#true} is VALID [2022-04-15 13:09:59,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {19364#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {19369#(= main_~y~0 0)} is VALID [2022-04-15 13:09:59,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {19369#(= main_~y~0 0)} [155] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_41 v_main_~y~0_Out_82) (let ((.cse0 (* 41 v_main_~y~0_Out_82))) (and (= (* 41 |v_main_#t~post5_Out_82|) 0) (< (mod (+ 4294967287 v_main_~z~0_Out_166) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_166) 4294967296) 268435455) (= .cse0 0) (= 41 v_main_~z~0_Out_166) (< (mod (+ 4294967289 v_main_~z~0_Out_166) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_166) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_166) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_166 4294967296)) (not (= (mod v_main_~z~0_Out_166 4) 0)) (< (mod (+ 4294967293 v_main_~z~0_Out_166) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_166) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_82) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_166) 4294967296) 268435455) (= .cse0 (* 41 v_main_~y~0_In_41)) (< (mod (+ 4294967294 v_main_~z~0_Out_166) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_166) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_41} OutVars{main_#t~post4=|v_main_#t~post4_Out_166|, main_#t~post5=|v_main_#t~post5_Out_82|, main_~y~0=v_main_~y~0_Out_82, main_~z~0=v_main_~z~0_Out_166} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {19369#(= main_~y~0 0)} is VALID [2022-04-15 13:09:59,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {19369#(= 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[] {19365#false} is VALID [2022-04-15 13:09:59,752 INFO L272 TraceCheckUtils]: 9: Hoare triple {19365#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)); {19365#false} is VALID [2022-04-15 13:09:59,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {19365#false} ~cond := #in~cond; {19365#false} is VALID [2022-04-15 13:09:59,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {19365#false} assume 0 == ~cond; {19365#false} is VALID [2022-04-15 13:09:59,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {19365#false} assume !false; {19365#false} is VALID [2022-04-15 13:09:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:59,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:59,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992033804] [2022-04-15 13:09:59,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992033804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:59,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:59,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:10:00,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:10:00,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [675152082] [2022-04-15 13:10:00,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [675152082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:00,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:00,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 13:10:00,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112342766] [2022-04-15 13:10:00,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:10:00,648 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 13:10:00,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:10:00,648 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 13:10:00,925 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 13:10:00,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 13:10:00,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:00,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 13:10:00,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 13:10:00,926 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 13:11:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:02,239 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2022-04-15 13:11:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 13:11:02,239 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 13:11:02,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:11:02,239 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 13:11:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 93 transitions. [2022-04-15 13:11:02,240 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 13:11:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 93 transitions. [2022-04-15 13:11:02,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 93 transitions. [2022-04-15 13:11:02,778 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 13:11:02,779 INFO L225 Difference]: With dead ends: 133 [2022-04-15 13:11:02,779 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 13:11:02,780 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=387, Invalid=7445, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 13:11:02,780 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:11:02,780 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 201 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 37.9s Time] [2022-04-15 13:11:02,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 13:11:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2022-04-15 13:11:02,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:11:02,898 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 13:11:02,898 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 13:11:02,898 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 13:11:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:02,899 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-04-15 13:11:02,899 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-04-15 13:11:02,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:02,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:02,899 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 13:11:02,899 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 13:11:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:02,900 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-04-15 13:11:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-04-15 13:11:02,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:02,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:02,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:11:02,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:11:02,900 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 13:11:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-15 13:11:02,901 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 61 [2022-04-15 13:11:02,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:11:02,901 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-15 13:11:02,901 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 13:11:02,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 71 transitions. [2022-04-15 13:11:03,737 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 13:11:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-15 13:11:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 13:11:03,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:11:03,738 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 13:11:03,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-15 13:11:03,738 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:11:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:11:03,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1831775198, now seen corresponding path program 42 times [2022-04-15 13:11:03,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:03,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931796899] [2022-04-15 13:11:04,197 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:11:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash -586932104, now seen corresponding path program 1 times [2022-04-15 13:11:04,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:11:04,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570735301] [2022-04-15 13:11:04,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:04,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:11:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:04,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:11:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:04,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {20056#(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); {20050#true} is VALID [2022-04-15 13:11:04,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {20050#true} assume true; {20050#true} is VALID [2022-04-15 13:11:04,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20050#true} {20050#true} #63#return; {20050#true} is VALID [2022-04-15 13:11:04,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {20050#true} call ULTIMATE.init(); {20056#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:11:04,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {20056#(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); {20050#true} is VALID [2022-04-15 13:11:04,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {20050#true} assume true; {20050#true} is VALID [2022-04-15 13:11:04,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20050#true} {20050#true} #63#return; {20050#true} is VALID [2022-04-15 13:11:04,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {20050#true} call #t~ret7 := main(); {20050#true} is VALID [2022-04-15 13:11:04,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {20050#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {20050#true} is VALID [2022-04-15 13:11:04,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {20050#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {20055#(= main_~y~0 0)} is VALID [2022-04-15 13:11:04,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {20055#(= main_~y~0 0)} [157] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* 42 v_main_~y~0_Out_84))) (and (< (mod (+ 4294967288 v_main_~z~0_Out_170) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_84) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_170) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_170) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_170) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_170) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967289 v_main_~z~0_Out_170) 4294967296) 268435455) (< (mod (+ 4294967285 v_main_~z~0_Out_170) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_170 4294967296)) (= .cse0 (* 42 v_main_~y~0_In_42)) (< (mod (+ 4294967287 v_main_~z~0_Out_170) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_170) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_84| 42) 0) (< (mod (+ 4294967294 v_main_~z~0_Out_170) 4294967296) 268435455) (= 42 v_main_~z~0_Out_170) (not (= (mod v_main_~z~0_Out_170 4) 0)) (< (mod (+ 4294967295 v_main_~z~0_Out_170) 4294967296) 268435455))) (= v_main_~y~0_In_42 v_main_~y~0_Out_84)) InVars {main_~y~0=v_main_~y~0_In_42} OutVars{main_#t~post4=|v_main_#t~post4_Out_170|, main_#t~post5=|v_main_#t~post5_Out_84|, main_~y~0=v_main_~y~0_Out_84, main_~z~0=v_main_~z~0_Out_170} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {20055#(= main_~y~0 0)} is VALID [2022-04-15 13:11:04,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {20055#(= 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[] {20051#false} is VALID [2022-04-15 13:11:04,254 INFO L272 TraceCheckUtils]: 9: Hoare triple {20051#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)); {20051#false} is VALID [2022-04-15 13:11:04,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {20051#false} ~cond := #in~cond; {20051#false} is VALID [2022-04-15 13:11:04,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {20051#false} assume 0 == ~cond; {20051#false} is VALID [2022-04-15 13:11:04,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {20051#false} assume !false; {20051#false} is VALID [2022-04-15 13:11:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:11:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:11:04,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570735301] [2022-04-15 13:11:04,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570735301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:04,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:04,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:11:05,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931796899] [2022-04-15 13:11:05,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931796899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:05,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:05,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 13:11:05,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182557425] [2022-04-15 13:11:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:05,128 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 13:11:05,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:05,128 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 13:11:05,324 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 13:11:05,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 13:11:05,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:05,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 13:11:05,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 13:11:05,325 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 13:11:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:56,511 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-04-15 13:11:56,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 13:11:56,511 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 13:11:56,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:11:56,513 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 13:11:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 94 transitions. [2022-04-15 13:11:56,514 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 13:11:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 94 transitions. [2022-04-15 13:11:56,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 94 transitions. [2022-04-15 13:11:56,866 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 13:11:56,867 INFO L225 Difference]: With dead ends: 135 [2022-04-15 13:11:56,867 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 13:11:56,867 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=396, Invalid=7794, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 13:11:56,867 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:11:56,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 236 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 29.5s Time] [2022-04-15 13:11:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 13:11:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2022-04-15 13:11:56,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:11:56,992 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 13:11:56,992 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 13:11:56,993 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 13:11:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:56,993 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-15 13:11:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-04-15 13:11:57,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:57,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:57,007 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 13:11:57,007 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 13:11:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:57,008 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-15 13:11:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-04-15 13:11:57,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:57,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:57,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:11:57,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:11:57,008 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 13:11:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-04-15 13:11:57,009 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 62 [2022-04-15 13:11:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:11:57,009 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-04-15 13:11:57,009 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 13:11:57,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 72 transitions. [2022-04-15 13:11:57,665 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 13:11:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-15 13:11:57,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 13:11:57,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:11:57,666 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 13:11:57,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-15 13:11:57,666 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:11:57,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:11:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1826306, now seen corresponding path program 43 times [2022-04-15 13:11:57,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:57,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2051586620] [2022-04-15 13:11:58,103 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:11:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash -527826760, now seen corresponding path program 1 times [2022-04-15 13:11:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:11:58,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828408339] [2022-04-15 13:11:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:11:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:58,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:11:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:58,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {20753#(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); {20747#true} is VALID [2022-04-15 13:11:58,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {20747#true} assume true; {20747#true} is VALID [2022-04-15 13:11:58,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20747#true} {20747#true} #63#return; {20747#true} is VALID [2022-04-15 13:11:58,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {20747#true} call ULTIMATE.init(); {20753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:11:58,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {20753#(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); {20747#true} is VALID [2022-04-15 13:11:58,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {20747#true} assume true; {20747#true} is VALID [2022-04-15 13:11:58,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20747#true} {20747#true} #63#return; {20747#true} is VALID [2022-04-15 13:11:58,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {20747#true} call #t~ret7 := main(); {20747#true} is VALID [2022-04-15 13:11:58,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {20747#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {20747#true} is VALID [2022-04-15 13:11:58,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {20747#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {20752#(= main_~y~0 0)} is VALID [2022-04-15 13:11:58,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {20752#(= main_~y~0 0)} [159] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_43 v_main_~y~0_Out_86) (let ((.cse0 (* v_main_~y~0_Out_86 43))) (and (< (mod (+ 4294967288 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_86) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_86| 43) 0) (< (mod (+ 4294967281 v_main_~z~0_Out_174) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967289 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967282 v_main_~z~0_Out_174) 4294967296) 268435455) (= .cse0 (* v_main_~y~0_In_43 43)) (< (mod (+ 4294967293 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967278 v_main_~z~0_Out_174) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_174 4294967296)) (< (mod (+ 4294967273 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967272 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_174) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_174 4) 0)) (< (mod (+ 4294967294 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_174 4294967280) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967279 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967287 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967274 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967285 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ 4294967275 v_main_~z~0_Out_174) 4294967296) 268435455) (= 43 v_main_~z~0_Out_174) (< (mod (+ 4294967276 v_main_~z~0_Out_174) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_174 4294967277) 4294967296) 268435455) (< (mod (+ 4294967283 v_main_~z~0_Out_174) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_43} OutVars{main_#t~post4=|v_main_#t~post4_Out_174|, main_#t~post5=|v_main_#t~post5_Out_86|, main_~y~0=v_main_~y~0_Out_86, main_~z~0=v_main_~z~0_Out_174} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {20752#(= main_~y~0 0)} is VALID [2022-04-15 13:11:58,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {20752#(= 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[] {20748#false} is VALID [2022-04-15 13:11:58,158 INFO L272 TraceCheckUtils]: 9: Hoare triple {20748#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)); {20748#false} is VALID [2022-04-15 13:11:58,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {20748#false} ~cond := #in~cond; {20748#false} is VALID [2022-04-15 13:11:58,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {20748#false} assume 0 == ~cond; {20748#false} is VALID [2022-04-15 13:11:58,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {20748#false} assume !false; {20748#false} is VALID [2022-04-15 13:11:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:11:58,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:11:58,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828408339] [2022-04-15 13:11:58,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828408339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:58,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:58,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:11:58,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:58,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2051586620] [2022-04-15 13:11:58,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2051586620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:58,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:58,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 13:11:58,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056327161] [2022-04-15 13:11:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:58,979 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 13:11:58,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:58,980 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 13:11:59,114 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 13:11:59,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 13:11:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:59,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 13:11:59,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 13:11:59,116 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 13:12:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:50,192 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-04-15 13:12:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 13:12:50,193 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 13:12:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:12:50,193 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 13:12:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 95 transitions. [2022-04-15 13:12:50,194 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 13:12:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 95 transitions. [2022-04-15 13:12:50,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 95 transitions. [2022-04-15 13:12:50,540 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 13:12:50,541 INFO L225 Difference]: With dead ends: 137 [2022-04-15 13:12:50,541 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 13:12:50,542 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=405, Invalid=8151, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 13:12:50,542 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:12:50,542 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 211 Invalid, 2797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 28.8s Time] [2022-04-15 13:12:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 13:12:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-04-15 13:12:50,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:12:50,665 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 13:12:50,671 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 13:12:50,671 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 13:12:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:50,672 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-15 13:12:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-15 13:12:50,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:12:50,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:12:50,672 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 13:12:50,673 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 13:12:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:50,673 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-15 13:12:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-15 13:12:50,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:12:50,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:12:50,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:12:50,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:12:50,674 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 13:12:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-15 13:12:50,674 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 63 [2022-04-15 13:12:50,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:12:50,674 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-15 13:12:50,674 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 13:12:50,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-15 13:12:51,420 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 13:12:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-15 13:12:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 13:12:51,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:12:51,420 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 13:12:51,421 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-15 13:12:51,421 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:12:51,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:12:51,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1008898082, now seen corresponding path program 44 times [2022-04-15 13:12:51,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:51,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649139435] [2022-04-15 13:12:51,932 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:12:51,936 INFO L85 PathProgramCache]: Analyzing trace with hash -468721416, now seen corresponding path program 1 times [2022-04-15 13:12:51,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:12:51,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820003892] [2022-04-15 13:12:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:12:51,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:12:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:12:51,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:12:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:12:51,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {21461#(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); {21455#true} is VALID [2022-04-15 13:12:51,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {21455#true} assume true; {21455#true} is VALID [2022-04-15 13:12:51,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21455#true} {21455#true} #63#return; {21455#true} is VALID [2022-04-15 13:12:51,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {21455#true} call ULTIMATE.init(); {21461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:12:51,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {21461#(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); {21455#true} is VALID [2022-04-15 13:12:51,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {21455#true} assume true; {21455#true} is VALID [2022-04-15 13:12:51,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21455#true} {21455#true} #63#return; {21455#true} is VALID [2022-04-15 13:12:51,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {21455#true} call #t~ret7 := main(); {21455#true} is VALID [2022-04-15 13:12:51,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {21455#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {21455#true} is VALID [2022-04-15 13:12:51,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {21455#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {21460#(= main_~y~0 0)} is VALID [2022-04-15 13:12:51,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {21460#(= main_~y~0 0)} [161] L22-2-->L22-3_primed: Formula: (or (let ((.cse0 (* 44 v_main_~y~0_Out_88))) (and (= (* |v_main_#t~post5_Out_88| 44) 0) (< (mod (+ 4294967295 v_main_~z~0_Out_178) 4294967296) 268435455) (= .cse0 (* 44 v_main_~y~0_In_44)) (= 44 v_main_~z~0_Out_178) (< (mod (+ 4294967285 v_main_~z~0_Out_178) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_178) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_178) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_178) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967294 v_main_~z~0_Out_178) 4294967296) 268435455) (< (mod (+ 4294967287 v_main_~z~0_Out_178) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_178) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_178 4) 0)) (< (mod (+ 4294967293 v_main_~z~0_Out_178) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_178 4294967296)) (< (mod (+ 4294967295 v_main_~y~0_Out_88) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_178) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_178) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_178) 4294967296) 268435455))) (= v_main_~y~0_In_44 v_main_~y~0_Out_88)) InVars {main_~y~0=v_main_~y~0_In_44} OutVars{main_#t~post4=|v_main_#t~post4_Out_178|, main_#t~post5=|v_main_#t~post5_Out_88|, main_~y~0=v_main_~y~0_Out_88, main_~z~0=v_main_~z~0_Out_178} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {21460#(= main_~y~0 0)} is VALID [2022-04-15 13:12:51,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {21460#(= 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[] {21456#false} is VALID [2022-04-15 13:12:51,987 INFO L272 TraceCheckUtils]: 9: Hoare triple {21456#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)); {21456#false} is VALID [2022-04-15 13:12:51,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {21456#false} ~cond := #in~cond; {21456#false} is VALID [2022-04-15 13:12:51,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {21456#false} assume 0 == ~cond; {21456#false} is VALID [2022-04-15 13:12:51,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {21456#false} assume !false; {21456#false} is VALID [2022-04-15 13:12:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:12:51,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:12:51,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820003892] [2022-04-15 13:12:51,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820003892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:12:51,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:12:51,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:12:52,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:12:52,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649139435] [2022-04-15 13:12:52,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649139435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:12:52,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:12:52,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 13:12:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276335427] [2022-04-15 13:12:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:12:52,809 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 13:12:52,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:12:52,810 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 13:12:52,933 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 13:12:52,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 13:12:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:52,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 13:12:52,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 13:12:52,934 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 13:13:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:59,324 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2022-04-15 13:13:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 13:13:59,324 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 13:13:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:59,331 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 13:13:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 96 transitions. [2022-04-15 13:13:59,332 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 13:13:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 96 transitions. [2022-04-15 13:13:59,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 96 transitions. [2022-04-15 13:13:59,681 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 13:13:59,682 INFO L225 Difference]: With dead ends: 139 [2022-04-15 13:13:59,682 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 13:13:59,683 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=414, Invalid=8516, Unknown=0, NotChecked=0, Total=8930 [2022-04-15 13:13:59,683 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 2847 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:59,683 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 231 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2847 Invalid, 0 Unknown, 0 Unchecked, 38.8s Time] [2022-04-15 13:13:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 13:13:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-04-15 13:13:59,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:59,767 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 13:13:59,767 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 13:13:59,767 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 13:13:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:59,768 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-04-15 13:13:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-04-15 13:13:59,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:59,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:59,768 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 13:13:59,768 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 13:13:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:59,769 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-04-15 13:13:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-04-15 13:13:59,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:59,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:59,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:59,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:59,769 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 13:13:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-04-15 13:13:59,770 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 64 [2022-04-15 13:13:59,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:59,770 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-04-15 13:13:59,770 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 13:13:59,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 74 transitions. [2022-04-15 13:14:00,612 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 13:14:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-15 13:14:00,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 13:14:00,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:00,613 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 13:14:00,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-15 13:14:00,614 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:00,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:00,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2131615230, now seen corresponding path program 45 times [2022-04-15 13:14:00,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:00,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245070780] [2022-04-15 13:14:01,084 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:01,087 INFO L85 PathProgramCache]: Analyzing trace with hash -409616072, now seen corresponding path program 1 times [2022-04-15 13:14:01,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:01,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507523125] [2022-04-15 13:14:01,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:01,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:01,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {22180#(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); {22174#true} is VALID [2022-04-15 13:14:01,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {22174#true} assume true; {22174#true} is VALID [2022-04-15 13:14:01,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22174#true} {22174#true} #63#return; {22174#true} is VALID [2022-04-15 13:14:01,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {22174#true} call ULTIMATE.init(); {22180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:01,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {22180#(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); {22174#true} is VALID [2022-04-15 13:14:01,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {22174#true} assume true; {22174#true} is VALID [2022-04-15 13:14:01,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22174#true} {22174#true} #63#return; {22174#true} is VALID [2022-04-15 13:14:01,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {22174#true} call #t~ret7 := main(); {22174#true} is VALID [2022-04-15 13:14:01,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {22174#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {22174#true} is VALID [2022-04-15 13:14:01,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {22174#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {22179#(= main_~y~0 0)} is VALID [2022-04-15 13:14:01,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {22179#(= main_~y~0 0)} [163] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_45 v_main_~y~0_Out_90) (let ((.cse0 (* v_main_~y~0_Out_90 45))) (and (< (mod (+ 4294967295 v_main_~z~0_Out_182) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_182) 4294967296) 268435455) (= 45 v_main_~z~0_Out_182) (< (mod (+ 4294967286 v_main_~z~0_Out_182) 4294967296) 268435455) (< (mod (+ 4294967287 v_main_~z~0_Out_182) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_182 4) 0)) (< (mod (+ 4294967288 v_main_~z~0_Out_182) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_90) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_182 4294967296)) (< (mod (+ 4294967290 v_main_~z~0_Out_182) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_182) 4294967296) 268435455) (< (mod (+ 4294967285 v_main_~z~0_Out_182) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_90| 45) 0) (= .cse0 0) (< (mod (+ 4294967282 v_main_~z~0_Out_182) 4294967296) 268435455) (< (mod (+ 4294967283 v_main_~z~0_Out_182) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_182) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_182) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_182) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_182) 4294967296) 268435455) (= .cse0 (* 45 v_main_~y~0_In_45))))) InVars {main_~y~0=v_main_~y~0_In_45} OutVars{main_#t~post4=|v_main_#t~post4_Out_182|, main_#t~post5=|v_main_#t~post5_Out_90|, main_~y~0=v_main_~y~0_Out_90, main_~z~0=v_main_~z~0_Out_182} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {22179#(= main_~y~0 0)} is VALID [2022-04-15 13:14:01,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {22179#(= 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[] {22175#false} is VALID [2022-04-15 13:14:01,151 INFO L272 TraceCheckUtils]: 9: Hoare triple {22175#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)); {22175#false} is VALID [2022-04-15 13:14:01,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {22175#false} ~cond := #in~cond; {22175#false} is VALID [2022-04-15 13:14:01,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {22175#false} assume 0 == ~cond; {22175#false} is VALID [2022-04-15 13:14:01,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {22175#false} assume !false; {22175#false} is VALID [2022-04-15 13:14:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:01,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:01,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507523125] [2022-04-15 13:14:01,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507523125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:01,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:01,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:02,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:02,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245070780] [2022-04-15 13:14:02,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245070780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:02,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:02,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 13:14:02,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696871009] [2022-04-15 13:14:02,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:02,176 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 13:14:02,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:02,176 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 13:14:02,436 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 13:14:02,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 13:14:02,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:02,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 13:14:02,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 13:14:02,436 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 13:15:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:10,851 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2022-04-15 13:15:10,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 13:15:10,852 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 13:15:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:15:10,852 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 13:15:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 97 transitions. [2022-04-15 13:15:10,853 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 13:15:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 97 transitions. [2022-04-15 13:15:10,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 97 transitions. [2022-04-15 13:15:11,294 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 13:15:11,295 INFO L225 Difference]: With dead ends: 141 [2022-04-15 13:15:11,295 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 13:15:11,295 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=423, Invalid=8889, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 13:15:11,296 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 2529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:15:11,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 46 Invalid, 2529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2424 Invalid, 0 Unknown, 0 Unchecked, 39.5s Time] [2022-04-15 13:15:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 13:15:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-04-15 13:15:11,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:15:11,412 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 13:15:11,412 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 13:15:11,412 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 13:15:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:11,413 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-04-15 13:15:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-15 13:15:11,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:11,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:11,413 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 13:15:11,413 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 13:15:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:11,414 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-04-15 13:15:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-15 13:15:11,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:11,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:11,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:15:11,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:15:11,414 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 13:15:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-04-15 13:15:11,415 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 65 [2022-04-15 13:15:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:15:11,415 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-04-15 13:15:11,415 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 13:15:11,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 75 transitions. [2022-04-15 13:15:12,188 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 13:15:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-04-15 13:15:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 13:15:12,188 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:15:12,188 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 13:15:12,188 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-15 13:15:12,189 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:15:12,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:15:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash -703280094, now seen corresponding path program 46 times [2022-04-15 13:15:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:12,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [470372481] [2022-04-15 13:15:12,725 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:15:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash -350510728, now seen corresponding path program 1 times [2022-04-15 13:15:12,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:12,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133010879] [2022-04-15 13:15:12,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:12,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:15:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:12,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {22910#(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); {22904#true} is VALID [2022-04-15 13:15:12,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {22904#true} assume true; {22904#true} is VALID [2022-04-15 13:15:12,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22904#true} {22904#true} #63#return; {22904#true} is VALID [2022-04-15 13:15:12,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {22904#true} call ULTIMATE.init(); {22910#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:15:12,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {22910#(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); {22904#true} is VALID [2022-04-15 13:15:12,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {22904#true} assume true; {22904#true} is VALID [2022-04-15 13:15:12,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22904#true} {22904#true} #63#return; {22904#true} is VALID [2022-04-15 13:15:12,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {22904#true} call #t~ret7 := main(); {22904#true} is VALID [2022-04-15 13:15:12,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {22904#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {22904#true} is VALID [2022-04-15 13:15:12,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {22904#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {22909#(= main_~y~0 0)} is VALID [2022-04-15 13:15:12,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {22909#(= main_~y~0 0)} [165] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_46 v_main_~y~0_Out_92) (let ((.cse0 (* v_main_~y~0_Out_92 46))) (and (= 46 v_main_~z~0_Out_186) (< (mod (+ 4294967290 v_main_~z~0_Out_186) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_92| 46) 0) (= 0 .cse0) (< (mod (+ 4294967295 v_main_~z~0_Out_186) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_186) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_186) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_186) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_186) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_92) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_186 4294967296)) (= (* 46 v_main_~y~0_In_46) .cse0) (not (= (mod v_main_~z~0_Out_186 4) 0))))) InVars {main_~y~0=v_main_~y~0_In_46} OutVars{main_#t~post4=|v_main_#t~post4_Out_186|, main_#t~post5=|v_main_#t~post5_Out_92|, main_~y~0=v_main_~y~0_Out_92, main_~z~0=v_main_~z~0_Out_186} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {22909#(= main_~y~0 0)} is VALID [2022-04-15 13:15:12,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {22909#(= 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[] {22905#false} is VALID [2022-04-15 13:15:12,775 INFO L272 TraceCheckUtils]: 9: Hoare triple {22905#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)); {22905#false} is VALID [2022-04-15 13:15:12,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {22905#false} ~cond := #in~cond; {22905#false} is VALID [2022-04-15 13:15:12,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {22905#false} assume 0 == ~cond; {22905#false} is VALID [2022-04-15 13:15:12,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {22905#false} assume !false; {22905#false} is VALID [2022-04-15 13:15:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:15:12,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:15:12,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133010879] [2022-04-15 13:15:12,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133010879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:12,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:12,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:13,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:15:13,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [470372481] [2022-04-15 13:15:13,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [470372481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:13,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:13,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 13:15:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548479963] [2022-04-15 13:15:13,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:15:13,911 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 13:15:13,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:15:13,912 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 13:15:14,203 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 13:15:14,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 13:15:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 13:15:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 13:15:14,204 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 13:16:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:46,601 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2022-04-15 13:16:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 13:16:46,602 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 13:16:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:46,602 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 13:16:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 98 transitions. [2022-04-15 13:16:46,603 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 13:16:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 98 transitions. [2022-04-15 13:16:46,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 98 transitions. [2022-04-15 13:16:47,182 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 13:16:47,183 INFO L225 Difference]: With dead ends: 143 [2022-04-15 13:16:47,183 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 13:16:47,184 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=432, Invalid=9270, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 13:16:47,184 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 3041 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:47,184 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 231 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3041 Invalid, 0 Unknown, 0 Unchecked, 55.7s Time] [2022-04-15 13:16:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 13:16:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-04-15 13:16:47,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:47,314 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 13:16:47,314 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 13:16:47,314 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 13:16:47,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:47,315 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-04-15 13:16:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-04-15 13:16:47,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:47,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:47,315 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 13:16:47,315 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 13:16:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:47,316 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-04-15 13:16:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-04-15 13:16:47,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:47,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:47,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:47,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:47,317 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 13:16:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-15 13:16:47,317 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 66 [2022-04-15 13:16:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:47,318 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-15 13:16:47,318 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 13:16:47,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 76 transitions. [2022-04-15 13:16:48,281 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 13:16:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-15 13:16:48,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 13:16:48,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:48,282 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 13:16:48,282 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-04-15 13:16:48,282 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:48,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:48,282 INFO L85 PathProgramCache]: Analyzing trace with hash 625436162, now seen corresponding path program 47 times [2022-04-15 13:16:48,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:48,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1052611322] [2022-04-15 13:16:49,058 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:49,066 INFO L85 PathProgramCache]: Analyzing trace with hash -291405384, now seen corresponding path program 1 times [2022-04-15 13:16:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:49,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981687050] [2022-04-15 13:16:49,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:49,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:49,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {23651#(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); {23645#true} is VALID [2022-04-15 13:16:49,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {23645#true} assume true; {23645#true} is VALID [2022-04-15 13:16:49,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23645#true} {23645#true} #63#return; {23645#true} is VALID [2022-04-15 13:16:49,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {23645#true} call ULTIMATE.init(); {23651#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:49,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {23651#(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); {23645#true} is VALID [2022-04-15 13:16:49,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {23645#true} assume true; {23645#true} is VALID [2022-04-15 13:16:49,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23645#true} {23645#true} #63#return; {23645#true} is VALID [2022-04-15 13:16:49,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {23645#true} call #t~ret7 := main(); {23645#true} is VALID [2022-04-15 13:16:49,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {23645#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {23645#true} is VALID [2022-04-15 13:16:49,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {23645#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {23650#(= main_~y~0 0)} is VALID [2022-04-15 13:16:49,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {23650#(= main_~y~0 0)} [167] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_47 v_main_~y~0_Out_94) (let ((.cse0 (* 47 v_main_~y~0_Out_94))) (and (< (mod (+ 4294967267 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967269 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967266 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967259 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967287 v_main_~z~0_Out_190) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_94| 47) 0) (< (mod (+ 4294967279 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967293 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_190 4294967255) 4294967296) 268435455) (< (mod (+ 4294967263 v_main_~z~0_Out_190) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_190 4) 0)) (< (mod (+ 4294967283 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967256 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_190 4294967257) 4294967296) 268435455) (< (mod (+ 4294967278 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967261 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967273 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967254 v_main_~z~0_Out_190) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967264 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967294 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967276 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_190 4294967280) 4294967296) 268435455) (= 47 v_main_~z~0_Out_190) (< (mod (+ 4294967270 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967282 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967258 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967272 v_main_~z~0_Out_190) 4294967296) 268435455) (= (* 47 v_main_~y~0_In_47) .cse0) (< (mod (+ 4294967271 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967285 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967274 v_main_~z~0_Out_190) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_190 4294967296)) (< (mod (+ v_main_~z~0_Out_190 4294967277) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967265 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_94) 4294967296) 268435455) (< (mod (+ 4294967275 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967262 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967268 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967260 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_190) 4294967296) 268435455) (< (mod (+ 4294967281 v_main_~z~0_Out_190) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_47} OutVars{main_#t~post4=|v_main_#t~post4_Out_190|, main_#t~post5=|v_main_#t~post5_Out_94|, main_~y~0=v_main_~y~0_Out_94, main_~z~0=v_main_~z~0_Out_190} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {23650#(= main_~y~0 0)} is VALID [2022-04-15 13:16:49,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {23650#(= 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[] {23646#false} is VALID [2022-04-15 13:16:49,116 INFO L272 TraceCheckUtils]: 9: Hoare triple {23646#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)); {23646#false} is VALID [2022-04-15 13:16:49,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {23646#false} ~cond := #in~cond; {23646#false} is VALID [2022-04-15 13:16:49,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {23646#false} assume 0 == ~cond; {23646#false} is VALID [2022-04-15 13:16:49,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {23646#false} assume !false; {23646#false} is VALID [2022-04-15 13:16:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:49,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:49,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981687050] [2022-04-15 13:16:49,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981687050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:49,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:49,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:16:50,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:50,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1052611322] [2022-04-15 13:16:50,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1052611322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:50,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:50,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 13:16:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126944348] [2022-04-15 13:16:50,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:50,101 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 13:16:50,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:50,102 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 13:16:50,413 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 13:16:50,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 13:16:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 13:16:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 13:16:50,414 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 13:18:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:36,863 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2022-04-15 13:18:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 13:18:36,863 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 13:18:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:36,863 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 13:18:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 99 transitions. [2022-04-15 13:18:36,864 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 13:18:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 99 transitions. [2022-04-15 13:18:36,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 99 transitions. [2022-04-15 13:18:37,546 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 13:18:37,547 INFO L225 Difference]: With dead ends: 145 [2022-04-15 13:18:37,547 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 13:18:37,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=441, Invalid=9659, Unknown=0, NotChecked=0, Total=10100 [2022-04-15 13:18:37,549 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2664 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:37,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2664 Invalid, 0 Unknown, 0 Unchecked, 66.3s Time] [2022-04-15 13:18:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 13:18:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-04-15 13:18:37,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:37,689 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 13:18:37,689 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 13:18:37,689 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 13:18:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:37,690 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2022-04-15 13:18:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-15 13:18:37,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:37,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:37,690 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 13:18:37,690 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 13:18:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:37,691 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2022-04-15 13:18:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-15 13:18:37,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:37,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:37,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:37,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:37,691 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 13:18:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-15 13:18:37,692 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 67 [2022-04-15 13:18:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:37,692 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-15 13:18:37,692 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 13:18:37,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 77 transitions. [2022-04-15 13:18:38,799 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 13:18:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-15 13:18:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 13:18:38,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:38,799 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 13:18:38,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-04-15 13:18:38,800 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:38,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1134032862, now seen corresponding path program 48 times [2022-04-15 13:18:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:38,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1414315114] [2022-04-15 13:18:39,436 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:18:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash -232300040, now seen corresponding path program 1 times [2022-04-15 13:18:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:39,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177184466] [2022-04-15 13:18:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:39,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {24403#(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); {24397#true} is VALID [2022-04-15 13:18:39,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {24397#true} assume true; {24397#true} is VALID [2022-04-15 13:18:39,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24397#true} {24397#true} #63#return; {24397#true} is VALID [2022-04-15 13:18:39,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {24397#true} call ULTIMATE.init(); {24403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:39,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {24403#(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); {24397#true} is VALID [2022-04-15 13:18:39,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {24397#true} assume true; {24397#true} is VALID [2022-04-15 13:18:39,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24397#true} {24397#true} #63#return; {24397#true} is VALID [2022-04-15 13:18:39,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {24397#true} call #t~ret7 := main(); {24397#true} is VALID [2022-04-15 13:18:39,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {24397#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {24397#true} is VALID [2022-04-15 13:18:39,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {24397#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {24402#(= main_~y~0 0)} is VALID [2022-04-15 13:18:39,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {24402#(= main_~y~0 0)} [169] L22-2-->L22-3_primed: Formula: (or (= v_main_~y~0_In_48 v_main_~y~0_Out_96) (let ((.cse0 (* v_main_~y~0_Out_96 48))) (and (< (mod (+ 4294967271 v_main_~z~0_Out_194) 4294967296) 268435455) (= (* v_main_~y~0_In_48 48) .cse0) (< (mod (+ 4294967294 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967288 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967289 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967268 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967284 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967290 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967274 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967282 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_194 4294967277) 4294967296) 268435455) (< (mod (+ 4294967278 v_main_~z~0_Out_194) 4294967296) 268435455) (not (= (mod v_main_~z~0_Out_194 4) 0)) (< (mod (+ 4294967259 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967263 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967267 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~y~0_Out_96) 4294967296) 268435455) (< (mod (+ 4294967279 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967264 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967261 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967265 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967283 v_main_~z~0_Out_194) 4294967296) 268435455) (= .cse0 0) (< (mod (+ 4294967281 v_main_~z~0_Out_194) 4294967296) 268435455) (= (* |v_main_#t~post5_Out_96| 48) 0) (< (mod (+ 4294967269 v_main_~z~0_Out_194) 4294967296) 268435455) (= 48 v_main_~z~0_Out_194) (< (mod (+ v_main_~z~0_Out_194 4294967257) 4294967296) 268435455) (< (mod (+ 4294967291 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967287 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967262 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967258 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967286 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967266 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967276 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967270 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967285 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967260 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967256 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967272 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967275 v_main_~z~0_Out_194) 4294967296) 268435455) (<= 268435455 (mod v_main_~z~0_Out_194 4294967296)) (< (mod (+ 4294967293 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ 4294967273 v_main_~z~0_Out_194) 4294967296) 268435455) (< (mod (+ v_main_~z~0_Out_194 4294967280) 4294967296) 268435455) (< (mod (+ 4294967295 v_main_~z~0_Out_194) 4294967296) 268435455)))) InVars {main_~y~0=v_main_~y~0_In_48} OutVars{main_#t~post4=|v_main_#t~post4_Out_194|, main_#t~post5=|v_main_#t~post5_Out_96|, main_~y~0=v_main_~y~0_Out_96, main_~z~0=v_main_~z~0_Out_194} AuxVars[] AssignedVars[main_~z~0, main_#t~post4, main_#t~post5, main_~y~0] {24402#(= main_~y~0 0)} is VALID [2022-04-15 13:18:39,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {24402#(= 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[] {24398#false} is VALID [2022-04-15 13:18:39,497 INFO L272 TraceCheckUtils]: 9: Hoare triple {24398#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)); {24398#false} is VALID [2022-04-15 13:18:39,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {24398#false} ~cond := #in~cond; {24398#false} is VALID [2022-04-15 13:18:39,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {24398#false} assume 0 == ~cond; {24398#false} is VALID [2022-04-15 13:18:39,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {24398#false} assume !false; {24398#false} is VALID [2022-04-15 13:18:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:18:39,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:39,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177184466] [2022-04-15 13:18:39,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177184466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:39,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:39,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4