/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/Mono3_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:46:35,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:46:35,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:46:35,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:46:35,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:46:35,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:46:35,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:46:35,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:46:35,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:46:35,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:46:35,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:46:35,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:46:35,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:46:35,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:46:35,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:46:35,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:46:35,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:46:35,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:46:35,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:46:35,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:46:35,454 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:46:35,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:46:35,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:46:35,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:46:35,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:46:35,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:46:35,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:46:35,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:46:35,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:46:35,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:46:35,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:46:35,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:46:35,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:46:35,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:46:35,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:46:35,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:46:35,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:46:35,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:46:35,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:46:35,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:46:35,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:46:35,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:46:35,475 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:46:35,486 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:46:35,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:46:35,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:46:35,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:46:35,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:46:35,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:46:35,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:46:35,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:46:35,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:46:35,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:46:35,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:46:35,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:46:35,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:46:35,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:46:35,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:46:35,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:46:35,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:46:35,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:46:35,491 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:46:35,491 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:46:35,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:46:35,491 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:46:35,492 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:46:35,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:46:35,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:46:35,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:46:35,760 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:46:35,761 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:46:35,762 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-04-15 12:46:35,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa3c66fe7/48a014bb9ade485e8cd6629ddfbc1cdb/FLAG33c74eb37 [2022-04-15 12:46:36,227 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:46:36,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-04-15 12:46:36,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa3c66fe7/48a014bb9ade485e8cd6629ddfbc1cdb/FLAG33c74eb37 [2022-04-15 12:46:36,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa3c66fe7/48a014bb9ade485e8cd6629ddfbc1cdb [2022-04-15 12:46:36,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:46:36,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:46:36,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:46:36,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:46:36,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:46:36,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:46:36" (1/1) ... [2022-04-15 12:46:36,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71ea8ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:36, skipping insertion in model container [2022-04-15 12:46:36,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:46:36" (1/1) ... [2022-04-15 12:46:36,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:46:36,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:46:36,850 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/Mono3_1.c[311,324] [2022-04-15 12:46:36,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:46:36,882 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:46:36,893 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/Mono3_1.c[311,324] [2022-04-15 12:46:36,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:46:36,909 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:46:36,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:36 WrapperNode [2022-04-15 12:46:36,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:46:36,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:46:36,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:46:36,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:46:36,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:36" (1/1) ... [2022-04-15 12:46:36,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:36" (1/1) ... [2022-04-15 12:46:36,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:36" (1/1) ... [2022-04-15 12:46:36,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:36" (1/1) ... [2022-04-15 12:46:36,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:36" (1/1) ... [2022-04-15 12:46:36,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:36" (1/1) ... [2022-04-15 12:46:36,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:36" (1/1) ... [2022-04-15 12:46:36,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:46:36,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:46:36,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:46:36,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:46:36,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:36" (1/1) ... [2022-04-15 12:46:36,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:46:36,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:36,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:46:36,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:46:37,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:46:37,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:46:37,013 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:46:37,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:46:37,014 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:46:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:46:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:46:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:46:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:46:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:46:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:46:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:46:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:46:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:46:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:46:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:46:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:46:37,077 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:46:37,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:46:37,210 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:46:37,231 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:46:37,232 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:46:37,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:46:37 BoogieIcfgContainer [2022-04-15 12:46:37,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:46:37,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:46:37,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:46:37,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:46:37,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:46:36" (1/3) ... [2022-04-15 12:46:37,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b29f26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:46:37, skipping insertion in model container [2022-04-15 12:46:37,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:36" (2/3) ... [2022-04-15 12:46:37,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b29f26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:46:37, skipping insertion in model container [2022-04-15 12:46:37,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:46:37" (3/3) ... [2022-04-15 12:46:37,241 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono3_1.c [2022-04-15 12:46:37,245 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:46:37,245 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:46:37,296 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:46:37,301 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:46:37,302 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:46:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:46:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:46:37,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:37,351 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:37,352 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:37,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1326077006, now seen corresponding path program 1 times [2022-04-15 12:46:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:37,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2044364621] [2022-04-15 12:46:37,383 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:46:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1326077006, now seen corresponding path program 2 times [2022-04-15 12:46:37,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:37,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136559912] [2022-04-15 12:46:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:37,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:37,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-15 12:46:37,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:46:37,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-15 12:46:37,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:37,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-15 12:46:37,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:46:37,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-15 12:46:37,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret7 := main(); {23#true} is VALID [2022-04-15 12:46:37,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0;~y~0 := 0; {23#true} is VALID [2022-04-15 12:46:37,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-15 12:46:37,581 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {24#false} is VALID [2022-04-15 12:46:37,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 12:46:37,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 12:46:37,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 12:46:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:37,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:37,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136559912] [2022-04-15 12:46:37,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136559912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:37,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:37,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:46:37,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:37,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2044364621] [2022-04-15 12:46:37,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2044364621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:37,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:37,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:46:37,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790327444] [2022-04-15 12:46:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:37,594 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 12:46:37,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:37,600 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 12:46:37,621 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 12:46:37,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:46:37,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:37,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:46:37,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:46:37,646 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:37,735 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 12:46:37,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:46:37,735 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 12:46:37,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:37,736 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 12:46:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 12:46:37,747 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 12:46:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 12:46:37,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-15 12:46:37,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:37,820 INFO L225 Difference]: With dead ends: 31 [2022-04-15 12:46:37,820 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 12:46:37,823 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:46:37,825 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:37,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 12:46:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 12:46:37,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:37,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,858 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,859 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:37,865 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 12:46:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 12:46:37,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:37,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:37,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:46:37,867 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:46:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:37,871 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 12:46:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 12:46:37,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:37,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:37,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:37,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 12:46:37,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 12:46:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:37,876 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 12:46:37,876 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 12:46:37,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 12:46:37,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 12:46:37,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:46:37,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:37,899 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:37,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:46:37,903 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:37,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:37,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2022-04-15 12:46:37,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:37,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026115215] [2022-04-15 12:46:37,907 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:46:37,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 2 times [2022-04-15 12:46:37,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:37,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294351744] [2022-04-15 12:46:37,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:37,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:38,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {149#true} is VALID [2022-04-15 12:46:38,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-15 12:46:38,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #41#return; {149#true} is VALID [2022-04-15 12:46:38,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:38,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {149#true} is VALID [2022-04-15 12:46:38,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-15 12:46:38,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #41#return; {149#true} is VALID [2022-04-15 12:46:38,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret7 := main(); {149#true} is VALID [2022-04-15 12:46:38,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} ~x~0 := 0;~y~0 := 0; {154#(= main_~x~0 0)} is VALID [2022-04-15 12:46:38,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 1000000); {150#false} is VALID [2022-04-15 12:46:38,006 INFO L272 TraceCheckUtils]: 7: Hoare triple {150#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {150#false} is VALID [2022-04-15 12:46:38,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {150#false} ~cond := #in~cond; {150#false} is VALID [2022-04-15 12:46:38,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#false} assume 0 == ~cond; {150#false} is VALID [2022-04-15 12:46:38,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-15 12:46:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:38,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:38,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294351744] [2022-04-15 12:46:38,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294351744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:38,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:38,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:38,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:38,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1026115215] [2022-04-15 12:46:38,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1026115215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:38,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:38,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:38,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323784046] [2022-04-15 12:46:38,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:38,010 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 12:46:38,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:38,010 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 12:46:38,024 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 12:46:38,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:46:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:38,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:46:38,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:46:38,025 INFO L87 Difference]: Start difference. First operand 14 states and 15 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 12:46:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:38,089 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 12:46:38,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:46:38,090 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 12:46:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:38,090 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 12:46:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 12:46:38,092 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 12:46:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 12:46:38,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-15 12:46:38,128 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 12:46:38,129 INFO L225 Difference]: With dead ends: 25 [2022-04-15 12:46:38,129 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:46:38,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:46:38,131 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:38,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:46:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 12:46:38,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:38,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:38,135 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:38,135 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:38,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:38,137 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 12:46:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 12:46:38,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:38,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:38,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:46:38,138 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:46:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:38,139 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 12:46:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 12:46:38,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:38,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:38,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:38,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 12:46:38,141 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-15 12:46:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:38,142 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 12:46:38,142 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 12:46:38,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 12:46:38,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 12:46:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:46:38,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:38,160 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:38,160 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:46:38,161 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:38,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:38,161 INFO L85 PathProgramCache]: Analyzing trace with hash 644646283, now seen corresponding path program 1 times [2022-04-15 12:46:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:38,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [704928203] [2022-04-15 12:46:38,637 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1209153456, now seen corresponding path program 1 times [2022-04-15 12:46:38,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:38,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678992252] [2022-04-15 12:46:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:38,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:38,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:38,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {276#true} is VALID [2022-04-15 12:46:38,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-15 12:46:38,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {276#true} {276#true} #41#return; {276#true} is VALID [2022-04-15 12:46:38,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:38,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {276#true} is VALID [2022-04-15 12:46:38,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-15 12:46:38,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} #41#return; {276#true} is VALID [2022-04-15 12:46:38,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {276#true} call #t~ret7 := main(); {276#true} is VALID [2022-04-15 12:46:38,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} ~x~0 := 0;~y~0 := 0; {281#(= main_~x~0 0)} is VALID [2022-04-15 12:46:38,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#(= main_~x~0 0)} [47] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_1 v_main_~y~0_Out_2))) (or (and .cse0 (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (< (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296) 500000) (= 0 |v_main_#t~post6_Out_2|) .cse0 (= v_main_~x~0_Out_2 v_main_~x~0_In_1) (= v_main_~y~0_Out_2 0)))) InVars {main_~x~0=v_main_~x~0_In_1, main_~y~0=v_main_~y~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~y~0=v_main_~y~0_Out_2, main_~x~0=v_main_~x~0_Out_2, main_#t~post6=|v_main_#t~post6_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {281#(= main_~x~0 0)} is VALID [2022-04-15 12:46:38,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {281#(= main_~x~0 0)} [46] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {277#false} is VALID [2022-04-15 12:46:38,764 INFO L272 TraceCheckUtils]: 8: Hoare triple {277#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {277#false} is VALID [2022-04-15 12:46:38,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#false} ~cond := #in~cond; {277#false} is VALID [2022-04-15 12:46:38,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {277#false} assume 0 == ~cond; {277#false} is VALID [2022-04-15 12:46:38,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#false} assume !false; {277#false} is VALID [2022-04-15 12:46:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:38,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:38,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678992252] [2022-04-15 12:46:38,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678992252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:38,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:38,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:38,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:38,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [704928203] [2022-04-15 12:46:38,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [704928203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:38,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:38,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340068412] [2022-04-15 12:46:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:38,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 12:46:38,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:38,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 12:46:38,845 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 12:46:38,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:46:38,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:38,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:46:38,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:46:38,847 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 12:46:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:38,951 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 12:46:38,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:46:38,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 12:46:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 12:46:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 12:46:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 12:46:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 12:46:38,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 12:46:38,982 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 12:46:38,983 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:46:38,983 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:46:38,983 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:46:38,984 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:38,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:46:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-15 12:46:38,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:38,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:38,989 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:38,989 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:38,991 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-15 12:46:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 12:46:38,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:38,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:38,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:46:38,992 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:46:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:38,993 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-15 12:46:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 12:46:38,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:38,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:38,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:38,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-15 12:46:38,995 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-15 12:46:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:38,995 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-15 12:46:38,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 12:46:38,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-15 12:46:39,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 12:46:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:46:39,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:39,021 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:39,022 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:46:39,024 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:39,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash 148462787, now seen corresponding path program 2 times [2022-04-15 12:46:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:39,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1081183430] [2022-04-15 12:48:13,322 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:13,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1150048112, now seen corresponding path program 1 times [2022-04-15 12:48:13,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:13,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656617265] [2022-04-15 12:48:13,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:13,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:13,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:13,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {424#true} is VALID [2022-04-15 12:48:13,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {424#true} assume true; {424#true} is VALID [2022-04-15 12:48:13,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {424#true} {424#true} #41#return; {424#true} is VALID [2022-04-15 12:48:13,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {424#true} call ULTIMATE.init(); {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:13,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {424#true} is VALID [2022-04-15 12:48:13,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {424#true} assume true; {424#true} is VALID [2022-04-15 12:48:13,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {424#true} {424#true} #41#return; {424#true} is VALID [2022-04-15 12:48:13,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {424#true} call #t~ret7 := main(); {424#true} is VALID [2022-04-15 12:48:13,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {424#true} ~x~0 := 0;~y~0 := 0; {429#(= main_~x~0 0)} is VALID [2022-04-15 12:48:13,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {429#(= main_~x~0 0)} [49] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) (or (and (= v_main_~y~0_Out_4 0) (= 0 |v_main_#t~post6_Out_4|) (= v_main_~x~0_Out_4 v_main_~x~0_In_2) (< (mod (+ v_main_~x~0_Out_4 4294967295) 4294967296) 500000) .cse0) (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) .cse0))) InVars {main_~x~0=v_main_~x~0_In_2, main_~y~0=v_main_~y~0_In_2} OutVars{main_#t~post4=|v_main_#t~post4_Out_4|, main_~y~0=v_main_~y~0_Out_4, main_~x~0=v_main_~x~0_Out_4, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {429#(= main_~x~0 0)} is VALID [2022-04-15 12:48:13,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {429#(= main_~x~0 0)} [48] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {425#false} is VALID [2022-04-15 12:48:13,370 INFO L272 TraceCheckUtils]: 8: Hoare triple {425#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {425#false} is VALID [2022-04-15 12:48:13,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {425#false} ~cond := #in~cond; {425#false} is VALID [2022-04-15 12:48:13,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {425#false} assume 0 == ~cond; {425#false} is VALID [2022-04-15 12:48:13,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#false} assume !false; {425#false} is VALID [2022-04-15 12:48:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:13,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:13,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656617265] [2022-04-15 12:48:13,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656617265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:13,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:13,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:13,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:13,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1081183430] [2022-04-15 12:48:13,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1081183430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:13,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:13,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:48:13,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565879124] [2022-04-15 12:48:13,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:13,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:48:13,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:13,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:13,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:13,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:48:13,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:48:13,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:48:13,437 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:13,570 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 12:48:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:48:13,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:48:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 12:48:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 12:48:13,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-15 12:48:13,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:13,607 INFO L225 Difference]: With dead ends: 31 [2022-04-15 12:48:13,607 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:48:13,608 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:48:13,611 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:13,614 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:48:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:48:13,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 12:48:13,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:13,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:13,623 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:13,623 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:13,625 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-15 12:48:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 12:48:13,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:13,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:13,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:48:13,626 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:48:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:13,627 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-15 12:48:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 12:48:13,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:13,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:13,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:13,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-15 12:48:13,629 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-15 12:48:13,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:13,629 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-15 12:48:13,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:13,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-15 12:48:13,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 12:48:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:48:13,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:13,652 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:13,652 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:48:13,652 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:13,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1623366283, now seen corresponding path program 3 times [2022-04-15 12:48:13,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:13,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [464799528] [2022-04-15 12:48:13,837 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:13,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1090942768, now seen corresponding path program 1 times [2022-04-15 12:48:13,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:13,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743478789] [2022-04-15 12:48:13,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:13,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:13,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:13,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {593#true} is VALID [2022-04-15 12:48:13,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-15 12:48:13,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {593#true} {593#true} #41#return; {593#true} is VALID [2022-04-15 12:48:13,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:13,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {593#true} is VALID [2022-04-15 12:48:13,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-15 12:48:13,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #41#return; {593#true} is VALID [2022-04-15 12:48:13,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret7 := main(); {593#true} is VALID [2022-04-15 12:48:13,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} ~x~0 := 0;~y~0 := 0; {598#(= main_~x~0 0)} is VALID [2022-04-15 12:48:13,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {598#(= main_~x~0 0)} [51] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_3 v_main_~y~0_Out_6))) (or (and .cse0 (= v_main_~x~0_In_3 v_main_~x~0_Out_6)) (and (= v_main_~y~0_Out_6 0) (< (mod (+ v_main_~x~0_Out_6 4294967295) 4294967296) 500000) .cse0 (= 0 |v_main_#t~post6_Out_6|) (= v_main_~x~0_Out_6 v_main_~x~0_In_3)))) InVars {main_~x~0=v_main_~x~0_In_3, main_~y~0=v_main_~y~0_In_3} OutVars{main_#t~post4=|v_main_#t~post4_Out_6|, main_~y~0=v_main_~y~0_Out_6, main_~x~0=v_main_~x~0_Out_6, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {598#(= main_~x~0 0)} is VALID [2022-04-15 12:48:13,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {598#(= main_~x~0 0)} [50] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {594#false} is VALID [2022-04-15 12:48:13,889 INFO L272 TraceCheckUtils]: 8: Hoare triple {594#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {594#false} is VALID [2022-04-15 12:48:13,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#false} ~cond := #in~cond; {594#false} is VALID [2022-04-15 12:48:13,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#false} assume 0 == ~cond; {594#false} is VALID [2022-04-15 12:48:13,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-15 12:48:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:13,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:13,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743478789] [2022-04-15 12:48:13,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743478789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:13,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:13,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:13,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:13,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [464799528] [2022-04-15 12:48:13,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [464799528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:13,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:13,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:48:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242250312] [2022-04-15 12:48:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:13,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:48:13,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:13,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:13,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:13,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:48:13,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:13,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:48:13,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:48:13,988 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:14,223 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 12:48:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:48:14,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:48:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 12:48:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 12:48:14,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-15 12:48:14,260 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 12:48:14,261 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:48:14,261 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:48:14,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:48:14,262 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:14,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 34 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:48:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:48:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 12:48:14,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:14,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,267 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,267 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:14,268 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-15 12:48:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:48:14,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:14,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:14,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:48:14,269 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:48:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:14,270 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-15 12:48:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:48:14,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:14,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:14,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:14,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-15 12:48:14,272 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2022-04-15 12:48:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:14,272 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-15 12:48:14,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-15 12:48:14,304 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 12:48:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-15 12:48:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:48:14,306 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:14,306 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:14,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:48:14,307 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1336989757, now seen corresponding path program 4 times [2022-04-15 12:48:14,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:14,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1680234939] [2022-04-15 12:48:14,502 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:14,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1031837424, now seen corresponding path program 1 times [2022-04-15 12:48:14,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:14,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511140870] [2022-04-15 12:48:14,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:14,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:14,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-15 12:48:14,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-15 12:48:14,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {783#true} {783#true} #41#return; {783#true} is VALID [2022-04-15 12:48:14,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:14,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-15 12:48:14,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-15 12:48:14,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #41#return; {783#true} is VALID [2022-04-15 12:48:14,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret7 := main(); {783#true} is VALID [2022-04-15 12:48:14,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} ~x~0 := 0;~y~0 := 0; {788#(= main_~x~0 0)} is VALID [2022-04-15 12:48:14,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {788#(= main_~x~0 0)} [53] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_4 v_main_~y~0_Out_8))) (or (and .cse0 (= v_main_~x~0_In_4 v_main_~x~0_Out_8)) (and (= 0 |v_main_#t~post6_Out_8|) (= v_main_~x~0_Out_8 v_main_~x~0_In_4) .cse0 (< (mod (+ v_main_~x~0_Out_8 4294967295) 4294967296) 500000) (= v_main_~y~0_Out_8 0)))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_4} OutVars{main_#t~post4=|v_main_#t~post4_Out_8|, main_~y~0=v_main_~y~0_Out_8, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {788#(= main_~x~0 0)} is VALID [2022-04-15 12:48:14,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {788#(= main_~x~0 0)} [52] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {784#false} is VALID [2022-04-15 12:48:14,543 INFO L272 TraceCheckUtils]: 8: Hoare triple {784#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {784#false} is VALID [2022-04-15 12:48:14,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#false} ~cond := #in~cond; {784#false} is VALID [2022-04-15 12:48:14,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {784#false} assume 0 == ~cond; {784#false} is VALID [2022-04-15 12:48:14,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-15 12:48:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:14,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511140870] [2022-04-15 12:48:14,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511140870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:14,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:14,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:14,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:14,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1680234939] [2022-04-15 12:48:14,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1680234939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:14,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:14,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:48:14,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780406033] [2022-04-15 12:48:14,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:14,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:48:14,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:14,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:14,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:48:14,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:48:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:48:14,669 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:14,932 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 12:48:14,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:48:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:48:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:48:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:48:14,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-15 12:48:14,989 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 12:48:14,990 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:48:14,990 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:48:14,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:48:14,991 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:14,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 39 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:48:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:48:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 12:48:14,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:14,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,996 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,996 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:14,997 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 12:48:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 12:48:14,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:14,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:14,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:48:14,998 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:48:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:14,999 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 12:48:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 12:48:15,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:15,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:15,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:15,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-04-15 12:48:15,001 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 23 [2022-04-15 12:48:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:15,001 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-04-15 12:48:15,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:15,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2022-04-15 12:48:15,029 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 12:48:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-15 12:48:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:48:15,030 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:15,030 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:15,030 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:48:15,030 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:15,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:15,031 INFO L85 PathProgramCache]: Analyzing trace with hash -445321333, now seen corresponding path program 5 times [2022-04-15 12:48:15,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:15,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366463839] [2022-04-15 12:48:15,222 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash -972732080, now seen corresponding path program 1 times [2022-04-15 12:48:15,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:15,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381072542] [2022-04-15 12:48:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:15,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:15,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {994#true} is VALID [2022-04-15 12:48:15,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {994#true} assume true; {994#true} is VALID [2022-04-15 12:48:15,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {994#true} {994#true} #41#return; {994#true} is VALID [2022-04-15 12:48:15,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {994#true} call ULTIMATE.init(); {1000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:15,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {994#true} is VALID [2022-04-15 12:48:15,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {994#true} assume true; {994#true} is VALID [2022-04-15 12:48:15,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {994#true} {994#true} #41#return; {994#true} is VALID [2022-04-15 12:48:15,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {994#true} call #t~ret7 := main(); {994#true} is VALID [2022-04-15 12:48:15,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {994#true} ~x~0 := 0;~y~0 := 0; {999#(= main_~x~0 0)} is VALID [2022-04-15 12:48:15,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#(= main_~x~0 0)} [55] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_5 v_main_~x~0_Out_10))) (or (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) .cse0) (and (= v_main_~y~0_Out_10 0) (< (mod (+ 4294967295 v_main_~x~0_Out_10) 4294967296) 500000) (= v_main_~y~0_Out_10 v_main_~y~0_In_5) (= |v_main_#t~post6_Out_10| 0) .cse0))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_5} OutVars{main_#t~post4=|v_main_#t~post4_Out_10|, main_~y~0=v_main_~y~0_Out_10, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {999#(= main_~x~0 0)} is VALID [2022-04-15 12:48:15,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {999#(= main_~x~0 0)} [54] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {995#false} is VALID [2022-04-15 12:48:15,262 INFO L272 TraceCheckUtils]: 8: Hoare triple {995#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {995#false} is VALID [2022-04-15 12:48:15,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {995#false} ~cond := #in~cond; {995#false} is VALID [2022-04-15 12:48:15,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {995#false} assume 0 == ~cond; {995#false} is VALID [2022-04-15 12:48:15,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {995#false} assume !false; {995#false} is VALID [2022-04-15 12:48:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:15,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:15,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381072542] [2022-04-15 12:48:15,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381072542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:15,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:15,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:15,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:15,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366463839] [2022-04-15 12:48:15,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366463839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:15,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:15,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:48:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603391864] [2022-04-15 12:48:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:15,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2022-04-15 12:48:15,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:15,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:15,428 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 12:48:15,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:48:15,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:15,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:48:15,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:48:15,429 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:15,746 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 12:48:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:48:15,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2022-04-15 12:48:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 12:48:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 12:48:15,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-15 12:48:15,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:15,798 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:48:15,798 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:48:15,799 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:48:15,799 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:15,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 44 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:48:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:48:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-15 12:48:15,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:15,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:15,805 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:15,805 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:15,806 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 12:48:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-15 12:48:15,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:15,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:15,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:48:15,807 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:48:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:15,808 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 12:48:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-15 12:48:15,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:15,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:15,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:15,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-15 12:48:15,809 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2022-04-15 12:48:15,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:15,810 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-15 12:48:15,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:15,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-15 12:48:15,844 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 12:48:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-15 12:48:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:48:15,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:15,845 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:15,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:48:15,845 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:15,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:15,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1124027709, now seen corresponding path program 6 times [2022-04-15 12:48:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:15,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1025720639] [2022-04-15 12:48:15,998 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash -913626736, now seen corresponding path program 1 times [2022-04-15 12:48:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:16,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648930438] [2022-04-15 12:48:16,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:16,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:16,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {1232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1226#true} is VALID [2022-04-15 12:48:16,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-15 12:48:16,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1226#true} {1226#true} #41#return; {1226#true} is VALID [2022-04-15 12:48:16,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:16,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {1232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1226#true} is VALID [2022-04-15 12:48:16,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-15 12:48:16,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #41#return; {1226#true} is VALID [2022-04-15 12:48:16,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret7 := main(); {1226#true} is VALID [2022-04-15 12:48:16,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {1226#true} ~x~0 := 0;~y~0 := 0; {1231#(= main_~x~0 0)} is VALID [2022-04-15 12:48:16,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(= main_~x~0 0)} [57] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) (or (and .cse0 (= v_main_~y~0_In_6 v_main_~y~0_Out_12)) (and (= v_main_~y~0_Out_12 v_main_~y~0_In_6) .cse0 (= v_main_~y~0_Out_12 0) (= |v_main_#t~post6_Out_12| 0) (< (mod (+ 4294967295 v_main_~x~0_Out_12) 4294967296) 500000)))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_6} OutVars{main_#t~post4=|v_main_#t~post4_Out_12|, main_~y~0=v_main_~y~0_Out_12, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {1231#(= main_~x~0 0)} is VALID [2022-04-15 12:48:16,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#(= main_~x~0 0)} [56] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1227#false} is VALID [2022-04-15 12:48:16,040 INFO L272 TraceCheckUtils]: 8: Hoare triple {1227#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {1227#false} is VALID [2022-04-15 12:48:16,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#false} ~cond := #in~cond; {1227#false} is VALID [2022-04-15 12:48:16,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {1227#false} assume 0 == ~cond; {1227#false} is VALID [2022-04-15 12:48:16,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2022-04-15 12:48:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:16,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:16,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648930438] [2022-04-15 12:48:16,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648930438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:16,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:16,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:16,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:16,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1025720639] [2022-04-15 12:48:16,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1025720639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:16,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:16,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:48:16,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323190655] [2022-04-15 12:48:16,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:16,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 29 [2022-04-15 12:48:16,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:16,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:16,245 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 12:48:16,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:48:16,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:16,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:48:16,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:48:16,246 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:16,625 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-15 12:48:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:48:16,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 29 [2022-04-15 12:48:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-15 12:48:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-15 12:48:16,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2022-04-15 12:48:16,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:16,674 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:48:16,674 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:48:16,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 13 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:48:16,675 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:16,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:48:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:48:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 12:48:16,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:16,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:16,685 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:16,686 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:16,689 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-04-15 12:48:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-15 12:48:16,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:16,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:16,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:48:16,696 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:48:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:16,697 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-04-15 12:48:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-15 12:48:16,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:16,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:16,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:16,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-15 12:48:16,699 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2022-04-15 12:48:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:16,699 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-15 12:48:16,699 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:16,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-15 12:48:16,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-15 12:48:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:48:16,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:16,731 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:16,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 12:48:16,732 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:16,732 INFO L85 PathProgramCache]: Analyzing trace with hash 240354443, now seen corresponding path program 7 times [2022-04-15 12:48:16,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:16,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929485088] [2022-04-15 12:48:16,900 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash -854521392, now seen corresponding path program 1 times [2022-04-15 12:48:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:16,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529502292] [2022-04-15 12:48:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:16,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:16,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {1485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1479#true} is VALID [2022-04-15 12:48:16,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {1479#true} assume true; {1479#true} is VALID [2022-04-15 12:48:16,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1479#true} {1479#true} #41#return; {1479#true} is VALID [2022-04-15 12:48:16,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {1479#true} call ULTIMATE.init(); {1485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:16,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {1485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1479#true} is VALID [2022-04-15 12:48:16,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {1479#true} assume true; {1479#true} is VALID [2022-04-15 12:48:16,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1479#true} {1479#true} #41#return; {1479#true} is VALID [2022-04-15 12:48:16,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {1479#true} call #t~ret7 := main(); {1479#true} is VALID [2022-04-15 12:48:16,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {1479#true} ~x~0 := 0;~y~0 := 0; {1484#(= main_~x~0 0)} is VALID [2022-04-15 12:48:16,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {1484#(= main_~x~0 0)} [59] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_7 v_main_~x~0_Out_14))) (or (and .cse0 (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (= v_main_~y~0_Out_14 0) .cse0 (< (mod (+ 4294967295 v_main_~x~0_Out_14) 4294967296) 500000) (= v_main_~y~0_Out_14 v_main_~y~0_In_7) (= |v_main_#t~post6_Out_14| 0)))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_7} OutVars{main_#t~post4=|v_main_#t~post4_Out_14|, main_~y~0=v_main_~y~0_Out_14, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {1484#(= main_~x~0 0)} is VALID [2022-04-15 12:48:16,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {1484#(= main_~x~0 0)} [58] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1480#false} is VALID [2022-04-15 12:48:16,939 INFO L272 TraceCheckUtils]: 8: Hoare triple {1480#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {1480#false} is VALID [2022-04-15 12:48:16,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {1480#false} ~cond := #in~cond; {1480#false} is VALID [2022-04-15 12:48:16,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {1480#false} assume 0 == ~cond; {1480#false} is VALID [2022-04-15 12:48:16,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {1480#false} assume !false; {1480#false} is VALID [2022-04-15 12:48:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:16,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:16,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529502292] [2022-04-15 12:48:16,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529502292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:16,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:16,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:17,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:17,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929485088] [2022-04-15 12:48:17,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929485088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:17,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:17,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:48:17,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727908030] [2022-04-15 12:48:17,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:17,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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 32 [2022-04-15 12:48:17,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:17,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:17,167 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 12:48:17,167 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:48:17,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:17,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:48:17,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:48:17,168 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:17,669 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 12:48:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:48:17,669 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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 32 [2022-04-15 12:48:17,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:17,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-15 12:48:17,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-15 12:48:17,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-04-15 12:48:17,721 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 12:48:17,721 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:48:17,721 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:48:17,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:48:17,722 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:17,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 54 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:48:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:48:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 12:48:17,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:17,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:17,728 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:17,728 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:17,729 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-04-15 12:48:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-04-15 12:48:17,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:17,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:17,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:48:17,730 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:48:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:17,731 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-04-15 12:48:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-04-15 12:48:17,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:17,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:17,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:17,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-15 12:48:17,733 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2022-04-15 12:48:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:17,733 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-15 12:48:17,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:17,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-15 12:48:17,773 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 12:48:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 12:48:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:48:17,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:17,774 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:17,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 12:48:17,774 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:17,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1021444669, now seen corresponding path program 8 times [2022-04-15 12:48:17,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:17,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1815391337] [2022-04-15 12:48:17,945 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash -795416048, now seen corresponding path program 1 times [2022-04-15 12:48:17,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:17,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611391802] [2022-04-15 12:48:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:17,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:17,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:17,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {1759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1753#true} is VALID [2022-04-15 12:48:17,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {1753#true} assume true; {1753#true} is VALID [2022-04-15 12:48:17,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1753#true} {1753#true} #41#return; {1753#true} is VALID [2022-04-15 12:48:17,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {1753#true} call ULTIMATE.init(); {1759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:17,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {1759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1753#true} is VALID [2022-04-15 12:48:17,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {1753#true} assume true; {1753#true} is VALID [2022-04-15 12:48:17,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1753#true} {1753#true} #41#return; {1753#true} is VALID [2022-04-15 12:48:17,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {1753#true} call #t~ret7 := main(); {1753#true} is VALID [2022-04-15 12:48:17,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {1753#true} ~x~0 := 0;~y~0 := 0; {1758#(= main_~x~0 0)} is VALID [2022-04-15 12:48:17,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {1758#(= main_~x~0 0)} [61] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) (or (and (= v_main_~y~0_Out_16 v_main_~y~0_In_8) (= v_main_~y~0_Out_16 0) (= |v_main_#t~post6_Out_16| 0) (< (mod (+ 4294967295 v_main_~x~0_Out_16) 4294967296) 500000) .cse0) (and .cse0 (= v_main_~y~0_In_8 v_main_~y~0_Out_16)))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_8} OutVars{main_#t~post4=|v_main_#t~post4_Out_16|, main_~y~0=v_main_~y~0_Out_16, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {1758#(= main_~x~0 0)} is VALID [2022-04-15 12:48:17,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {1758#(= main_~x~0 0)} [60] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1754#false} is VALID [2022-04-15 12:48:17,991 INFO L272 TraceCheckUtils]: 8: Hoare triple {1754#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {1754#false} is VALID [2022-04-15 12:48:17,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {1754#false} ~cond := #in~cond; {1754#false} is VALID [2022-04-15 12:48:17,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {1754#false} assume 0 == ~cond; {1754#false} is VALID [2022-04-15 12:48:17,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {1754#false} assume !false; {1754#false} is VALID [2022-04-15 12:48:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:17,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:17,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611391802] [2022-04-15 12:48:17,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611391802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:17,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:17,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:18,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:18,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1815391337] [2022-04-15 12:48:18,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1815391337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:18,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:18,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:48:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079751574] [2022-04-15 12:48:18,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:18,206 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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 35 [2022-04-15 12:48:18,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:18,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:18,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:18,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:48:18,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:18,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:48:18,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:48:18,237 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:18,793 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-15 12:48:18,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:48:18,793 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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 35 [2022-04-15 12:48:18,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2022-04-15 12:48:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2022-04-15 12:48:18,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 53 transitions. [2022-04-15 12:48:18,840 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 12:48:18,840 INFO L225 Difference]: With dead ends: 49 [2022-04-15 12:48:18,841 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:48:18,841 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 17 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:48:18,842 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:18,842 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 59 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:48:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:48:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-04-15 12:48:18,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:18,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:18,848 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:18,848 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:18,849 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 12:48:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 12:48:18,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:18,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:18,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:48:18,849 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:48:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:18,850 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 12:48:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 12:48:18,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:18,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:18,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:18,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-04-15 12:48:18,852 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 35 [2022-04-15 12:48:18,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:18,852 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-04-15 12:48:18,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:18,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 41 transitions. [2022-04-15 12:48:18,893 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 12:48:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-15 12:48:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 12:48:18,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:18,894 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:18,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 12:48:18,894 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:18,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:18,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1725015669, now seen corresponding path program 9 times [2022-04-15 12:48:18,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:18,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1842811300] [2022-04-15 12:48:19,021 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:19,022 INFO L85 PathProgramCache]: Analyzing trace with hash -736310704, now seen corresponding path program 1 times [2022-04-15 12:48:19,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:19,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219020182] [2022-04-15 12:48:19,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:19,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:19,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:19,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {2054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2048#true} is VALID [2022-04-15 12:48:19,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-15 12:48:19,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2048#true} {2048#true} #41#return; {2048#true} is VALID [2022-04-15 12:48:19,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {2048#true} call ULTIMATE.init(); {2054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:19,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {2054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2048#true} is VALID [2022-04-15 12:48:19,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-15 12:48:19,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2048#true} {2048#true} #41#return; {2048#true} is VALID [2022-04-15 12:48:19,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {2048#true} call #t~ret7 := main(); {2048#true} is VALID [2022-04-15 12:48:19,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {2048#true} ~x~0 := 0;~y~0 := 0; {2053#(= main_~x~0 0)} is VALID [2022-04-15 12:48:19,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {2053#(= main_~x~0 0)} [63] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_9 v_main_~x~0_Out_18))) (or (and (= |v_main_#t~post6_Out_18| 0) .cse0 (= v_main_~y~0_Out_18 0) (= v_main_~y~0_Out_18 v_main_~y~0_In_9) (< (mod (+ 4294967295 v_main_~x~0_Out_18) 4294967296) 500000)) (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) .cse0))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_9} OutVars{main_#t~post4=|v_main_#t~post4_Out_18|, main_~y~0=v_main_~y~0_Out_18, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {2053#(= main_~x~0 0)} is VALID [2022-04-15 12:48:19,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {2053#(= main_~x~0 0)} [62] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {2049#false} is VALID [2022-04-15 12:48:19,054 INFO L272 TraceCheckUtils]: 8: Hoare triple {2049#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {2049#false} is VALID [2022-04-15 12:48:19,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {2049#false} ~cond := #in~cond; {2049#false} is VALID [2022-04-15 12:48:19,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {2049#false} assume 0 == ~cond; {2049#false} is VALID [2022-04-15 12:48:19,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-04-15 12:48:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:19,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219020182] [2022-04-15 12:48:19,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219020182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:19,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:19,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:19,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:19,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1842811300] [2022-04-15 12:48:19,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1842811300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:19,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:19,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:48:19,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329534501] [2022-04-15 12:48:19,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:19,306 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 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 38 [2022-04-15 12:48:19,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:19,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:19,341 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 12:48:19,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:48:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:48:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:48:19,342 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:20,061 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 12:48:20,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:48:20,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 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 38 [2022-04-15 12:48:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-15 12:48:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-15 12:48:20,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-15 12:48:20,114 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 12:48:20,115 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:48:20,115 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:48:20,116 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 19 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:48:20,116 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:20,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 64 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:48:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:48:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-15 12:48:20,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:20,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:20,122 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:20,122 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:20,123 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-15 12:48:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-04-15 12:48:20,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:20,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:20,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:48:20,124 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:48:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:20,125 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-15 12:48:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-04-15 12:48:20,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:20,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:20,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:20,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-04-15 12:48:20,126 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2022-04-15 12:48:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:20,126 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-04-15 12:48:20,127 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:20,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2022-04-15 12:48:20,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-04-15 12:48:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:48:20,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:20,168 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:20,168 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 12:48:20,169 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1926695107, now seen corresponding path program 10 times [2022-04-15 12:48:20,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:20,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1482699317] [2022-04-15 12:48:20,341 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash -677205360, now seen corresponding path program 1 times [2022-04-15 12:48:20,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:20,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856936327] [2022-04-15 12:48:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:20,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:20,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {2370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2364#true} is VALID [2022-04-15 12:48:20,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-15 12:48:20,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2364#true} {2364#true} #41#return; {2364#true} is VALID [2022-04-15 12:48:20,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:20,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2364#true} is VALID [2022-04-15 12:48:20,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-15 12:48:20,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #41#return; {2364#true} is VALID [2022-04-15 12:48:20,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret7 := main(); {2364#true} is VALID [2022-04-15 12:48:20,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#true} ~x~0 := 0;~y~0 := 0; {2369#(= main_~x~0 0)} is VALID [2022-04-15 12:48:20,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {2369#(= main_~x~0 0)} [65] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_10 v_main_~x~0_Out_20))) (or (and (= v_main_~y~0_Out_20 v_main_~y~0_In_10) (< (mod (+ 4294967295 v_main_~x~0_Out_20) 4294967296) 500000) (= |v_main_#t~post6_Out_20| 0) (= v_main_~y~0_Out_20 0) .cse0) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) .cse0))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_10} OutVars{main_#t~post4=|v_main_#t~post4_Out_20|, main_~y~0=v_main_~y~0_Out_20, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {2369#(= main_~x~0 0)} is VALID [2022-04-15 12:48:20,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {2369#(= main_~x~0 0)} [64] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {2365#false} is VALID [2022-04-15 12:48:20,374 INFO L272 TraceCheckUtils]: 8: Hoare triple {2365#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {2365#false} is VALID [2022-04-15 12:48:20,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-15 12:48:20,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-15 12:48:20,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-15 12:48:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:20,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:20,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856936327] [2022-04-15 12:48:20,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856936327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:20,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:20,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:20,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:20,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1482699317] [2022-04-15 12:48:20,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1482699317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:20,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:20,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:48:20,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613962778] [2022-04-15 12:48:20,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:20,644 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 41 [2022-04-15 12:48:20,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:20,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:20,673 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 12:48:20,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:48:20,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:20,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:48:20,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:48:20,674 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:21,445 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-15 12:48:21,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:48:21,446 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 41 [2022-04-15 12:48:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2022-04-15 12:48:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2022-04-15 12:48:21,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 59 transitions. [2022-04-15 12:48:21,500 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 12:48:21,501 INFO L225 Difference]: With dead ends: 55 [2022-04-15 12:48:21,501 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:48:21,502 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 21 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:48:21,502 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:21,502 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 69 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:48:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:48:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-15 12:48:21,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:21,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:21,509 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:21,509 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:21,510 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-04-15 12:48:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-15 12:48:21,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:21,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:21,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:48:21,511 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:48:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:21,512 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-04-15 12:48:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-15 12:48:21,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:21,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:21,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:21,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-04-15 12:48:21,513 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2022-04-15 12:48:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:21,513 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-04-15 12:48:21,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:21,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 47 transitions. [2022-04-15 12:48:21,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-04-15 12:48:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 12:48:21,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:21,564 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:21,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 12:48:21,564 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:21,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1479184757, now seen corresponding path program 11 times [2022-04-15 12:48:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:21,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [667852822] [2022-04-15 12:48:21,776 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash -618100016, now seen corresponding path program 1 times [2022-04-15 12:48:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:21,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795306510] [2022-04-15 12:48:21,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:21,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:21,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {2707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2701#true} is VALID [2022-04-15 12:48:21,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {2701#true} assume true; {2701#true} is VALID [2022-04-15 12:48:21,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2701#true} {2701#true} #41#return; {2701#true} is VALID [2022-04-15 12:48:21,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {2701#true} call ULTIMATE.init(); {2707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:21,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {2707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2701#true} is VALID [2022-04-15 12:48:21,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {2701#true} assume true; {2701#true} is VALID [2022-04-15 12:48:21,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2701#true} {2701#true} #41#return; {2701#true} is VALID [2022-04-15 12:48:21,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {2701#true} call #t~ret7 := main(); {2701#true} is VALID [2022-04-15 12:48:21,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {2701#true} ~x~0 := 0;~y~0 := 0; {2706#(= main_~x~0 0)} is VALID [2022-04-15 12:48:21,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {2706#(= main_~x~0 0)} [67] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_11 v_main_~x~0_Out_22))) (or (and (= v_main_~y~0_Out_22 v_main_~y~0_In_11) (= v_main_~y~0_Out_22 0) (= |v_main_#t~post6_Out_22| 0) (< (mod (+ 4294967295 v_main_~x~0_Out_22) 4294967296) 500000) .cse0) (and (= v_main_~y~0_In_11 v_main_~y~0_Out_22) .cse0))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_11} OutVars{main_#t~post4=|v_main_#t~post4_Out_22|, main_~y~0=v_main_~y~0_Out_22, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {2706#(= main_~x~0 0)} is VALID [2022-04-15 12:48:21,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {2706#(= main_~x~0 0)} [66] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {2702#false} is VALID [2022-04-15 12:48:21,810 INFO L272 TraceCheckUtils]: 8: Hoare triple {2702#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {2702#false} is VALID [2022-04-15 12:48:21,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {2702#false} ~cond := #in~cond; {2702#false} is VALID [2022-04-15 12:48:21,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {2702#false} assume 0 == ~cond; {2702#false} is VALID [2022-04-15 12:48:21,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {2702#false} assume !false; {2702#false} is VALID [2022-04-15 12:48:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:21,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:21,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795306510] [2022-04-15 12:48:21,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795306510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:21,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:21,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:22,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:22,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [667852822] [2022-04-15 12:48:22,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [667852822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:22,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:22,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:48:22,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826619889] [2022-04-15 12:48:22,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:22,116 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 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 44 [2022-04-15 12:48:22,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:22,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:22,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:22,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:48:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:22,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:48:22,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:48:22,152 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:23,042 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 12:48:23,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:48:23,042 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 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 44 [2022-04-15 12:48:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-15 12:48:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-15 12:48:23,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 62 transitions. [2022-04-15 12:48:23,112 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 12:48:23,113 INFO L225 Difference]: With dead ends: 58 [2022-04-15 12:48:23,113 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 12:48:23,113 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 23 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:48:23,114 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:23,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 74 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:48:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 12:48:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-15 12:48:23,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:23,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:23,121 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:23,121 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:23,122 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 12:48:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 12:48:23,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:23,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:23,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 12:48:23,123 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 12:48:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:23,124 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 12:48:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 12:48:23,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:23,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:23,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:23,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-04-15 12:48:23,125 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2022-04-15 12:48:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:23,126 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-04-15 12:48:23,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:23,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 50 transitions. [2022-04-15 12:48:23,187 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 12:48:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 12:48:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:48:23,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:23,188 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:23,188 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 12:48:23,188 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:23,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1738812477, now seen corresponding path program 12 times [2022-04-15 12:48:23,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:23,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [257728116] [2022-04-15 12:48:23,358 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash -558994672, now seen corresponding path program 1 times [2022-04-15 12:48:23,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:23,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633381364] [2022-04-15 12:48:23,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:23,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:23,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:23,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {3065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3059#true} is VALID [2022-04-15 12:48:23,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {3059#true} assume true; {3059#true} is VALID [2022-04-15 12:48:23,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3059#true} {3059#true} #41#return; {3059#true} is VALID [2022-04-15 12:48:23,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {3059#true} call ULTIMATE.init(); {3065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:23,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {3065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3059#true} is VALID [2022-04-15 12:48:23,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {3059#true} assume true; {3059#true} is VALID [2022-04-15 12:48:23,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3059#true} {3059#true} #41#return; {3059#true} is VALID [2022-04-15 12:48:23,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {3059#true} call #t~ret7 := main(); {3059#true} is VALID [2022-04-15 12:48:23,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {3059#true} ~x~0 := 0;~y~0 := 0; {3064#(= main_~x~0 0)} is VALID [2022-04-15 12:48:23,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {3064#(= main_~x~0 0)} [69] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) (or (and (= v_main_~y~0_In_12 v_main_~y~0_Out_24) .cse0) (and (= |v_main_#t~post6_Out_24| 0) (= v_main_~y~0_Out_24 v_main_~y~0_In_12) (< (mod (+ 4294967295 v_main_~x~0_Out_24) 4294967296) 500000) (= v_main_~y~0_Out_24 0) .cse0))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_12} OutVars{main_#t~post4=|v_main_#t~post4_Out_24|, main_~y~0=v_main_~y~0_Out_24, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {3064#(= main_~x~0 0)} is VALID [2022-04-15 12:48:23,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {3064#(= main_~x~0 0)} [68] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {3060#false} is VALID [2022-04-15 12:48:23,411 INFO L272 TraceCheckUtils]: 8: Hoare triple {3060#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {3060#false} is VALID [2022-04-15 12:48:23,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {3060#false} ~cond := #in~cond; {3060#false} is VALID [2022-04-15 12:48:23,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {3060#false} assume 0 == ~cond; {3060#false} is VALID [2022-04-15 12:48:23,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {3060#false} assume !false; {3060#false} is VALID [2022-04-15 12:48:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:23,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633381364] [2022-04-15 12:48:23,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633381364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:23,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:23,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:23,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:23,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [257728116] [2022-04-15 12:48:23,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [257728116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:23,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:23,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:48:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435189185] [2022-04-15 12:48:23,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 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 47 [2022-04-15 12:48:23,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:23,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:23,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:23,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:48:23,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:23,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:48:23,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:48:23,791 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:24,766 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-15 12:48:24,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:48:24,767 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 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 47 [2022-04-15 12:48:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-15 12:48:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-15 12:48:24,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 65 transitions. [2022-04-15 12:48:24,829 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 12:48:24,829 INFO L225 Difference]: With dead ends: 61 [2022-04-15 12:48:24,829 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 12:48:24,830 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 25 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:48:24,830 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:24,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 79 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:48:24,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 12:48:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-15 12:48:24,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:24,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:24,837 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:24,837 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:24,838 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-15 12:48:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 12:48:24,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:24,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:24,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 12:48:24,839 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 12:48:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:24,840 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-15 12:48:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 12:48:24,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:24,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:24,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:24,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-04-15 12:48:24,842 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 47 [2022-04-15 12:48:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:24,842 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-04-15 12:48:24,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:24,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 53 transitions. [2022-04-15 12:48:24,898 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 12:48:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-04-15 12:48:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 12:48:24,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:24,899 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:24,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 12:48:24,899 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1072118901, now seen corresponding path program 13 times [2022-04-15 12:48:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:24,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172997405] [2022-04-15 12:48:25,065 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash -499889328, now seen corresponding path program 1 times [2022-04-15 12:48:25,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:25,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59451019] [2022-04-15 12:48:25,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:25,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:25,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {3444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3438#true} is VALID [2022-04-15 12:48:25,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {3438#true} assume true; {3438#true} is VALID [2022-04-15 12:48:25,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3438#true} {3438#true} #41#return; {3438#true} is VALID [2022-04-15 12:48:25,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {3438#true} call ULTIMATE.init(); {3444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:25,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {3444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3438#true} is VALID [2022-04-15 12:48:25,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {3438#true} assume true; {3438#true} is VALID [2022-04-15 12:48:25,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3438#true} {3438#true} #41#return; {3438#true} is VALID [2022-04-15 12:48:25,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {3438#true} call #t~ret7 := main(); {3438#true} is VALID [2022-04-15 12:48:25,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {3438#true} ~x~0 := 0;~y~0 := 0; {3443#(= main_~x~0 0)} is VALID [2022-04-15 12:48:25,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {3443#(= main_~x~0 0)} [71] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_13 v_main_~x~0_Out_26))) (or (and (= v_main_~y~0_Out_26 0) (= |v_main_#t~post6_Out_26| 0) (= v_main_~y~0_Out_26 v_main_~y~0_In_13) .cse0 (< (mod (+ 4294967295 v_main_~x~0_Out_26) 4294967296) 500000)) (and .cse0 (= v_main_~y~0_In_13 v_main_~y~0_Out_26)))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_13} OutVars{main_#t~post4=|v_main_#t~post4_Out_26|, main_~y~0=v_main_~y~0_Out_26, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {3443#(= main_~x~0 0)} is VALID [2022-04-15 12:48:25,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {3443#(= main_~x~0 0)} [70] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {3439#false} is VALID [2022-04-15 12:48:25,097 INFO L272 TraceCheckUtils]: 8: Hoare triple {3439#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {3439#false} is VALID [2022-04-15 12:48:25,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {3439#false} ~cond := #in~cond; {3439#false} is VALID [2022-04-15 12:48:25,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {3439#false} assume 0 == ~cond; {3439#false} is VALID [2022-04-15 12:48:25,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {3439#false} assume !false; {3439#false} is VALID [2022-04-15 12:48:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:25,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:25,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59451019] [2022-04-15 12:48:25,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59451019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:25,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:25,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:25,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:25,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1172997405] [2022-04-15 12:48:25,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1172997405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:25,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:25,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:48:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995454781] [2022-04-15 12:48:25,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:25,466 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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 50 [2022-04-15 12:48:25,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:25,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:25,504 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 12:48:25,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:48:25,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:48:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:48:25,505 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:26,600 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-04-15 12:48:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:48:26,601 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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 50 [2022-04-15 12:48:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2022-04-15 12:48:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2022-04-15 12:48:26,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 68 transitions. [2022-04-15 12:48:26,672 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 12:48:26,675 INFO L225 Difference]: With dead ends: 64 [2022-04-15 12:48:26,675 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 12:48:26,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 27 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:48:26,679 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:26,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 84 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:48:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 12:48:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-15 12:48:26,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:26,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,687 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,687 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:26,688 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-04-15 12:48:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-04-15 12:48:26,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:26,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:26,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 12:48:26,689 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 12:48:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:26,689 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-04-15 12:48:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-04-15 12:48:26,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:26,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:26,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:26,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-04-15 12:48:26,691 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-04-15 12:48:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:26,691 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-04-15 12:48:26,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:26,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 56 transitions. [2022-04-15 12:48:26,761 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 12:48:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-15 12:48:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 12:48:26,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:26,763 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:26,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 12:48:26,763 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash 467427011, now seen corresponding path program 14 times [2022-04-15 12:48:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:26,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [43161605] [2022-04-15 12:48:26,880 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash -440783984, now seen corresponding path program 1 times [2022-04-15 12:48:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:26,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283511942] [2022-04-15 12:48:26,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:26,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {3844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3838#true} is VALID [2022-04-15 12:48:26,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {3838#true} assume true; {3838#true} is VALID [2022-04-15 12:48:26,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3838#true} {3838#true} #41#return; {3838#true} is VALID [2022-04-15 12:48:26,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {3838#true} call ULTIMATE.init(); {3844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:26,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {3844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3838#true} is VALID [2022-04-15 12:48:26,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#true} assume true; {3838#true} is VALID [2022-04-15 12:48:26,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#true} {3838#true} #41#return; {3838#true} is VALID [2022-04-15 12:48:26,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#true} call #t~ret7 := main(); {3838#true} is VALID [2022-04-15 12:48:26,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {3838#true} ~x~0 := 0;~y~0 := 0; {3843#(= main_~x~0 0)} is VALID [2022-04-15 12:48:26,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {3843#(= main_~x~0 0)} [73] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_14 v_main_~x~0_Out_28))) (or (and (= |v_main_#t~post6_Out_28| 0) (< (mod (+ 4294967295 v_main_~x~0_Out_28) 4294967296) 500000) .cse0 (= v_main_~y~0_Out_28 v_main_~y~0_In_14) (= v_main_~y~0_Out_28 0)) (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) .cse0))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_14} OutVars{main_#t~post4=|v_main_#t~post4_Out_28|, main_~y~0=v_main_~y~0_Out_28, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {3843#(= main_~x~0 0)} is VALID [2022-04-15 12:48:26,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {3843#(= main_~x~0 0)} [72] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {3839#false} is VALID [2022-04-15 12:48:26,916 INFO L272 TraceCheckUtils]: 8: Hoare triple {3839#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {3839#false} is VALID [2022-04-15 12:48:26,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {3839#false} ~cond := #in~cond; {3839#false} is VALID [2022-04-15 12:48:26,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {3839#false} assume 0 == ~cond; {3839#false} is VALID [2022-04-15 12:48:26,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {3839#false} assume !false; {3839#false} is VALID [2022-04-15 12:48:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:26,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:26,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283511942] [2022-04-15 12:48:26,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283511942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:26,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:26,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:27,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:27,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [43161605] [2022-04-15 12:48:27,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [43161605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:27,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:27,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:48:27,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638568495] [2022-04-15 12:48:27,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:27,322 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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 53 [2022-04-15 12:48:27,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:27,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:27,365 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 12:48:27,365 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:48:27,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:27,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:48:27,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:48:27,366 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:28,686 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-15 12:48:28,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:48:28,687 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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 53 [2022-04-15 12:48:28,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-15 12:48:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-15 12:48:28,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 71 transitions. [2022-04-15 12:48:28,769 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 12:48:28,770 INFO L225 Difference]: With dead ends: 67 [2022-04-15 12:48:28,771 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:48:28,771 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 29 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:48:28,772 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:28,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 89 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:48:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:48:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-15 12:48:28,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:28,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:28,779 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:28,779 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:28,780 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-04-15 12:48:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 12:48:28,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:28,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:28,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:48:28,781 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:48:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:28,782 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-04-15 12:48:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 12:48:28,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:28,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:28,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:28,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2022-04-15 12:48:28,783 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2022-04-15 12:48:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:28,784 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2022-04-15 12:48:28,784 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:28,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 59 transitions. [2022-04-15 12:48:28,864 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 12:48:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2022-04-15 12:48:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 12:48:28,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:28,865 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:28,865 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 12:48:28,865 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash -876062581, now seen corresponding path program 15 times [2022-04-15 12:48:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:28,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2105660470] [2022-04-15 12:48:29,019 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:29,020 INFO L85 PathProgramCache]: Analyzing trace with hash -381678640, now seen corresponding path program 1 times [2022-04-15 12:48:29,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:29,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014847334] [2022-04-15 12:48:29,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:29,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:29,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {4265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4259#true} is VALID [2022-04-15 12:48:29,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-15 12:48:29,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4259#true} {4259#true} #41#return; {4259#true} is VALID [2022-04-15 12:48:29,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {4259#true} call ULTIMATE.init(); {4265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:29,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {4265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4259#true} is VALID [2022-04-15 12:48:29,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-15 12:48:29,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4259#true} {4259#true} #41#return; {4259#true} is VALID [2022-04-15 12:48:29,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {4259#true} call #t~ret7 := main(); {4259#true} is VALID [2022-04-15 12:48:29,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {4259#true} ~x~0 := 0;~y~0 := 0; {4264#(= main_~x~0 0)} is VALID [2022-04-15 12:48:29,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {4264#(= main_~x~0 0)} [75] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) (or (and (= v_main_~y~0_Out_30 v_main_~y~0_In_15) (< (mod (+ 4294967295 v_main_~x~0_Out_30) 4294967296) 500000) (= |v_main_#t~post6_Out_30| 0) (= v_main_~y~0_Out_30 0) .cse0) (and (= v_main_~y~0_In_15 v_main_~y~0_Out_30) .cse0))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_15} OutVars{main_#t~post4=|v_main_#t~post4_Out_30|, main_~y~0=v_main_~y~0_Out_30, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {4264#(= main_~x~0 0)} is VALID [2022-04-15 12:48:29,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {4264#(= main_~x~0 0)} [74] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {4260#false} is VALID [2022-04-15 12:48:29,064 INFO L272 TraceCheckUtils]: 8: Hoare triple {4260#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {4260#false} is VALID [2022-04-15 12:48:29,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {4260#false} ~cond := #in~cond; {4260#false} is VALID [2022-04-15 12:48:29,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {4260#false} assume 0 == ~cond; {4260#false} is VALID [2022-04-15 12:48:29,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {4260#false} assume !false; {4260#false} is VALID [2022-04-15 12:48:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:29,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:29,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014847334] [2022-04-15 12:48:29,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014847334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:29,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:29,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:29,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:29,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2105660470] [2022-04-15 12:48:29,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2105660470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:29,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:29,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:48:29,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816786128] [2022-04-15 12:48:29,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:29,560 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 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 56 [2022-04-15 12:48:29,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:29,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:29,606 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 12:48:29,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:48:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:29,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:48:29,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:48:29,607 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:31,095 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-04-15 12:48:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:48:31,095 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 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 56 [2022-04-15 12:48:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 74 transitions. [2022-04-15 12:48:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 74 transitions. [2022-04-15 12:48:31,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 74 transitions. [2022-04-15 12:48:31,186 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 12:48:31,187 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:48:31,187 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 12:48:31,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 8 SyntacticMatches, 31 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:48:31,188 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:31,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 94 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:48:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 12:48:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-04-15 12:48:31,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:31,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:31,196 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:31,196 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:31,197 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-04-15 12:48:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-04-15 12:48:31,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:31,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:31,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 12:48:31,198 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 12:48:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:31,199 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-04-15 12:48:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-04-15 12:48:31,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:31,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:31,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:31,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-15 12:48:31,201 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2022-04-15 12:48:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:31,201 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-15 12:48:31,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:31,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-15 12:48:31,275 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 12:48:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 12:48:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 12:48:31,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:31,276 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:31,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 12:48:31,276 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:31,277 INFO L85 PathProgramCache]: Analyzing trace with hash 25733571, now seen corresponding path program 16 times [2022-04-15 12:48:31,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:31,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [434186994] [2022-04-15 12:48:31,438 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:31,439 INFO L85 PathProgramCache]: Analyzing trace with hash -322573296, now seen corresponding path program 1 times [2022-04-15 12:48:31,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:31,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979557496] [2022-04-15 12:48:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:31,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:31,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {4707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4701#true} is VALID [2022-04-15 12:48:31,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {4701#true} assume true; {4701#true} is VALID [2022-04-15 12:48:31,476 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4701#true} {4701#true} #41#return; {4701#true} is VALID [2022-04-15 12:48:31,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {4701#true} call ULTIMATE.init(); {4707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:31,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {4707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4701#true} is VALID [2022-04-15 12:48:31,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {4701#true} assume true; {4701#true} is VALID [2022-04-15 12:48:31,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4701#true} {4701#true} #41#return; {4701#true} is VALID [2022-04-15 12:48:31,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {4701#true} call #t~ret7 := main(); {4701#true} is VALID [2022-04-15 12:48:31,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {4701#true} ~x~0 := 0;~y~0 := 0; {4706#(= main_~x~0 0)} is VALID [2022-04-15 12:48:31,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {4706#(= main_~x~0 0)} [77] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_16 v_main_~x~0_Out_32))) (or (and .cse0 (= v_main_~y~0_Out_32 0) (= |v_main_#t~post6_Out_32| 0) (= v_main_~y~0_Out_32 v_main_~y~0_In_16) (< (mod (+ 4294967295 v_main_~x~0_Out_32) 4294967296) 500000)) (and .cse0 (= v_main_~y~0_In_16 v_main_~y~0_Out_32)))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_16} OutVars{main_#t~post4=|v_main_#t~post4_Out_32|, main_~y~0=v_main_~y~0_Out_32, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {4706#(= main_~x~0 0)} is VALID [2022-04-15 12:48:31,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {4706#(= main_~x~0 0)} [76] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {4702#false} is VALID [2022-04-15 12:48:31,485 INFO L272 TraceCheckUtils]: 8: Hoare triple {4702#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {4702#false} is VALID [2022-04-15 12:48:31,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {4702#false} ~cond := #in~cond; {4702#false} is VALID [2022-04-15 12:48:31,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {4702#false} assume 0 == ~cond; {4702#false} is VALID [2022-04-15 12:48:31,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {4702#false} assume !false; {4702#false} is VALID [2022-04-15 12:48:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:31,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:31,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979557496] [2022-04-15 12:48:31,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979557496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:31,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:31,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:31,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:31,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [434186994] [2022-04-15 12:48:31,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [434186994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:31,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:31,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:48:31,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904408379] [2022-04-15 12:48:31,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:31,968 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 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 59 [2022-04-15 12:48:31,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:31,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:32,029 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 12:48:32,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:48:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:32,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:48:32,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:48:32,030 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:33,657 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-15 12:48:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:48:33,657 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 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 59 [2022-04-15 12:48:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-04-15 12:48:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-04-15 12:48:33,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 77 transitions. [2022-04-15 12:48:33,748 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 12:48:33,749 INFO L225 Difference]: With dead ends: 73 [2022-04-15 12:48:33,749 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 12:48:33,749 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 8 SyntacticMatches, 33 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:48:33,750 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:33,750 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 99 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:48:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 12:48:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-04-15 12:48:33,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:33,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,761 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,761 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:33,762 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-04-15 12:48:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-15 12:48:33,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:33,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:33,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 12:48:33,763 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 12:48:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:33,764 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-04-15 12:48:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-15 12:48:33,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:33,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:33,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:33,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-04-15 12:48:33,766 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 59 [2022-04-15 12:48:33,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:33,766 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-04-15 12:48:33,766 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 65 transitions. [2022-04-15 12:48:33,844 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 12:48:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-04-15 12:48:33,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 12:48:33,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:33,845 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:33,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 12:48:33,845 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:33,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash 414461323, now seen corresponding path program 17 times [2022-04-15 12:48:33,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:33,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1981728454] [2022-04-15 12:48:33,993 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash -263467952, now seen corresponding path program 1 times [2022-04-15 12:48:33,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:33,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013749874] [2022-04-15 12:48:33,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:33,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:34,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {5170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5164#true} is VALID [2022-04-15 12:48:34,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {5164#true} assume true; {5164#true} is VALID [2022-04-15 12:48:34,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5164#true} {5164#true} #41#return; {5164#true} is VALID [2022-04-15 12:48:34,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {5164#true} call ULTIMATE.init(); {5170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:34,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {5170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5164#true} is VALID [2022-04-15 12:48:34,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2022-04-15 12:48:34,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5164#true} #41#return; {5164#true} is VALID [2022-04-15 12:48:34,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {5164#true} call #t~ret7 := main(); {5164#true} is VALID [2022-04-15 12:48:34,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {5164#true} ~x~0 := 0;~y~0 := 0; {5169#(= main_~x~0 0)} is VALID [2022-04-15 12:48:34,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {5169#(= main_~x~0 0)} [79] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_17 v_main_~x~0_Out_34))) (or (and (< (mod (+ 4294967295 v_main_~x~0_Out_34) 4294967296) 500000) .cse0 (= |v_main_#t~post6_Out_34| 0) (= v_main_~y~0_Out_34 0) (= v_main_~y~0_Out_34 v_main_~y~0_In_17)) (and .cse0 (= v_main_~y~0_In_17 v_main_~y~0_Out_34)))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_17} OutVars{main_#t~post4=|v_main_#t~post4_Out_34|, main_~y~0=v_main_~y~0_Out_34, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {5169#(= main_~x~0 0)} is VALID [2022-04-15 12:48:34,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {5169#(= main_~x~0 0)} [78] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {5165#false} is VALID [2022-04-15 12:48:34,033 INFO L272 TraceCheckUtils]: 8: Hoare triple {5165#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {5165#false} is VALID [2022-04-15 12:48:34,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {5165#false} ~cond := #in~cond; {5165#false} is VALID [2022-04-15 12:48:34,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {5165#false} assume 0 == ~cond; {5165#false} is VALID [2022-04-15 12:48:34,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {5165#false} assume !false; {5165#false} is VALID [2022-04-15 12:48:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:34,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:34,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013749874] [2022-04-15 12:48:34,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013749874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:34,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:34,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:34,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:34,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1981728454] [2022-04-15 12:48:34,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1981728454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:34,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:34,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:48:34,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417120468] [2022-04-15 12:48:34,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:34,558 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 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 62 [2022-04-15 12:48:34,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:34,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:34,617 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 12:48:34,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:48:34,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:34,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:48:34,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:48:34,618 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:36,458 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-15 12:48:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:48:36,459 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 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 62 [2022-04-15 12:48:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-15 12:48:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-15 12:48:36,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 80 transitions. [2022-04-15 12:48:36,553 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 12:48:36,554 INFO L225 Difference]: With dead ends: 76 [2022-04-15 12:48:36,555 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 12:48:36,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 35 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:48:36,556 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:36,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 104 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:48:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 12:48:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-04-15 12:48:36,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:36,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,568 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,568 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:36,569 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2022-04-15 12:48:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-04-15 12:48:36,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:36,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:36,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 12:48:36,569 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 12:48:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:36,571 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2022-04-15 12:48:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-04-15 12:48:36,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:36,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:36,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:36,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-15 12:48:36,572 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2022-04-15 12:48:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:36,573 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-15 12:48:36,573 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-15 12:48:36,667 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 12:48:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-15 12:48:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 12:48:36,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:36,670 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:36,670 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 12:48:36,671 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:36,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:36,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1771091139, now seen corresponding path program 18 times [2022-04-15 12:48:36,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:36,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342697376] [2022-04-15 12:48:36,826 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:36,827 INFO L85 PathProgramCache]: Analyzing trace with hash -204362608, now seen corresponding path program 1 times [2022-04-15 12:48:36,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:36,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130895286] [2022-04-15 12:48:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:36,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:36,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:36,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {5654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5648#true} is VALID [2022-04-15 12:48:36,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {5648#true} assume true; {5648#true} is VALID [2022-04-15 12:48:36,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5648#true} {5648#true} #41#return; {5648#true} is VALID [2022-04-15 12:48:36,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {5648#true} call ULTIMATE.init(); {5654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:36,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {5654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5648#true} is VALID [2022-04-15 12:48:36,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {5648#true} assume true; {5648#true} is VALID [2022-04-15 12:48:36,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5648#true} {5648#true} #41#return; {5648#true} is VALID [2022-04-15 12:48:36,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {5648#true} call #t~ret7 := main(); {5648#true} is VALID [2022-04-15 12:48:36,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {5648#true} ~x~0 := 0;~y~0 := 0; {5653#(= main_~x~0 0)} is VALID [2022-04-15 12:48:36,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {5653#(= main_~x~0 0)} [81] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_18 v_main_~x~0_Out_36))) (or (and .cse0 (= v_main_~y~0_Out_36 0) (= |v_main_#t~post6_Out_36| 0) (< (mod (+ 4294967295 v_main_~x~0_Out_36) 4294967296) 500000) (= v_main_~y~0_Out_36 v_main_~y~0_In_18)) (and .cse0 (= v_main_~y~0_In_18 v_main_~y~0_Out_36)))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_18} OutVars{main_#t~post4=|v_main_#t~post4_Out_36|, main_~y~0=v_main_~y~0_Out_36, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {5653#(= main_~x~0 0)} is VALID [2022-04-15 12:48:36,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {5653#(= main_~x~0 0)} [80] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {5649#false} is VALID [2022-04-15 12:48:36,863 INFO L272 TraceCheckUtils]: 8: Hoare triple {5649#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {5649#false} is VALID [2022-04-15 12:48:36,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {5649#false} ~cond := #in~cond; {5649#false} is VALID [2022-04-15 12:48:36,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {5649#false} assume 0 == ~cond; {5649#false} is VALID [2022-04-15 12:48:36,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {5649#false} assume !false; {5649#false} is VALID [2022-04-15 12:48:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:36,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:36,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130895286] [2022-04-15 12:48:36,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130895286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:36,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:36,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:37,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:37,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342697376] [2022-04-15 12:48:37,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342697376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:37,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:37,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:48:37,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549218101] [2022-04-15 12:48:37,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:37,425 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 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 65 [2022-04-15 12:48:37,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:37,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:37,488 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 12:48:37,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:48:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:48:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:48:37,489 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:39,558 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-04-15 12:48:39,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:48:39,558 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 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 65 [2022-04-15 12:48:39,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 83 transitions. [2022-04-15 12:48:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 83 transitions. [2022-04-15 12:48:39,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 83 transitions. [2022-04-15 12:48:39,647 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 12:48:39,648 INFO L225 Difference]: With dead ends: 79 [2022-04-15 12:48:39,648 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 12:48:39,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 8 SyntacticMatches, 37 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:48:39,649 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:39,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 109 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:48:39,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 12:48:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-04-15 12:48:39,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:39,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,657 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,658 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:39,658 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2022-04-15 12:48:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-15 12:48:39,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:39,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:39,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 12:48:39,659 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 12:48:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:39,660 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2022-04-15 12:48:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-15 12:48:39,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:39,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:39,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:39,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-04-15 12:48:39,661 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 65 [2022-04-15 12:48:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:39,661 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-04-15 12:48:39,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 71 transitions. [2022-04-15 12:48:39,760 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 12:48:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 12:48:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 12:48:39,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:39,761 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:39,761 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 12:48:39,761 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:39,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:39,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1487684235, now seen corresponding path program 19 times [2022-04-15 12:48:39,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:39,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [261146463] [2022-04-15 12:48:39,912 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:39,913 INFO L85 PathProgramCache]: Analyzing trace with hash -145257264, now seen corresponding path program 1 times [2022-04-15 12:48:39,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:39,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685596793] [2022-04-15 12:48:39,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:39,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:39,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:39,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {6159#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6153#true} is VALID [2022-04-15 12:48:39,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {6153#true} assume true; {6153#true} is VALID [2022-04-15 12:48:39,947 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6153#true} {6153#true} #41#return; {6153#true} is VALID [2022-04-15 12:48:39,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {6153#true} call ULTIMATE.init(); {6159#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:39,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {6159#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6153#true} is VALID [2022-04-15 12:48:39,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {6153#true} assume true; {6153#true} is VALID [2022-04-15 12:48:39,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6153#true} {6153#true} #41#return; {6153#true} is VALID [2022-04-15 12:48:39,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {6153#true} call #t~ret7 := main(); {6153#true} is VALID [2022-04-15 12:48:39,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {6153#true} ~x~0 := 0;~y~0 := 0; {6158#(= main_~x~0 0)} is VALID [2022-04-15 12:48:39,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {6158#(= main_~x~0 0)} [83] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_19 v_main_~x~0_Out_38))) (or (and .cse0 (< (mod (+ 4294967295 v_main_~x~0_Out_38) 4294967296) 500000) (= |v_main_#t~post6_Out_38| 0) (= v_main_~y~0_Out_38 0) (= v_main_~y~0_Out_38 v_main_~y~0_In_19)) (and .cse0 (= v_main_~y~0_In_19 v_main_~y~0_Out_38)))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_19} OutVars{main_#t~post4=|v_main_#t~post4_Out_38|, main_~y~0=v_main_~y~0_Out_38, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {6158#(= main_~x~0 0)} is VALID [2022-04-15 12:48:39,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {6158#(= main_~x~0 0)} [82] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {6154#false} is VALID [2022-04-15 12:48:39,949 INFO L272 TraceCheckUtils]: 8: Hoare triple {6154#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {6154#false} is VALID [2022-04-15 12:48:39,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {6154#false} ~cond := #in~cond; {6154#false} is VALID [2022-04-15 12:48:39,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {6154#false} assume 0 == ~cond; {6154#false} is VALID [2022-04-15 12:48:39,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {6154#false} assume !false; {6154#false} is VALID [2022-04-15 12:48:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:39,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685596793] [2022-04-15 12:48:39,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685596793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:39,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:39,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:40,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:40,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [261146463] [2022-04-15 12:48:40,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [261146463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:40,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:40,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:48:40,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46219501] [2022-04-15 12:48:40,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:40,556 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 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 68 [2022-04-15 12:48:40,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:40,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:40,628 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 12:48:40,628 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:48:40,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:40,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:48:40,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:48:40,629 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:42,988 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-04-15 12:48:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:48:42,989 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 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 68 [2022-04-15 12:48:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 86 transitions. [2022-04-15 12:48:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 86 transitions. [2022-04-15 12:48:42,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 86 transitions. [2022-04-15 12:48:43,113 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 12:48:43,114 INFO L225 Difference]: With dead ends: 82 [2022-04-15 12:48:43,114 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 12:48:43,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 8 SyntacticMatches, 39 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:48:43,115 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:43,115 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 114 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 12:48:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 12:48:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-15 12:48:43,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:43,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:43,125 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:43,125 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:43,126 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-15 12:48:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-04-15 12:48:43,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:43,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:43,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 12:48:43,127 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 12:48:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:43,128 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-15 12:48:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-04-15 12:48:43,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:43,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:43,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:43,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-04-15 12:48:43,130 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2022-04-15 12:48:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:43,130 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-04-15 12:48:43,130 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:43,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 74 transitions. [2022-04-15 12:48:43,245 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 12:48:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-04-15 12:48:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 12:48:43,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:43,246 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:43,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 12:48:43,246 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:43,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1876656189, now seen corresponding path program 20 times [2022-04-15 12:48:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:43,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1602124557] [2022-04-15 12:48:43,443 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:43,444 INFO L85 PathProgramCache]: Analyzing trace with hash -86151920, now seen corresponding path program 1 times [2022-04-15 12:48:43,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:43,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302833187] [2022-04-15 12:48:43,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:43,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:43,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:43,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {6685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6679#true} is VALID [2022-04-15 12:48:43,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {6679#true} assume true; {6679#true} is VALID [2022-04-15 12:48:43,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6679#true} {6679#true} #41#return; {6679#true} is VALID [2022-04-15 12:48:43,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {6679#true} call ULTIMATE.init(); {6685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:43,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {6685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6679#true} is VALID [2022-04-15 12:48:43,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {6679#true} assume true; {6679#true} is VALID [2022-04-15 12:48:43,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6679#true} {6679#true} #41#return; {6679#true} is VALID [2022-04-15 12:48:43,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {6679#true} call #t~ret7 := main(); {6679#true} is VALID [2022-04-15 12:48:43,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {6679#true} ~x~0 := 0;~y~0 := 0; {6684#(= main_~x~0 0)} is VALID [2022-04-15 12:48:43,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {6684#(= main_~x~0 0)} [85] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_20 v_main_~x~0_Out_40))) (or (and .cse0 (= v_main_~y~0_In_20 v_main_~y~0_Out_40)) (and (= v_main_~y~0_Out_40 0) (< (mod (+ 4294967295 v_main_~x~0_Out_40) 4294967296) 500000) .cse0 (= v_main_~y~0_Out_40 v_main_~y~0_In_20) (= |v_main_#t~post6_Out_40| 0)))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_20} OutVars{main_#t~post4=|v_main_#t~post4_Out_40|, main_~y~0=v_main_~y~0_Out_40, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {6684#(= main_~x~0 0)} is VALID [2022-04-15 12:48:43,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {6684#(= main_~x~0 0)} [84] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {6680#false} is VALID [2022-04-15 12:48:43,484 INFO L272 TraceCheckUtils]: 8: Hoare triple {6680#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {6680#false} is VALID [2022-04-15 12:48:43,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {6680#false} ~cond := #in~cond; {6680#false} is VALID [2022-04-15 12:48:43,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {6680#false} assume 0 == ~cond; {6680#false} is VALID [2022-04-15 12:48:43,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {6680#false} assume !false; {6680#false} is VALID [2022-04-15 12:48:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:43,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:43,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302833187] [2022-04-15 12:48:43,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302833187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:43,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:43,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:44,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:44,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1602124557] [2022-04-15 12:48:44,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1602124557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:44,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:44,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:48:44,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715807629] [2022-04-15 12:48:44,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 71 [2022-04-15 12:48:44,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:44,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:44,226 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 12:48:44,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:48:44,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:44,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:48:44,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:48:44,227 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:46,897 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-04-15 12:48:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:48:46,898 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 71 [2022-04-15 12:48:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 89 transitions. [2022-04-15 12:48:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 89 transitions. [2022-04-15 12:48:46,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 89 transitions. [2022-04-15 12:48:47,029 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 12:48:47,030 INFO L225 Difference]: With dead ends: 85 [2022-04-15 12:48:47,030 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 12:48:47,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 8 SyntacticMatches, 41 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:48:47,031 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 53 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:47,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 119 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 12:48:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 12:48:47,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2022-04-15 12:48:47,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:47,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:47,040 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:47,041 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:47,042 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-15 12:48:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 12:48:47,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:47,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:47,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 12:48:47,042 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 12:48:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:47,044 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-15 12:48:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 12:48:47,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:47,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:47,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:47,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2022-04-15 12:48:47,045 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2022-04-15 12:48:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:47,046 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2022-04-15 12:48:47,046 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:47,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 77 transitions. [2022-04-15 12:48:47,159 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 12:48:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-04-15 12:48:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 12:48:47,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:47,163 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:47,164 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 12:48:47,164 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:47,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1585408117, now seen corresponding path program 21 times [2022-04-15 12:48:47,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:47,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [698657510] [2022-04-15 12:48:47,325 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:47,327 INFO L85 PathProgramCache]: Analyzing trace with hash -27046576, now seen corresponding path program 1 times [2022-04-15 12:48:47,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:47,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919660168] [2022-04-15 12:48:47,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:47,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:47,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {7232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7226#true} is VALID [2022-04-15 12:48:47,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {7226#true} assume true; {7226#true} is VALID [2022-04-15 12:48:47,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7226#true} {7226#true} #41#return; {7226#true} is VALID [2022-04-15 12:48:47,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {7226#true} call ULTIMATE.init(); {7232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:47,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {7232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7226#true} is VALID [2022-04-15 12:48:47,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {7226#true} assume true; {7226#true} is VALID [2022-04-15 12:48:47,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7226#true} {7226#true} #41#return; {7226#true} is VALID [2022-04-15 12:48:47,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {7226#true} call #t~ret7 := main(); {7226#true} is VALID [2022-04-15 12:48:47,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {7226#true} ~x~0 := 0;~y~0 := 0; {7231#(= main_~x~0 0)} is VALID [2022-04-15 12:48:47,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {7231#(= main_~x~0 0)} [87] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_21 v_main_~x~0_Out_42))) (or (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) .cse0) (and (= v_main_~y~0_Out_42 0) (< (mod (+ 4294967295 v_main_~x~0_Out_42) 4294967296) 500000) (= v_main_~y~0_Out_42 v_main_~y~0_In_21) .cse0 (= |v_main_#t~post6_Out_42| 0)))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_21} OutVars{main_#t~post4=|v_main_#t~post4_Out_42|, main_~y~0=v_main_~y~0_Out_42, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {7231#(= main_~x~0 0)} is VALID [2022-04-15 12:48:47,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {7231#(= main_~x~0 0)} [86] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {7227#false} is VALID [2022-04-15 12:48:47,354 INFO L272 TraceCheckUtils]: 8: Hoare triple {7227#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {7227#false} is VALID [2022-04-15 12:48:47,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {7227#false} ~cond := #in~cond; {7227#false} is VALID [2022-04-15 12:48:47,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {7227#false} assume 0 == ~cond; {7227#false} is VALID [2022-04-15 12:48:47,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {7227#false} assume !false; {7227#false} is VALID [2022-04-15 12:48:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:47,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:47,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919660168] [2022-04-15 12:48:47,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919660168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:47,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:47,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:48,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:48,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [698657510] [2022-04-15 12:48:48,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [698657510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:48,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:48,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:48:48,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692981436] [2022-04-15 12:48:48,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:48,079 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 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 74 [2022-04-15 12:48:48,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:48,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:48,166 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 12:48:48,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:48:48,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:48,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:48:48,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:48:48,167 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:51,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:51,178 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-15 12:48:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:48:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 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 74 [2022-04-15 12:48:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 92 transitions. [2022-04-15 12:48:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 92 transitions. [2022-04-15 12:48:51,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 92 transitions. [2022-04-15 12:48:51,337 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 12:48:51,338 INFO L225 Difference]: With dead ends: 88 [2022-04-15 12:48:51,338 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 12:48:51,339 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 43 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:48:51,340 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:51,340 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 124 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 12:48:51,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 12:48:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-15 12:48:51,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:51,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:51,349 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:51,350 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:51,351 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 12:48:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 12:48:51,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:51,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:51,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-15 12:48:51,351 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-15 12:48:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:51,352 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 12:48:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 12:48:51,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:51,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:51,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:51,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-15 12:48:51,354 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-04-15 12:48:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:51,354 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-15 12:48:51,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:51,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-15 12:48:51,512 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 12:48:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 12:48:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 12:48:51,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:51,513 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:51,513 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 12:48:51,513 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash -848033085, now seen corresponding path program 22 times [2022-04-15 12:48:51,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:51,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1493542185] [2022-04-15 12:48:51,688 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash 32058768, now seen corresponding path program 1 times [2022-04-15 12:48:51,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:51,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249084659] [2022-04-15 12:48:51,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:51,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:51,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:51,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {7800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7794#true} is VALID [2022-04-15 12:48:51,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {7794#true} assume true; {7794#true} is VALID [2022-04-15 12:48:51,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7794#true} {7794#true} #41#return; {7794#true} is VALID [2022-04-15 12:48:51,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {7794#true} call ULTIMATE.init(); {7800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:51,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {7800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7794#true} is VALID [2022-04-15 12:48:51,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {7794#true} assume true; {7794#true} is VALID [2022-04-15 12:48:51,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7794#true} {7794#true} #41#return; {7794#true} is VALID [2022-04-15 12:48:51,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {7794#true} call #t~ret7 := main(); {7794#true} is VALID [2022-04-15 12:48:51,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {7794#true} ~x~0 := 0;~y~0 := 0; {7799#(= main_~x~0 0)} is VALID [2022-04-15 12:48:51,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {7799#(= main_~x~0 0)} [89] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_22 v_main_~x~0_Out_44))) (or (and .cse0 (= |v_main_#t~post6_Out_44| 0) (< (mod (+ 4294967295 v_main_~x~0_Out_44) 4294967296) 500000) (= v_main_~y~0_Out_44 0) (= v_main_~y~0_Out_44 v_main_~y~0_In_22)) (and (= v_main_~y~0_In_22 v_main_~y~0_Out_44) .cse0))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_22} OutVars{main_#t~post4=|v_main_#t~post4_Out_44|, main_~y~0=v_main_~y~0_Out_44, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {7799#(= main_~x~0 0)} is VALID [2022-04-15 12:48:51,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {7799#(= main_~x~0 0)} [88] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {7795#false} is VALID [2022-04-15 12:48:51,719 INFO L272 TraceCheckUtils]: 8: Hoare triple {7795#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {7795#false} is VALID [2022-04-15 12:48:51,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {7795#false} ~cond := #in~cond; {7795#false} is VALID [2022-04-15 12:48:51,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {7795#false} assume 0 == ~cond; {7795#false} is VALID [2022-04-15 12:48:51,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {7795#false} assume !false; {7795#false} is VALID [2022-04-15 12:48:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:51,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:51,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249084659] [2022-04-15 12:48:51,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249084659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:51,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:51,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:52,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:52,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1493542185] [2022-04-15 12:48:52,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1493542185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:52,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:52,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:48:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68671290] [2022-04-15 12:48:52,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:52,462 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 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 77 [2022-04-15 12:48:52,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:52,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:52,559 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 12:48:52,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:48:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:52,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:48:52,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:48:52,561 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:56,010 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-15 12:48:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:48:56,010 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 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 77 [2022-04-15 12:48:56,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 95 transitions. [2022-04-15 12:48:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 95 transitions. [2022-04-15 12:48:56,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 95 transitions. [2022-04-15 12:48:56,162 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 12:48:56,163 INFO L225 Difference]: With dead ends: 91 [2022-04-15 12:48:56,163 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 12:48:56,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 8 SyntacticMatches, 45 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 12:48:56,164 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:56,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 129 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 12:48:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 12:48:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2022-04-15 12:48:56,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:56,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:56,175 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:56,175 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:56,176 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2022-04-15 12:48:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-04-15 12:48:56,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:56,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:56,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 12:48:56,177 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 12:48:56,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:56,178 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2022-04-15 12:48:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-04-15 12:48:56,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:56,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:56,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:56,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2022-04-15 12:48:56,180 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 77 [2022-04-15 12:48:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:56,180 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2022-04-15 12:48:56,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:56,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 83 transitions. [2022-04-15 12:48:56,311 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 12:48:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2022-04-15 12:48:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 12:48:56,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:56,312 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:56,312 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 12:48:56,312 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:56,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:56,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1828793483, now seen corresponding path program 23 times [2022-04-15 12:48:56,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:56,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [15328301] [2022-04-15 12:48:56,471 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:56,472 INFO L85 PathProgramCache]: Analyzing trace with hash 91164112, now seen corresponding path program 1 times [2022-04-15 12:48:56,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:56,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118866285] [2022-04-15 12:48:56,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:56,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:56,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:56,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {8389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8383#true} is VALID [2022-04-15 12:48:56,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {8383#true} assume true; {8383#true} is VALID [2022-04-15 12:48:56,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8383#true} {8383#true} #41#return; {8383#true} is VALID [2022-04-15 12:48:56,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {8383#true} call ULTIMATE.init(); {8389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:56,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {8389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8383#true} is VALID [2022-04-15 12:48:56,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {8383#true} assume true; {8383#true} is VALID [2022-04-15 12:48:56,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8383#true} {8383#true} #41#return; {8383#true} is VALID [2022-04-15 12:48:56,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {8383#true} call #t~ret7 := main(); {8383#true} is VALID [2022-04-15 12:48:56,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {8383#true} ~x~0 := 0;~y~0 := 0; {8388#(= main_~x~0 0)} is VALID [2022-04-15 12:48:56,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {8388#(= main_~x~0 0)} [91] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_23 v_main_~x~0_Out_46))) (or (and .cse0 (= |v_main_#t~post6_Out_46| 0) (= v_main_~y~0_Out_46 0) (< (mod (+ 4294967295 v_main_~x~0_Out_46) 4294967296) 500000) (= v_main_~y~0_Out_46 v_main_~y~0_In_23)) (and .cse0 (= v_main_~y~0_In_23 v_main_~y~0_Out_46)))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_23} OutVars{main_#t~post4=|v_main_#t~post4_Out_46|, main_~y~0=v_main_~y~0_Out_46, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {8388#(= main_~x~0 0)} is VALID [2022-04-15 12:48:56,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {8388#(= main_~x~0 0)} [90] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {8384#false} is VALID [2022-04-15 12:48:56,504 INFO L272 TraceCheckUtils]: 8: Hoare triple {8384#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {8384#false} is VALID [2022-04-15 12:48:56,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {8384#false} ~cond := #in~cond; {8384#false} is VALID [2022-04-15 12:48:56,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {8384#false} assume 0 == ~cond; {8384#false} is VALID [2022-04-15 12:48:56,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {8384#false} assume !false; {8384#false} is VALID [2022-04-15 12:48:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:56,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:56,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118866285] [2022-04-15 12:48:56,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118866285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:56,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:56,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:57,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:57,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [15328301] [2022-04-15 12:48:57,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [15328301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:57,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:57,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:48:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750620296] [2022-04-15 12:48:57,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:57,303 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 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 80 [2022-04-15 12:48:57,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:57,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:57,417 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 12:48:57,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:48:57,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:57,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:48:57,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:48:57,419 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:01,239 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-04-15 12:49:01,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:49:01,239 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 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 80 [2022-04-15 12:49:01,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 98 transitions. [2022-04-15 12:49:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 98 transitions. [2022-04-15 12:49:01,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 98 transitions. [2022-04-15 12:49:01,386 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 12:49:01,387 INFO L225 Difference]: With dead ends: 94 [2022-04-15 12:49:01,387 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 12:49:01,388 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 8 SyntacticMatches, 47 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:49:01,388 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 59 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:01,388 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 134 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 12:49:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 12:49:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-04-15 12:49:01,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:01,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:01,396 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:01,396 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:01,397 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2022-04-15 12:49:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2022-04-15 12:49:01,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:01,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:01,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-15 12:49:01,398 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-15 12:49:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:01,399 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2022-04-15 12:49:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2022-04-15 12:49:01,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:01,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:01,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:01,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-04-15 12:49:01,401 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 80 [2022-04-15 12:49:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:01,401 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-04-15 12:49:01,401 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:01,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions. [2022-04-15 12:49:01,536 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 12:49:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 12:49:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 12:49:01,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:01,537 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:01,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 12:49:01,537 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1783671357, now seen corresponding path program 24 times [2022-04-15 12:49:01,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:01,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93548074] [2022-04-15 12:49:01,694 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash 150269456, now seen corresponding path program 1 times [2022-04-15 12:49:01,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:01,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072456690] [2022-04-15 12:49:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:01,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:01,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {8999#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8993#true} is VALID [2022-04-15 12:49:01,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {8993#true} assume true; {8993#true} is VALID [2022-04-15 12:49:01,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8993#true} {8993#true} #41#return; {8993#true} is VALID [2022-04-15 12:49:01,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {8993#true} call ULTIMATE.init(); {8999#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:01,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {8999#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8993#true} is VALID [2022-04-15 12:49:01,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {8993#true} assume true; {8993#true} is VALID [2022-04-15 12:49:01,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8993#true} {8993#true} #41#return; {8993#true} is VALID [2022-04-15 12:49:01,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {8993#true} call #t~ret7 := main(); {8993#true} is VALID [2022-04-15 12:49:01,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {8993#true} ~x~0 := 0;~y~0 := 0; {8998#(= main_~x~0 0)} is VALID [2022-04-15 12:49:01,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {8998#(= main_~x~0 0)} [93] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_24 v_main_~x~0_Out_48))) (or (and .cse0 (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) (and (= v_main_~y~0_Out_48 v_main_~y~0_In_24) .cse0 (= v_main_~y~0_Out_48 0) (< (mod (+ 4294967295 v_main_~x~0_Out_48) 4294967296) 500000) (= |v_main_#t~post6_Out_48| 0)))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_24} OutVars{main_#t~post4=|v_main_#t~post4_Out_48|, main_~y~0=v_main_~y~0_Out_48, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {8998#(= main_~x~0 0)} is VALID [2022-04-15 12:49:01,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {8998#(= main_~x~0 0)} [92] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {8994#false} is VALID [2022-04-15 12:49:01,747 INFO L272 TraceCheckUtils]: 8: Hoare triple {8994#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {8994#false} is VALID [2022-04-15 12:49:01,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {8994#false} ~cond := #in~cond; {8994#false} is VALID [2022-04-15 12:49:01,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {8994#false} assume 0 == ~cond; {8994#false} is VALID [2022-04-15 12:49:01,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {8994#false} assume !false; {8994#false} is VALID [2022-04-15 12:49:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:01,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:01,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072456690] [2022-04-15 12:49:01,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072456690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:01,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:01,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:49:02,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:02,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93548074] [2022-04-15 12:49:02,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93548074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:02,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:02,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:49:02,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687734789] [2022-04-15 12:49:02,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:02,623 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 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 83 [2022-04-15 12:49:02,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:02,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:02,765 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 12:49:02,765 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:49:02,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:02,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:49:02,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:49:02,766 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:07,283 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-04-15 12:49:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:49:07,283 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 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 83 [2022-04-15 12:49:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 101 transitions. [2022-04-15 12:49:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 101 transitions. [2022-04-15 12:49:07,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 101 transitions. [2022-04-15 12:49:07,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:07,542 INFO L225 Difference]: With dead ends: 97 [2022-04-15 12:49:07,542 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 12:49:07,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 8 SyntacticMatches, 49 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 12:49:07,544 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:07,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 139 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 12:49:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 12:49:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-04-15 12:49:07,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:07,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:07,556 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:07,556 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:07,559 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 12:49:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 12:49:07,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:07,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:07,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 12:49:07,560 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 12:49:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:07,561 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 12:49:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 12:49:07,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:07,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:07,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:07,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-04-15 12:49:07,563 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 83 [2022-04-15 12:49:07,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:07,563 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-04-15 12:49:07,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:07,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 89 transitions. [2022-04-15 12:49:07,801 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 12:49:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-04-15 12:49:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 12:49:07,802 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:07,802 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:07,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 12:49:07,803 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:07,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1728183925, now seen corresponding path program 25 times [2022-04-15 12:49:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:07,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [736728193] [2022-04-15 12:49:07,911 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:07,912 INFO L85 PathProgramCache]: Analyzing trace with hash 209374800, now seen corresponding path program 1 times [2022-04-15 12:49:07,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:07,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271655287] [2022-04-15 12:49:07,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:07,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:07,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {9630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9624#true} is VALID [2022-04-15 12:49:07,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {9624#true} assume true; {9624#true} is VALID [2022-04-15 12:49:07,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9624#true} {9624#true} #41#return; {9624#true} is VALID [2022-04-15 12:49:07,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {9624#true} call ULTIMATE.init(); {9630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:07,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {9630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9624#true} is VALID [2022-04-15 12:49:07,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {9624#true} assume true; {9624#true} is VALID [2022-04-15 12:49:07,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9624#true} {9624#true} #41#return; {9624#true} is VALID [2022-04-15 12:49:07,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {9624#true} call #t~ret7 := main(); {9624#true} is VALID [2022-04-15 12:49:07,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {9624#true} ~x~0 := 0;~y~0 := 0; {9629#(= main_~x~0 0)} is VALID [2022-04-15 12:49:07,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {9629#(= main_~x~0 0)} [95] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_25 v_main_~x~0_Out_50))) (or (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) .cse0) (and (< (mod (+ 4294967295 v_main_~x~0_Out_50) 4294967296) 500000) (= |v_main_#t~post6_Out_50| 0) .cse0 (= v_main_~y~0_Out_50 v_main_~y~0_In_25) (= v_main_~y~0_Out_50 0)))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_25} OutVars{main_#t~post4=|v_main_#t~post4_Out_50|, main_~y~0=v_main_~y~0_Out_50, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {9629#(= main_~x~0 0)} is VALID [2022-04-15 12:49:07,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {9629#(= main_~x~0 0)} [94] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {9625#false} is VALID [2022-04-15 12:49:07,943 INFO L272 TraceCheckUtils]: 8: Hoare triple {9625#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {9625#false} is VALID [2022-04-15 12:49:07,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {9625#false} ~cond := #in~cond; {9625#false} is VALID [2022-04-15 12:49:07,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {9625#false} assume 0 == ~cond; {9625#false} is VALID [2022-04-15 12:49:07,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {9625#false} assume !false; {9625#false} is VALID [2022-04-15 12:49:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:07,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:07,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271655287] [2022-04-15 12:49:07,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271655287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:07,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:07,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:49:08,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:08,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [736728193] [2022-04-15 12:49:08,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [736728193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:08,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:08,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:49:08,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210286879] [2022-04-15 12:49:08,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:08,869 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 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 86 [2022-04-15 12:49:08,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:08,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:09,029 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 12:49:09,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:49:09,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:09,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:49:09,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:49:09,030 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:14,118 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-15 12:49:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:49:14,118 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 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 86 [2022-04-15 12:49:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 104 transitions. [2022-04-15 12:49:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 104 transitions. [2022-04-15 12:49:14,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 104 transitions. [2022-04-15 12:49:14,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:14,332 INFO L225 Difference]: With dead ends: 100 [2022-04-15 12:49:14,332 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 12:49:14,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 8 SyntacticMatches, 51 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:49:14,333 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:14,333 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 144 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2211 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 12:49:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 12:49:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-15 12:49:14,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:14,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:14,345 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:14,345 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:14,346 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-04-15 12:49:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-04-15 12:49:14,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:14,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:14,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-15 12:49:14,347 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-15 12:49:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:14,349 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-04-15 12:49:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-04-15 12:49:14,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:14,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:14,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:14,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2022-04-15 12:49:14,351 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2022-04-15 12:49:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:14,351 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2022-04-15 12:49:14,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:14,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 92 transitions. [2022-04-15 12:49:14,642 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 12:49:14,642 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-04-15 12:49:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 12:49:14,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:14,643 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:14,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 12:49:14,643 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:14,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2030461123, now seen corresponding path program 26 times [2022-04-15 12:49:14,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:14,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1525563277] [2022-04-15 12:49:14,848 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:14,849 INFO L85 PathProgramCache]: Analyzing trace with hash 268480144, now seen corresponding path program 1 times [2022-04-15 12:49:14,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:14,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396606446] [2022-04-15 12:49:14,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:14,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:14,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {10282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10276#true} is VALID [2022-04-15 12:49:14,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-15 12:49:14,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10276#true} {10276#true} #41#return; {10276#true} is VALID [2022-04-15 12:49:14,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {10276#true} call ULTIMATE.init(); {10282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:14,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {10282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10276#true} is VALID [2022-04-15 12:49:14,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-15 12:49:14,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10276#true} {10276#true} #41#return; {10276#true} is VALID [2022-04-15 12:49:14,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {10276#true} call #t~ret7 := main(); {10276#true} is VALID [2022-04-15 12:49:14,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {10276#true} ~x~0 := 0;~y~0 := 0; {10281#(= main_~x~0 0)} is VALID [2022-04-15 12:49:14,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {10281#(= main_~x~0 0)} [97] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_26 v_main_~x~0_Out_52))) (or (and .cse0 (= v_main_~y~0_In_26 v_main_~y~0_Out_52)) (and .cse0 (= |v_main_#t~post6_Out_52| 0) (= v_main_~y~0_Out_52 v_main_~y~0_In_26) (= v_main_~y~0_Out_52 0) (< (mod (+ 4294967295 v_main_~x~0_Out_52) 4294967296) 500000)))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_26} OutVars{main_#t~post4=|v_main_#t~post4_Out_52|, main_~y~0=v_main_~y~0_Out_52, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {10281#(= main_~x~0 0)} is VALID [2022-04-15 12:49:14,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {10281#(= main_~x~0 0)} [96] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {10277#false} is VALID [2022-04-15 12:49:14,877 INFO L272 TraceCheckUtils]: 8: Hoare triple {10277#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {10277#false} is VALID [2022-04-15 12:49:14,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {10277#false} ~cond := #in~cond; {10277#false} is VALID [2022-04-15 12:49:14,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {10277#false} assume 0 == ~cond; {10277#false} is VALID [2022-04-15 12:49:14,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {10277#false} assume !false; {10277#false} is VALID [2022-04-15 12:49:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:14,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:14,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396606446] [2022-04-15 12:49:14,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396606446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:14,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:14,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:49:15,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:15,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1525563277] [2022-04-15 12:49:15,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1525563277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:15,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:15,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:49:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360099194] [2022-04-15 12:49:15,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:15,855 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 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 89 [2022-04-15 12:49:15,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:15,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:16,014 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 12:49:16,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:49:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:49:16,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:49:16,016 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:21,863 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-04-15 12:49:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:49:21,863 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 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 89 [2022-04-15 12:49:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 107 transitions. [2022-04-15 12:49:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 107 transitions. [2022-04-15 12:49:21,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 107 transitions. [2022-04-15 12:49:22,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:22,178 INFO L225 Difference]: With dead ends: 103 [2022-04-15 12:49:22,178 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 12:49:22,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 8 SyntacticMatches, 53 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:49:22,179 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 65 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:22,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 149 Invalid, 2407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 12:49:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 12:49:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-15 12:49:22,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:22,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:22,194 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:22,194 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:22,195 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2022-04-15 12:49:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-04-15 12:49:22,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:22,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:22,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 12:49:22,196 INFO L87 Difference]: Start difference. First operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 12:49:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:22,197 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2022-04-15 12:49:22,197 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-04-15 12:49:22,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:22,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:22,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:22,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2022-04-15 12:49:22,199 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 89 [2022-04-15 12:49:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:22,199 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2022-04-15 12:49:22,200 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:22,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 95 transitions. [2022-04-15 12:49:22,491 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 12:49:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-04-15 12:49:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 12:49:22,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:22,492 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:22,492 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 12:49:22,492 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:22,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1732712075, now seen corresponding path program 27 times [2022-04-15 12:49:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:22,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [150284948] [2022-04-15 12:49:22,666 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:22,667 INFO L85 PathProgramCache]: Analyzing trace with hash 327585488, now seen corresponding path program 1 times [2022-04-15 12:49:22,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:22,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962740941] [2022-04-15 12:49:22,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:22,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:22,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:22,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {10955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10949#true} is VALID [2022-04-15 12:49:22,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {10949#true} assume true; {10949#true} is VALID [2022-04-15 12:49:22,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10949#true} {10949#true} #41#return; {10949#true} is VALID [2022-04-15 12:49:22,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {10949#true} call ULTIMATE.init(); {10955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:22,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {10955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10949#true} is VALID [2022-04-15 12:49:22,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {10949#true} assume true; {10949#true} is VALID [2022-04-15 12:49:22,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10949#true} {10949#true} #41#return; {10949#true} is VALID [2022-04-15 12:49:22,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {10949#true} call #t~ret7 := main(); {10949#true} is VALID [2022-04-15 12:49:22,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {10949#true} ~x~0 := 0;~y~0 := 0; {10954#(= main_~x~0 0)} is VALID [2022-04-15 12:49:22,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {10954#(= main_~x~0 0)} [99] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_27 v_main_~x~0_Out_54))) (or (and (< (mod (+ 4294967295 v_main_~x~0_Out_54) 4294967296) 500000) (= v_main_~y~0_Out_54 0) (= |v_main_#t~post6_Out_54| 0) (= v_main_~y~0_Out_54 v_main_~y~0_In_27) .cse0) (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) .cse0))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_27} OutVars{main_#t~post4=|v_main_#t~post4_Out_54|, main_~y~0=v_main_~y~0_Out_54, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {10954#(= main_~x~0 0)} is VALID [2022-04-15 12:49:22,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {10954#(= main_~x~0 0)} [98] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {10950#false} is VALID [2022-04-15 12:49:22,701 INFO L272 TraceCheckUtils]: 8: Hoare triple {10950#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {10950#false} is VALID [2022-04-15 12:49:22,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {10950#false} ~cond := #in~cond; {10950#false} is VALID [2022-04-15 12:49:22,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {10950#false} assume 0 == ~cond; {10950#false} is VALID [2022-04-15 12:49:22,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {10950#false} assume !false; {10950#false} is VALID [2022-04-15 12:49:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:22,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:22,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962740941] [2022-04-15 12:49:22,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962740941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:22,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:22,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:49:23,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:23,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [150284948] [2022-04-15 12:49:23,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [150284948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:23,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:23,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:49:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015415575] [2022-04-15 12:49:23,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:23,748 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 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 92 [2022-04-15 12:49:23,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:23,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:23,930 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 12:49:23,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:49:23,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:23,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:49:23,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:49:23,932 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:30,671 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-04-15 12:49:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:49:30,671 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 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 92 [2022-04-15 12:49:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 110 transitions. [2022-04-15 12:49:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 110 transitions. [2022-04-15 12:49:30,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 110 transitions. [2022-04-15 12:49:30,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:30,897 INFO L225 Difference]: With dead ends: 106 [2022-04-15 12:49:30,897 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 12:49:30,898 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 8 SyntacticMatches, 55 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 12:49:30,898 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:30,899 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 154 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 12:49:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 12:49:30,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-15 12:49:30,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:30,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:30,910 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:30,910 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:30,911 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-04-15 12:49:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-04-15 12:49:30,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:30,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:30,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-15 12:49:30,912 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-15 12:49:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:30,914 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-04-15 12:49:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-04-15 12:49:30,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:30,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:30,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:30,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-04-15 12:49:30,916 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2022-04-15 12:49:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:30,916 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-04-15 12:49:30,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:30,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 98 transitions. [2022-04-15 12:49:31,300 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 12:49:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-15 12:49:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 12:49:31,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:31,301 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:31,302 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 12:49:31,302 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:31,302 INFO L85 PathProgramCache]: Analyzing trace with hash 598289347, now seen corresponding path program 28 times [2022-04-15 12:49:31,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:31,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [451920448] [2022-04-15 12:49:31,492 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:31,494 INFO L85 PathProgramCache]: Analyzing trace with hash 386690832, now seen corresponding path program 1 times [2022-04-15 12:49:31,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:31,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97614273] [2022-04-15 12:49:31,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:31,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:31,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {11649#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11643#true} is VALID [2022-04-15 12:49:31,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {11643#true} assume true; {11643#true} is VALID [2022-04-15 12:49:31,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11643#true} {11643#true} #41#return; {11643#true} is VALID [2022-04-15 12:49:31,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {11643#true} call ULTIMATE.init(); {11649#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:31,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {11649#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11643#true} is VALID [2022-04-15 12:49:31,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {11643#true} assume true; {11643#true} is VALID [2022-04-15 12:49:31,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11643#true} {11643#true} #41#return; {11643#true} is VALID [2022-04-15 12:49:31,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {11643#true} call #t~ret7 := main(); {11643#true} is VALID [2022-04-15 12:49:31,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {11643#true} ~x~0 := 0;~y~0 := 0; {11648#(= main_~x~0 0)} is VALID [2022-04-15 12:49:31,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {11648#(= main_~x~0 0)} [101] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_28 v_main_~x~0_Out_56))) (or (and (= v_main_~y~0_Out_56 0) (= v_main_~y~0_Out_56 v_main_~y~0_In_28) (< (mod (+ 4294967295 v_main_~x~0_Out_56) 4294967296) 500000) (= |v_main_#t~post6_Out_56| 0) .cse0) (and .cse0 (= v_main_~y~0_In_28 v_main_~y~0_Out_56)))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_28} OutVars{main_#t~post4=|v_main_#t~post4_Out_56|, main_~y~0=v_main_~y~0_Out_56, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {11648#(= main_~x~0 0)} is VALID [2022-04-15 12:49:31,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {11648#(= main_~x~0 0)} [100] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {11644#false} is VALID [2022-04-15 12:49:31,525 INFO L272 TraceCheckUtils]: 8: Hoare triple {11644#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {11644#false} is VALID [2022-04-15 12:49:31,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {11644#false} ~cond := #in~cond; {11644#false} is VALID [2022-04-15 12:49:31,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {11644#false} assume 0 == ~cond; {11644#false} is VALID [2022-04-15 12:49:31,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {11644#false} assume !false; {11644#false} is VALID [2022-04-15 12:49:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:31,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97614273] [2022-04-15 12:49:31,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97614273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:31,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:31,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:49:32,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:32,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [451920448] [2022-04-15 12:49:32,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [451920448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:32,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:32,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:49:32,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455277560] [2022-04-15 12:49:32,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:32,595 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.84375) internal successors, (91), 31 states have internal predecessors, (91), 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 95 [2022-04-15 12:49:32,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:32,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.84375) internal successors, (91), 31 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:32,819 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 12:49:32,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:49:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:49:32,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:49:32,820 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 32 states, 32 states have (on average 2.84375) internal successors, (91), 31 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:41,750 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-15 12:49:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:49:41,750 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.84375) internal successors, (91), 31 states have internal predecessors, (91), 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 95 [2022-04-15 12:49:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.84375) internal successors, (91), 31 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2022-04-15 12:49:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.84375) internal successors, (91), 31 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2022-04-15 12:49:41,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 113 transitions. [2022-04-15 12:49:42,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:42,057 INFO L225 Difference]: With dead ends: 109 [2022-04-15 12:49:42,057 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 12:49:42,059 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 8 SyntacticMatches, 57 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 12:49:42,059 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:42,059 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 159 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 12:49:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 12:49:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2022-04-15 12:49:42,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:42,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 100 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,074 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 100 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,074 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 100 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:42,075 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-04-15 12:49:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-15 12:49:42,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:42,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:42,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-15 12:49:42,076 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-15 12:49:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:42,077 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-04-15 12:49:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-15 12:49:42,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:42,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:42,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:42,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-04-15 12:49:42,079 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2022-04-15 12:49:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:42,079 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-04-15 12:49:42,080 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.84375) internal successors, (91), 31 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 101 transitions. [2022-04-15 12:49:42,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:42,378 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 12:49:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 12:49:42,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:42,378 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:42,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 12:49:42,379 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:42,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:42,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2108451723, now seen corresponding path program 29 times [2022-04-15 12:49:42,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:42,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113516829] [2022-04-15 12:49:42,538 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:42,540 INFO L85 PathProgramCache]: Analyzing trace with hash 445796176, now seen corresponding path program 1 times [2022-04-15 12:49:42,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:42,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764541885] [2022-04-15 12:49:42,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:42,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:42,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:42,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {12364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12358#true} is VALID [2022-04-15 12:49:42,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {12358#true} assume true; {12358#true} is VALID [2022-04-15 12:49:42,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12358#true} {12358#true} #41#return; {12358#true} is VALID [2022-04-15 12:49:42,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {12358#true} call ULTIMATE.init(); {12364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:42,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {12364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12358#true} is VALID [2022-04-15 12:49:42,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {12358#true} assume true; {12358#true} is VALID [2022-04-15 12:49:42,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12358#true} {12358#true} #41#return; {12358#true} is VALID [2022-04-15 12:49:42,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {12358#true} call #t~ret7 := main(); {12358#true} is VALID [2022-04-15 12:49:42,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {12358#true} ~x~0 := 0;~y~0 := 0; {12363#(= main_~x~0 0)} is VALID [2022-04-15 12:49:42,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {12363#(= main_~x~0 0)} [103] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_29 v_main_~x~0_Out_58))) (or (and .cse0 (= v_main_~y~0_In_29 v_main_~y~0_Out_58)) (and (< (mod (+ 4294967295 v_main_~x~0_Out_58) 4294967296) 500000) (= v_main_~y~0_Out_58 0) .cse0 (= |v_main_#t~post6_Out_58| 0) (= v_main_~y~0_Out_58 v_main_~y~0_In_29)))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_29} OutVars{main_#t~post4=|v_main_#t~post4_Out_58|, main_~y~0=v_main_~y~0_Out_58, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {12363#(= main_~x~0 0)} is VALID [2022-04-15 12:49:42,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {12363#(= main_~x~0 0)} [102] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {12359#false} is VALID [2022-04-15 12:49:42,574 INFO L272 TraceCheckUtils]: 8: Hoare triple {12359#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {12359#false} is VALID [2022-04-15 12:49:42,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {12359#false} ~cond := #in~cond; {12359#false} is VALID [2022-04-15 12:49:42,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {12359#false} assume 0 == ~cond; {12359#false} is VALID [2022-04-15 12:49:42,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {12359#false} assume !false; {12359#false} is VALID [2022-04-15 12:49:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:42,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:42,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764541885] [2022-04-15 12:49:42,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764541885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:42,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:42,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:49:43,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:43,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1113516829] [2022-04-15 12:49:43,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1113516829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:43,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:43,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:49:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301663664] [2022-04-15 12:49:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:43,752 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 32 states have internal predecessors, (94), 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 98 [2022-04-15 12:49:43,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:43,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 32 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:44,014 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 12:49:44,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:49:44,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:44,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:49:44,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:49:44,015 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 32 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:53,766 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2022-04-15 12:49:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:49:53,767 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 32 states have internal predecessors, (94), 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 98 [2022-04-15 12:49:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 32 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 116 transitions. [2022-04-15 12:49:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 32 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 116 transitions. [2022-04-15 12:49:53,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 116 transitions. [2022-04-15 12:49:54,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:54,114 INFO L225 Difference]: With dead ends: 112 [2022-04-15 12:49:54,114 INFO L226 Difference]: Without dead ends: 104 [2022-04-15 12:49:54,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 8 SyntacticMatches, 59 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:49:54,116 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 71 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:54,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 164 Invalid, 2944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-15 12:49:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-15 12:49:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-04-15 12:49:54,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:54,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:54,131 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:54,131 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:54,132 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-04-15 12:49:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-04-15 12:49:54,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:54,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:54,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-15 12:49:54,133 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-15 12:49:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:54,134 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-04-15 12:49:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-04-15 12:49:54,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:54,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:54,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:54,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2022-04-15 12:49:54,136 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2022-04-15 12:49:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:54,137 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2022-04-15 12:49:54,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 32 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:54,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 104 transitions. [2022-04-15 12:49:54,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2022-04-15 12:49:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 12:49:54,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:54,503 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:54,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 12:49:54,504 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:54,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1573369539, now seen corresponding path program 30 times [2022-04-15 12:49:54,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:54,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452615835] [2022-04-15 12:49:54,622 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:54,623 INFO L85 PathProgramCache]: Analyzing trace with hash 504901520, now seen corresponding path program 1 times [2022-04-15 12:49:54,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:54,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155335645] [2022-04-15 12:49:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:54,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:54,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {13100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13094#true} is VALID [2022-04-15 12:49:54,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {13094#true} assume true; {13094#true} is VALID [2022-04-15 12:49:54,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13094#true} {13094#true} #41#return; {13094#true} is VALID [2022-04-15 12:49:54,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {13094#true} call ULTIMATE.init(); {13100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:54,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {13100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13094#true} is VALID [2022-04-15 12:49:54,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {13094#true} assume true; {13094#true} is VALID [2022-04-15 12:49:54,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13094#true} {13094#true} #41#return; {13094#true} is VALID [2022-04-15 12:49:54,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {13094#true} call #t~ret7 := main(); {13094#true} is VALID [2022-04-15 12:49:54,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {13094#true} ~x~0 := 0;~y~0 := 0; {13099#(= main_~x~0 0)} is VALID [2022-04-15 12:49:54,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {13099#(= main_~x~0 0)} [105] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_30 v_main_~x~0_Out_60))) (or (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) .cse0) (and (= v_main_~y~0_Out_60 0) (= v_main_~y~0_Out_60 v_main_~y~0_In_30) (< (mod (+ 4294967295 v_main_~x~0_Out_60) 4294967296) 500000) .cse0 (= |v_main_#t~post6_Out_60| 0)))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_30} OutVars{main_#t~post4=|v_main_#t~post4_Out_60|, main_~y~0=v_main_~y~0_Out_60, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {13099#(= main_~x~0 0)} is VALID [2022-04-15 12:49:54,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {13099#(= main_~x~0 0)} [104] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {13095#false} is VALID [2022-04-15 12:49:54,653 INFO L272 TraceCheckUtils]: 8: Hoare triple {13095#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {13095#false} is VALID [2022-04-15 12:49:54,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {13095#false} ~cond := #in~cond; {13095#false} is VALID [2022-04-15 12:49:54,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {13095#false} assume 0 == ~cond; {13095#false} is VALID [2022-04-15 12:49:54,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {13095#false} assume !false; {13095#false} is VALID [2022-04-15 12:49:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:54,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:54,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155335645] [2022-04-15 12:49:54,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155335645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:54,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:54,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:49:55,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:55,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452615835] [2022-04-15 12:49:55,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452615835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:55,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:55,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:49:55,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271294145] [2022-04-15 12:49:55,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:55,934 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 33 states have internal predecessors, (97), 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 101 [2022-04-15 12:49:55,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:55,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 33 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:56,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:56,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:49:56,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:56,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:49:56,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:49:56,249 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 33 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:08,344 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2022-04-15 12:50:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:50:08,344 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 33 states have internal predecessors, (97), 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 101 [2022-04-15 12:50:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 33 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2022-04-15 12:50:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 33 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2022-04-15 12:50:08,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 119 transitions. [2022-04-15 12:50:08,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:08,778 INFO L225 Difference]: With dead ends: 115 [2022-04-15 12:50:08,778 INFO L226 Difference]: Without dead ends: 107 [2022-04-15 12:50:08,779 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 8 SyntacticMatches, 61 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 12:50:08,780 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 73 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:08,780 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 169 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3101 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-04-15 12:50:08,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-15 12:50:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2022-04-15 12:50:08,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:08,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 106 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 101 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:08,793 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 106 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 101 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:08,793 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 106 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 101 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:08,794 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-04-15 12:50:08,794 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-15 12:50:08,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:08,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:08,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 101 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-15 12:50:08,795 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 101 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-15 12:50:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:08,796 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-04-15 12:50:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-15 12:50:08,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:08,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:08,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:08,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 101 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2022-04-15 12:50:08,799 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 101 [2022-04-15 12:50:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:08,799 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2022-04-15 12:50:08,799 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 33 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:08,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 107 transitions. [2022-04-15 12:50:09,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2022-04-15 12:50:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-15 12:50:09,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:09,200 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:09,200 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 12:50:09,200 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash -436338549, now seen corresponding path program 31 times [2022-04-15 12:50:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:09,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366132929] [2022-04-15 12:50:09,404 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash 564006864, now seen corresponding path program 1 times [2022-04-15 12:50:09,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:09,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072953873] [2022-04-15 12:50:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:09,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:09,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:09,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {13857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13851#true} is VALID [2022-04-15 12:50:09,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {13851#true} assume true; {13851#true} is VALID [2022-04-15 12:50:09,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13851#true} {13851#true} #41#return; {13851#true} is VALID [2022-04-15 12:50:09,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {13851#true} call ULTIMATE.init(); {13857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:09,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {13857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13851#true} is VALID [2022-04-15 12:50:09,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {13851#true} assume true; {13851#true} is VALID [2022-04-15 12:50:09,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13851#true} {13851#true} #41#return; {13851#true} is VALID [2022-04-15 12:50:09,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {13851#true} call #t~ret7 := main(); {13851#true} is VALID [2022-04-15 12:50:09,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {13851#true} ~x~0 := 0;~y~0 := 0; {13856#(= main_~x~0 0)} is VALID [2022-04-15 12:50:09,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {13856#(= main_~x~0 0)} [107] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_31 v_main_~x~0_Out_62))) (or (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) .cse0) (and (< (mod (+ 4294967295 v_main_~x~0_Out_62) 4294967296) 500000) (= |v_main_#t~post6_Out_62| 0) (= v_main_~y~0_Out_62 0) .cse0 (= v_main_~y~0_Out_62 v_main_~y~0_In_31)))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_31} OutVars{main_#t~post4=|v_main_#t~post4_Out_62|, main_~y~0=v_main_~y~0_Out_62, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {13856#(= main_~x~0 0)} is VALID [2022-04-15 12:50:09,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {13856#(= main_~x~0 0)} [106] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {13852#false} is VALID [2022-04-15 12:50:09,439 INFO L272 TraceCheckUtils]: 8: Hoare triple {13852#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {13852#false} is VALID [2022-04-15 12:50:09,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {13852#false} ~cond := #in~cond; {13852#false} is VALID [2022-04-15 12:50:09,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {13852#false} assume 0 == ~cond; {13852#false} is VALID [2022-04-15 12:50:09,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {13852#false} assume !false; {13852#false} is VALID [2022-04-15 12:50:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:09,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:09,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072953873] [2022-04-15 12:50:09,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072953873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:09,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:09,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:50:10,725 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:10,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366132929] [2022-04-15 12:50:10,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366132929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:10,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:10,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 12:50:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679644976] [2022-04-15 12:50:10,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:10,726 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 34 states have internal predecessors, (100), 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 104 [2022-04-15 12:50:10,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:10,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 34 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:11,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:11,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 12:50:11,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:11,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 12:50:11,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:50:11,110 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 34 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:25,708 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-04-15 12:50:25,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:50:25,708 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 34 states have internal predecessors, (100), 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 104 [2022-04-15 12:50:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 34 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2022-04-15 12:50:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 34 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2022-04-15 12:50:25,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 122 transitions. [2022-04-15 12:50:26,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:26,233 INFO L225 Difference]: With dead ends: 118 [2022-04-15 12:50:26,233 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 12:50:26,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 8 SyntacticMatches, 63 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:50:26,235 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 75 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 3297 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:26,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 174 Invalid, 3332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3297 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-04-15 12:50:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 12:50:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-15 12:50:26,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:26,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:26,246 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:26,246 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:26,248 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-15 12:50:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-15 12:50:26,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:26,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:26,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-15 12:50:26,248 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-15 12:50:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:26,250 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-15 12:50:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-15 12:50:26,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:26,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:26,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:26,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-04-15 12:50:26,252 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2022-04-15 12:50:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:26,252 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-04-15 12:50:26,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 34 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:26,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 110 transitions. [2022-04-15 12:50:26,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-15 12:50:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 12:50:26,741 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:26,741 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:26,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 12:50:26,741 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:26,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash 194118083, now seen corresponding path program 32 times [2022-04-15 12:50:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:26,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [723289391] [2022-04-15 12:50:26,909 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash 623112208, now seen corresponding path program 1 times [2022-04-15 12:50:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:26,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146174093] [2022-04-15 12:50:26,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:26,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:26,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:26,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {14635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14629#true} is VALID [2022-04-15 12:50:26,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-15 12:50:26,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14629#true} {14629#true} #41#return; {14629#true} is VALID [2022-04-15 12:50:26,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {14629#true} call ULTIMATE.init(); {14635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:26,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {14635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14629#true} is VALID [2022-04-15 12:50:26,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-15 12:50:26,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14629#true} {14629#true} #41#return; {14629#true} is VALID [2022-04-15 12:50:26,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {14629#true} call #t~ret7 := main(); {14629#true} is VALID [2022-04-15 12:50:26,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {14629#true} ~x~0 := 0;~y~0 := 0; {14634#(= main_~x~0 0)} is VALID [2022-04-15 12:50:26,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {14634#(= main_~x~0 0)} [109] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_32 v_main_~x~0_Out_64))) (or (and (< (mod (+ 4294967295 v_main_~x~0_Out_64) 4294967296) 500000) (= v_main_~y~0_Out_64 0) (= v_main_~y~0_Out_64 v_main_~y~0_In_32) .cse0 (= |v_main_#t~post6_Out_64| 0)) (and .cse0 (= v_main_~y~0_In_32 v_main_~y~0_Out_64)))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_32} OutVars{main_#t~post4=|v_main_#t~post4_Out_64|, main_~y~0=v_main_~y~0_Out_64, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {14634#(= main_~x~0 0)} is VALID [2022-04-15 12:50:26,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {14634#(= main_~x~0 0)} [108] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {14630#false} is VALID [2022-04-15 12:50:26,942 INFO L272 TraceCheckUtils]: 8: Hoare triple {14630#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {14630#false} is VALID [2022-04-15 12:50:26,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {14630#false} ~cond := #in~cond; {14630#false} is VALID [2022-04-15 12:50:26,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {14630#false} assume 0 == ~cond; {14630#false} is VALID [2022-04-15 12:50:26,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {14630#false} assume !false; {14630#false} is VALID [2022-04-15 12:50:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:26,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:26,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146174093] [2022-04-15 12:50:26,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146174093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:26,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:26,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:50:28,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:28,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [723289391] [2022-04-15 12:50:28,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [723289391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:28,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:28,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:50:28,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986367265] [2022-04-15 12:50:28,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:28,345 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.861111111111111) internal successors, (103), 35 states have internal predecessors, (103), 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 107 [2022-04-15 12:50:28,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:28,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.861111111111111) internal successors, (103), 35 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:28,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:28,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:50:28,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:50:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:50:28,806 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 36 states, 36 states have (on average 2.861111111111111) internal successors, (103), 35 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:47,561 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-04-15 12:50:47,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:50:47,561 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.861111111111111) internal successors, (103), 35 states have internal predecessors, (103), 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 107 [2022-04-15 12:50:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.861111111111111) internal successors, (103), 35 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 125 transitions. [2022-04-15 12:50:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.861111111111111) internal successors, (103), 35 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 125 transitions. [2022-04-15 12:50:47,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 125 transitions. [2022-04-15 12:50:48,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:48,168 INFO L225 Difference]: With dead ends: 121 [2022-04-15 12:50:48,168 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 12:50:48,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 8 SyntacticMatches, 65 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:50:48,169 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 77 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 3499 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 3535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:48,169 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 179 Invalid, 3535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3499 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2022-04-15 12:50:48,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 12:50:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2022-04-15 12:50:48,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:48,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 112 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:48,185 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 112 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:48,185 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 112 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:48,187 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2022-04-15 12:50:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2022-04-15 12:50:48,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:48,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:48,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-15 12:50:48,187 INFO L87 Difference]: Start difference. First operand has 112 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-15 12:50:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:48,189 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2022-04-15 12:50:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2022-04-15 12:50:48,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:48,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:48,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:48,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2022-04-15 12:50:48,191 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2022-04-15 12:50:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:48,191 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2022-04-15 12:50:48,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.861111111111111) internal successors, (103), 35 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:48,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 113 transitions. [2022-04-15 12:50:48,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2022-04-15 12:50:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 12:50:48,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:48,720 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:48,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 12:50:48,721 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash 235656587, now seen corresponding path program 33 times [2022-04-15 12:50:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:48,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1760007504] [2022-04-15 12:50:48,890 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash 682217552, now seen corresponding path program 1 times [2022-04-15 12:50:48,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:48,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566213364] [2022-04-15 12:50:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:48,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:48,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:48,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {15434#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15428#true} is VALID [2022-04-15 12:50:48,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {15428#true} assume true; {15428#true} is VALID [2022-04-15 12:50:48,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15428#true} {15428#true} #41#return; {15428#true} is VALID [2022-04-15 12:50:48,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {15428#true} call ULTIMATE.init(); {15434#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:48,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {15434#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15428#true} is VALID [2022-04-15 12:50:48,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {15428#true} assume true; {15428#true} is VALID [2022-04-15 12:50:48,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15428#true} {15428#true} #41#return; {15428#true} is VALID [2022-04-15 12:50:48,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {15428#true} call #t~ret7 := main(); {15428#true} is VALID [2022-04-15 12:50:48,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {15428#true} ~x~0 := 0;~y~0 := 0; {15433#(= main_~x~0 0)} is VALID [2022-04-15 12:50:48,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {15433#(= main_~x~0 0)} [111] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) (or (and (= v_main_~y~0_In_33 v_main_~y~0_Out_66) .cse0) (and (< (mod (+ 4294967295 v_main_~x~0_Out_66) 4294967296) 500000) (= v_main_~y~0_Out_66 v_main_~y~0_In_33) .cse0 (= v_main_~y~0_Out_66 0) (= |v_main_#t~post6_Out_66| 0)))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_33} OutVars{main_#t~post4=|v_main_#t~post4_Out_66|, main_~y~0=v_main_~y~0_Out_66, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_66|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {15433#(= main_~x~0 0)} is VALID [2022-04-15 12:50:48,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {15433#(= main_~x~0 0)} [110] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {15429#false} is VALID [2022-04-15 12:50:48,926 INFO L272 TraceCheckUtils]: 8: Hoare triple {15429#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {15429#false} is VALID [2022-04-15 12:50:48,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {15429#false} ~cond := #in~cond; {15429#false} is VALID [2022-04-15 12:50:48,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {15429#false} assume 0 == ~cond; {15429#false} is VALID [2022-04-15 12:50:48,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {15429#false} assume !false; {15429#false} is VALID [2022-04-15 12:50:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:48,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:48,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566213364] [2022-04-15 12:50:48,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566213364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:48,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:48,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:50:50,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:50,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1760007504] [2022-04-15 12:50:50,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1760007504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:50,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:50,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 12:50:50,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928999786] [2022-04-15 12:50:50,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:50,426 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 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 110 [2022-04-15 12:50:50,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:50,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:51,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:51,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 12:50:51,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:51,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 12:50:51,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:50:51,021 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:14,323 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-15 12:51:14,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:51:14,323 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 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 110 [2022-04-15 12:51:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 128 transitions. [2022-04-15 12:51:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 128 transitions. [2022-04-15 12:51:14,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 128 transitions. [2022-04-15 12:51:15,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:15,136 INFO L225 Difference]: With dead ends: 124 [2022-04-15 12:51:15,136 INFO L226 Difference]: Without dead ends: 116 [2022-04-15 12:51:15,137 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 8 SyntacticMatches, 67 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 12:51:15,137 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 79 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 3707 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:15,137 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 184 Invalid, 3744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3707 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2022-04-15 12:51:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-15 12:51:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-04-15 12:51:15,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:15,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:15,149 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:15,149 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:15,150 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2022-04-15 12:51:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2022-04-15 12:51:15,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:15,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:15,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-15 12:51:15,151 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-15 12:51:15,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:15,152 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2022-04-15 12:51:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2022-04-15 12:51:15,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:15,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:15,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:15,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-04-15 12:51:15,154 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2022-04-15 12:51:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:15,154 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-04-15 12:51:15,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 36 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:15,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 116 transitions. [2022-04-15 12:51:15,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-04-15 12:51:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 12:51:15,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:15,794 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:15,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 12:51:15,794 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:15,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash 758648003, now seen corresponding path program 34 times [2022-04-15 12:51:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:15,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1590359221] [2022-04-15 12:51:15,982 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:51:15,983 INFO L85 PathProgramCache]: Analyzing trace with hash 741322896, now seen corresponding path program 1 times [2022-04-15 12:51:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:15,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840418811] [2022-04-15 12:51:15,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:15,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:16,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:16,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {16254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16248#true} is VALID [2022-04-15 12:51:16,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {16248#true} assume true; {16248#true} is VALID [2022-04-15 12:51:16,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16248#true} {16248#true} #41#return; {16248#true} is VALID [2022-04-15 12:51:16,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {16248#true} call ULTIMATE.init(); {16254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:16,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {16254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16248#true} is VALID [2022-04-15 12:51:16,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {16248#true} assume true; {16248#true} is VALID [2022-04-15 12:51:16,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16248#true} {16248#true} #41#return; {16248#true} is VALID [2022-04-15 12:51:16,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {16248#true} call #t~ret7 := main(); {16248#true} is VALID [2022-04-15 12:51:16,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {16248#true} ~x~0 := 0;~y~0 := 0; {16253#(= main_~x~0 0)} is VALID [2022-04-15 12:51:16,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {16253#(= main_~x~0 0)} [113] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_34 v_main_~x~0_Out_68))) (or (and (= v_main_~y~0_In_34 v_main_~y~0_Out_68) .cse0) (and (= |v_main_#t~post6_Out_68| 0) (= v_main_~y~0_Out_68 0) (= v_main_~y~0_Out_68 v_main_~y~0_In_34) (< (mod (+ 4294967295 v_main_~x~0_Out_68) 4294967296) 500000) .cse0))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_34} OutVars{main_#t~post4=|v_main_#t~post4_Out_68|, main_~y~0=v_main_~y~0_Out_68, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_68|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {16253#(= main_~x~0 0)} is VALID [2022-04-15 12:51:16,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {16253#(= main_~x~0 0)} [112] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {16249#false} is VALID [2022-04-15 12:51:16,010 INFO L272 TraceCheckUtils]: 8: Hoare triple {16249#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {16249#false} is VALID [2022-04-15 12:51:16,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {16249#false} ~cond := #in~cond; {16249#false} is VALID [2022-04-15 12:51:16,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {16249#false} assume 0 == ~cond; {16249#false} is VALID [2022-04-15 12:51:16,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {16249#false} assume !false; {16249#false} is VALID [2022-04-15 12:51:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:16,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:16,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840418811] [2022-04-15 12:51:16,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840418811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:16,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:16,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:51:17,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:17,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1590359221] [2022-04-15 12:51:17,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1590359221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:17,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:17,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:51:17,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446770408] [2022-04-15 12:51:17,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:17,556 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 37 states have internal predecessors, (109), 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 113 [2022-04-15 12:51:17,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:17,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 37 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:18,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:18,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:51:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:18,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:51:18,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:51:18,251 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 37 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:46,995 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2022-04-15 12:51:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 12:51:46,995 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 37 states have internal predecessors, (109), 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 113 [2022-04-15 12:51:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 37 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 131 transitions. [2022-04-15 12:51:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 37 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 131 transitions. [2022-04-15 12:51:46,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 131 transitions. [2022-04-15 12:51:48,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:48,023 INFO L225 Difference]: With dead ends: 127 [2022-04-15 12:51:48,023 INFO L226 Difference]: Without dead ends: 119 [2022-04-15 12:51:48,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 8 SyntacticMatches, 69 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 12:51:48,024 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 81 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 3921 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 3959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:48,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 189 Invalid, 3959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3921 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2022-04-15 12:51:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-15 12:51:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2022-04-15 12:51:48,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:48,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 118 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:48,043 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 118 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:48,044 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 118 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:48,045 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2022-04-15 12:51:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-15 12:51:48,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:48,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:48,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-15 12:51:48,046 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-15 12:51:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:48,047 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2022-04-15 12:51:48,047 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-15 12:51:48,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:48,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:48,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:48,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2022-04-15 12:51:48,049 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 113 [2022-04-15 12:51:48,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:48,049 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2022-04-15 12:51:48,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 37 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:48,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 119 transitions. [2022-04-15 12:51:48,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-15 12:51:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 12:51:48,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:48,936 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:48,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 12:51:48,937 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash -945427829, now seen corresponding path program 35 times [2022-04-15 12:51:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:48,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281373356] [2022-04-15 12:51:49,075 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:51:49,076 INFO L85 PathProgramCache]: Analyzing trace with hash 800428240, now seen corresponding path program 1 times [2022-04-15 12:51:49,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:49,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447505996] [2022-04-15 12:51:49,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:49,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:49,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:49,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {17095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17089#true} is VALID [2022-04-15 12:51:49,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {17089#true} assume true; {17089#true} is VALID [2022-04-15 12:51:49,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17089#true} {17089#true} #41#return; {17089#true} is VALID [2022-04-15 12:51:49,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {17089#true} call ULTIMATE.init(); {17095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:49,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {17095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17089#true} is VALID [2022-04-15 12:51:49,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {17089#true} assume true; {17089#true} is VALID [2022-04-15 12:51:49,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17089#true} {17089#true} #41#return; {17089#true} is VALID [2022-04-15 12:51:49,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {17089#true} call #t~ret7 := main(); {17089#true} is VALID [2022-04-15 12:51:49,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {17089#true} ~x~0 := 0;~y~0 := 0; {17094#(= main_~x~0 0)} is VALID [2022-04-15 12:51:49,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {17094#(= main_~x~0 0)} [115] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_35 v_main_~x~0_Out_70))) (or (and (= v_main_~y~0_In_35 v_main_~y~0_Out_70) .cse0) (and (= v_main_~y~0_Out_70 0) (= |v_main_#t~post6_Out_70| 0) (= v_main_~y~0_Out_70 v_main_~y~0_In_35) (< (mod (+ 4294967295 v_main_~x~0_Out_70) 4294967296) 500000) .cse0))) InVars {main_~x~0=v_main_~x~0_In_35, main_~y~0=v_main_~y~0_In_35} OutVars{main_#t~post4=|v_main_#t~post4_Out_70|, main_~y~0=v_main_~y~0_Out_70, main_~x~0=v_main_~x~0_Out_70, main_#t~post6=|v_main_#t~post6_Out_70|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {17094#(= main_~x~0 0)} is VALID [2022-04-15 12:51:49,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {17094#(= main_~x~0 0)} [114] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {17090#false} is VALID [2022-04-15 12:51:49,102 INFO L272 TraceCheckUtils]: 8: Hoare triple {17090#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {17090#false} is VALID [2022-04-15 12:51:49,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {17090#false} ~cond := #in~cond; {17090#false} is VALID [2022-04-15 12:51:49,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {17090#false} assume 0 == ~cond; {17090#false} is VALID [2022-04-15 12:51:49,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {17090#false} assume !false; {17090#false} is VALID [2022-04-15 12:51:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:49,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:49,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447505996] [2022-04-15 12:51:49,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447505996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:49,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:49,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:51:50,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:50,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281373356] [2022-04-15 12:51:50,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281373356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:50,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:50,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 12:51:50,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046415463] [2022-04-15 12:51:50,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:50,695 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 38 states have internal predecessors, (112), 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 116 [2022-04-15 12:51:50,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:50,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 38 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:51,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:51,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 12:51:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 12:51:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:51:51,548 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 38 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:26,432 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-04-15 12:52:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:52:26,432 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 38 states have internal predecessors, (112), 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 116 [2022-04-15 12:52:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 38 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 134 transitions. [2022-04-15 12:52:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 38 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 134 transitions. [2022-04-15 12:52:26,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 134 transitions. [2022-04-15 12:52:27,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:27,621 INFO L225 Difference]: With dead ends: 130 [2022-04-15 12:52:27,621 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 12:52:27,621 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 8 SyntacticMatches, 71 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:52:27,622 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 83 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 4180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:27,622 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 194 Invalid, 4180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 18.9s Time] [2022-04-15 12:52:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 12:52:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 12:52:27,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:27,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:27,642 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:27,642 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:27,643 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2022-04-15 12:52:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2022-04-15 12:52:27,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:27,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:27,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 12:52:27,644 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 12:52:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:27,645 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2022-04-15 12:52:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2022-04-15 12:52:27,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:27,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:27,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:27,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2022-04-15 12:52:27,648 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2022-04-15 12:52:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:27,648 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2022-04-15 12:52:27,648 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 38 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:27,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 122 transitions. [2022-04-15 12:52:28,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-15 12:52:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 12:52:28,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:28,546 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:28,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 12:52:28,546 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash -555100221, now seen corresponding path program 36 times [2022-04-15 12:52:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:28,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [545761555] [2022-04-15 12:52:28,692 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:28,693 INFO L85 PathProgramCache]: Analyzing trace with hash 859533584, now seen corresponding path program 1 times [2022-04-15 12:52:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:28,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252819976] [2022-04-15 12:52:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:28,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:28,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:28,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {17957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17951#true} is VALID [2022-04-15 12:52:28,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {17951#true} assume true; {17951#true} is VALID [2022-04-15 12:52:28,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17951#true} {17951#true} #41#return; {17951#true} is VALID [2022-04-15 12:52:28,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {17951#true} call ULTIMATE.init(); {17957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:28,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {17957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17951#true} is VALID [2022-04-15 12:52:28,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {17951#true} assume true; {17951#true} is VALID [2022-04-15 12:52:28,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17951#true} {17951#true} #41#return; {17951#true} is VALID [2022-04-15 12:52:28,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {17951#true} call #t~ret7 := main(); {17951#true} is VALID [2022-04-15 12:52:28,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {17951#true} ~x~0 := 0;~y~0 := 0; {17956#(= main_~x~0 0)} is VALID [2022-04-15 12:52:28,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {17956#(= main_~x~0 0)} [117] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_36 v_main_~x~0_Out_72))) (or (and .cse0 (= v_main_~y~0_In_36 v_main_~y~0_Out_72)) (and (= |v_main_#t~post6_Out_72| 0) (= v_main_~y~0_Out_72 v_main_~y~0_In_36) (= v_main_~y~0_Out_72 0) .cse0 (< (mod (+ 4294967295 v_main_~x~0_Out_72) 4294967296) 500000)))) InVars {main_~x~0=v_main_~x~0_In_36, main_~y~0=v_main_~y~0_In_36} OutVars{main_#t~post4=|v_main_#t~post4_Out_72|, main_~y~0=v_main_~y~0_Out_72, main_~x~0=v_main_~x~0_Out_72, main_#t~post6=|v_main_#t~post6_Out_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {17956#(= main_~x~0 0)} is VALID [2022-04-15 12:52:28,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {17956#(= main_~x~0 0)} [116] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {17952#false} is VALID [2022-04-15 12:52:28,728 INFO L272 TraceCheckUtils]: 8: Hoare triple {17952#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {17952#false} is VALID [2022-04-15 12:52:28,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {17952#false} ~cond := #in~cond; {17952#false} is VALID [2022-04-15 12:52:28,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {17952#false} assume 0 == ~cond; {17952#false} is VALID [2022-04-15 12:52:28,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {17952#false} assume !false; {17952#false} is VALID [2022-04-15 12:52:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:52:28,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:28,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252819976] [2022-04-15 12:52:28,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252819976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:28,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:28,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:52:30,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:30,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [545761555] [2022-04-15 12:52:30,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [545761555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:30,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:30,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 12:52:30,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917378234] [2022-04-15 12:52:30,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:30,383 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 39 states have internal predecessors, (115), 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 119 [2022-04-15 12:52:30,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:30,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.875) internal successors, (115), 39 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:31,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:31,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 12:52:31,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:31,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 12:52:31,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:52:31,510 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 39 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:14,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:14,817 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2022-04-15 12:53:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 12:53:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 39 states have internal predecessors, (115), 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 119 [2022-04-15 12:53:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 39 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 137 transitions. [2022-04-15 12:53:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 39 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 137 transitions. [2022-04-15 12:53:14,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 137 transitions. [2022-04-15 12:53:16,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:16,338 INFO L225 Difference]: With dead ends: 133 [2022-04-15 12:53:16,338 INFO L226 Difference]: Without dead ends: 125 [2022-04-15 12:53:16,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 8 SyntacticMatches, 73 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 12:53:16,339 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 85 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 4367 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 4407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:16,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 199 Invalid, 4407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4367 Invalid, 0 Unknown, 0 Unchecked, 24.2s Time] [2022-04-15 12:53:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-15 12:53:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2022-04-15 12:53:16,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:16,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 124 states, 119 states have (on average 1.0168067226890756) internal successors, (121), 119 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:16,353 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 124 states, 119 states have (on average 1.0168067226890756) internal successors, (121), 119 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:16,353 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 124 states, 119 states have (on average 1.0168067226890756) internal successors, (121), 119 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:16,354 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2022-04-15 12:53:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-04-15 12:53:16,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:16,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:16,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 119 states have (on average 1.0168067226890756) internal successors, (121), 119 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-15 12:53:16,355 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.0168067226890756) internal successors, (121), 119 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-15 12:53:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:16,356 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2022-04-15 12:53:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-04-15 12:53:16,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:16,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:16,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:16,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0168067226890756) internal successors, (121), 119 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2022-04-15 12:53:16,358 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 119 [2022-04-15 12:53:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:16,358 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2022-04-15 12:53:16,359 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 39 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:16,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 125 transitions. [2022-04-15 12:53:17,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:17,529 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2022-04-15 12:53:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 12:53:17,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:17,530 INFO L499 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:17,530 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 12:53:17,530 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:17,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1218199435, now seen corresponding path program 37 times [2022-04-15 12:53:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:17,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1091567993] [2022-04-15 12:53:17,866 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:53:17,867 INFO L85 PathProgramCache]: Analyzing trace with hash 918638928, now seen corresponding path program 1 times [2022-04-15 12:53:17,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:17,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737610698] [2022-04-15 12:53:17,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:17,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:17,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:17,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {18840#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18834#true} is VALID [2022-04-15 12:53:17,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {18834#true} assume true; {18834#true} is VALID [2022-04-15 12:53:17,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18834#true} {18834#true} #41#return; {18834#true} is VALID [2022-04-15 12:53:17,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {18834#true} call ULTIMATE.init(); {18840#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:17,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {18840#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18834#true} is VALID [2022-04-15 12:53:17,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {18834#true} assume true; {18834#true} is VALID [2022-04-15 12:53:17,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18834#true} {18834#true} #41#return; {18834#true} is VALID [2022-04-15 12:53:17,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {18834#true} call #t~ret7 := main(); {18834#true} is VALID [2022-04-15 12:53:17,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {18834#true} ~x~0 := 0;~y~0 := 0; {18839#(= main_~x~0 0)} is VALID [2022-04-15 12:53:17,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {18839#(= main_~x~0 0)} [119] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_37 v_main_~x~0_Out_74))) (or (and (= v_main_~y~0_In_37 v_main_~y~0_Out_74) .cse0) (and (< (mod (+ 4294967295 v_main_~x~0_Out_74) 4294967296) 500000) (= v_main_~y~0_Out_74 0) (= |v_main_#t~post6_Out_74| 0) .cse0 (= v_main_~y~0_Out_74 v_main_~y~0_In_37)))) InVars {main_~x~0=v_main_~x~0_In_37, main_~y~0=v_main_~y~0_In_37} OutVars{main_#t~post4=|v_main_#t~post4_Out_74|, main_~y~0=v_main_~y~0_Out_74, main_~x~0=v_main_~x~0_Out_74, main_#t~post6=|v_main_#t~post6_Out_74|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {18839#(= main_~x~0 0)} is VALID [2022-04-15 12:53:17,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {18839#(= main_~x~0 0)} [118] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {18835#false} is VALID [2022-04-15 12:53:17,904 INFO L272 TraceCheckUtils]: 8: Hoare triple {18835#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {18835#false} is VALID [2022-04-15 12:53:17,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {18835#false} ~cond := #in~cond; {18835#false} is VALID [2022-04-15 12:53:17,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {18835#false} assume 0 == ~cond; {18835#false} is VALID [2022-04-15 12:53:17,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {18835#false} assume !false; {18835#false} is VALID [2022-04-15 12:53:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:53:17,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:53:17,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737610698] [2022-04-15 12:53:17,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737610698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:17,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:17,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:53:19,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:19,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1091567993] [2022-04-15 12:53:19,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1091567993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:19,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:19,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 12:53:19,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977641002] [2022-04-15 12:53:19,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:19,661 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 40 states have internal predecessors, (118), 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 122 [2022-04-15 12:53:19,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:19,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 40 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:20,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:20,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 12:53:20,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:20,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 12:53:20,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:53:20,992 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 40 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:20,552 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2022-04-15 12:54:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 12:54:20,552 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 40 states have internal predecessors, (118), 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 122 [2022-04-15 12:54:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 40 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2022-04-15 12:54:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 40 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2022-04-15 12:54:20,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 140 transitions. [2022-04-15 12:54:22,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:22,438 INFO L225 Difference]: With dead ends: 136 [2022-04-15 12:54:22,438 INFO L226 Difference]: Without dead ends: 128 [2022-04-15 12:54:22,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 8 SyntacticMatches, 75 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 12:54:22,440 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 87 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4599 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 4640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:54:22,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 204 Invalid, 4640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4599 Invalid, 0 Unknown, 0 Unchecked, 33.1s Time] [2022-04-15 12:54:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-15 12:54:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-04-15 12:54:22,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:22,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:22,467 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:22,467 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:22,469 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2022-04-15 12:54:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2022-04-15 12:54:22,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:22,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:22,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-15 12:54:22,469 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-15 12:54:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:22,471 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2022-04-15 12:54:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2022-04-15 12:54:22,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:22,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:22,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:22,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-04-15 12:54:22,473 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2022-04-15 12:54:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:22,473 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-04-15 12:54:22,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 40 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:22,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 128 transitions. [2022-04-15 12:54:23,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-04-15 12:54:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 12:54:23,848 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:23,848 INFO L499 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:23,848 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-15 12:54:23,848 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1490510531, now seen corresponding path program 38 times [2022-04-15 12:54:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:23,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2095744983] [2022-04-15 12:54:24,241 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:54:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash 977744272, now seen corresponding path program 1 times [2022-04-15 12:54:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:24,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412949712] [2022-04-15 12:54:24,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:24,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {19744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19738#true} is VALID [2022-04-15 12:54:24,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {19738#true} assume true; {19738#true} is VALID [2022-04-15 12:54:24,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19738#true} {19738#true} #41#return; {19738#true} is VALID [2022-04-15 12:54:24,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {19738#true} call ULTIMATE.init(); {19744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:54:24,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {19744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19738#true} is VALID [2022-04-15 12:54:24,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {19738#true} assume true; {19738#true} is VALID [2022-04-15 12:54:24,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19738#true} {19738#true} #41#return; {19738#true} is VALID [2022-04-15 12:54:24,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {19738#true} call #t~ret7 := main(); {19738#true} is VALID [2022-04-15 12:54:24,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {19738#true} ~x~0 := 0;~y~0 := 0; {19743#(= main_~x~0 0)} is VALID [2022-04-15 12:54:24,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {19743#(= main_~x~0 0)} [121] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_38 v_main_~x~0_Out_76))) (or (and (= v_main_~y~0_In_38 v_main_~y~0_Out_76) .cse0) (and (< (mod (+ 4294967295 v_main_~x~0_Out_76) 4294967296) 500000) (= v_main_~y~0_Out_76 v_main_~y~0_In_38) (= |v_main_#t~post6_Out_76| 0) (= v_main_~y~0_Out_76 0) .cse0))) InVars {main_~x~0=v_main_~x~0_In_38, main_~y~0=v_main_~y~0_In_38} OutVars{main_#t~post4=|v_main_#t~post4_Out_76|, main_~y~0=v_main_~y~0_Out_76, main_~x~0=v_main_~x~0_Out_76, main_#t~post6=|v_main_#t~post6_Out_76|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {19743#(= main_~x~0 0)} is VALID [2022-04-15 12:54:24,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {19743#(= main_~x~0 0)} [120] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {19739#false} is VALID [2022-04-15 12:54:24,271 INFO L272 TraceCheckUtils]: 8: Hoare triple {19739#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {19739#false} is VALID [2022-04-15 12:54:24,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {19739#false} ~cond := #in~cond; {19739#false} is VALID [2022-04-15 12:54:24,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {19739#false} assume 0 == ~cond; {19739#false} is VALID [2022-04-15 12:54:24,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {19739#false} assume !false; {19739#false} is VALID [2022-04-15 12:54:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:54:24,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:24,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412949712] [2022-04-15 12:54:24,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412949712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:24,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:24,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:54:26,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:26,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2095744983] [2022-04-15 12:54:26,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2095744983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:26,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:26,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 12:54:26,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320336748] [2022-04-15 12:54:26,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:26,247 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.880952380952381) internal successors, (121), 41 states have internal predecessors, (121), 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 125 [2022-04-15 12:54:26,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:26,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.880952380952381) internal successors, (121), 41 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:27,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:27,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 12:54:27,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:27,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 12:54:27,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:54:27,877 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 42 states, 42 states have (on average 2.880952380952381) internal successors, (121), 41 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:39,681 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2022-04-15 12:55:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 12:55:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.880952380952381) internal successors, (121), 41 states have internal predecessors, (121), 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 125 [2022-04-15 12:55:39,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.880952380952381) internal successors, (121), 41 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 143 transitions. [2022-04-15 12:55:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.880952380952381) internal successors, (121), 41 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 143 transitions. [2022-04-15 12:55:39,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 143 transitions. [2022-04-15 12:55:41,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:41,802 INFO L225 Difference]: With dead ends: 139 [2022-04-15 12:55:41,802 INFO L226 Difference]: Without dead ends: 131 [2022-04-15 12:55:41,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 8 SyntacticMatches, 77 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 12:55:41,803 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 89 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 4837 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 4879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:41,803 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 209 Invalid, 4879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4837 Invalid, 0 Unknown, 0 Unchecked, 40.5s Time] [2022-04-15 12:55:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-15 12:55:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2022-04-15 12:55:41,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:41,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 130 states, 125 states have (on average 1.016) internal successors, (127), 125 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:41,826 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 130 states, 125 states have (on average 1.016) internal successors, (127), 125 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:41,826 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 130 states, 125 states have (on average 1.016) internal successors, (127), 125 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:41,828 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2022-04-15 12:55:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-04-15 12:55:41,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:41,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:41,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 125 states have (on average 1.016) internal successors, (127), 125 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-15 12:55:41,829 INFO L87 Difference]: Start difference. First operand has 130 states, 125 states have (on average 1.016) internal successors, (127), 125 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-15 12:55:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:41,830 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2022-04-15 12:55:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-04-15 12:55:41,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:41,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:41,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:41,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.016) internal successors, (127), 125 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2022-04-15 12:55:41,832 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 125 [2022-04-15 12:55:41,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:41,833 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2022-04-15 12:55:41,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.880952380952381) internal successors, (121), 41 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:41,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 131 transitions. [2022-04-15 12:55:43,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-15 12:55:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-15 12:55:43,438 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:43,438 INFO L499 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:43,438 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-15 12:55:43,438 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:43,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash 717149323, now seen corresponding path program 39 times [2022-04-15 12:55:43,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:43,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2126918792] [2022-04-15 12:55:43,660 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:43,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1036849616, now seen corresponding path program 1 times [2022-04-15 12:55:43,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:43,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646307688] [2022-04-15 12:55:43,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:43,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:43,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:43,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {20669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20663#true} is VALID [2022-04-15 12:55:43,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {20663#true} assume true; {20663#true} is VALID [2022-04-15 12:55:43,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20663#true} {20663#true} #41#return; {20663#true} is VALID [2022-04-15 12:55:43,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {20663#true} call ULTIMATE.init(); {20669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:43,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {20669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20663#true} is VALID [2022-04-15 12:55:43,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {20663#true} assume true; {20663#true} is VALID [2022-04-15 12:55:43,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20663#true} {20663#true} #41#return; {20663#true} is VALID [2022-04-15 12:55:43,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {20663#true} call #t~ret7 := main(); {20663#true} is VALID [2022-04-15 12:55:43,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {20663#true} ~x~0 := 0;~y~0 := 0; {20668#(= main_~x~0 0)} is VALID [2022-04-15 12:55:43,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {20668#(= main_~x~0 0)} [123] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_39 v_main_~x~0_Out_78))) (or (and (= v_main_~y~0_Out_78 v_main_~y~0_In_39) (< (mod (+ 4294967295 v_main_~x~0_Out_78) 4294967296) 500000) (= |v_main_#t~post6_Out_78| 0) (= v_main_~y~0_Out_78 0) .cse0) (and (= v_main_~y~0_In_39 v_main_~y~0_Out_78) .cse0))) InVars {main_~x~0=v_main_~x~0_In_39, main_~y~0=v_main_~y~0_In_39} OutVars{main_#t~post4=|v_main_#t~post4_Out_78|, main_~y~0=v_main_~y~0_Out_78, main_~x~0=v_main_~x~0_Out_78, main_#t~post6=|v_main_#t~post6_Out_78|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {20668#(= main_~x~0 0)} is VALID [2022-04-15 12:55:43,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {20668#(= main_~x~0 0)} [122] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {20664#false} is VALID [2022-04-15 12:55:43,702 INFO L272 TraceCheckUtils]: 8: Hoare triple {20664#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {20664#false} is VALID [2022-04-15 12:55:43,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {20664#false} ~cond := #in~cond; {20664#false} is VALID [2022-04-15 12:55:43,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {20664#false} assume 0 == ~cond; {20664#false} is VALID [2022-04-15 12:55:43,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {20664#false} assume !false; {20664#false} is VALID [2022-04-15 12:55:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:43,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:43,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646307688] [2022-04-15 12:55:43,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646307688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:43,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:43,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:55:45,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:45,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2126918792] [2022-04-15 12:55:45,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2126918792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:45,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:45,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 12:55:45,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374074407] [2022-04-15 12:55:45,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:45,728 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 42 states have internal predecessors, (124), 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 128 [2022-04-15 12:55:45,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:45,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 42 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:47,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:47,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 12:55:47,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:47,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 12:55:47,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:55:47,584 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 42 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:12,268 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-04-15 12:57:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 12:57:12,268 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 42 states have internal predecessors, (124), 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 128 [2022-04-15 12:57:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 42 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 146 transitions. [2022-04-15 12:57:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 42 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 146 transitions. [2022-04-15 12:57:12,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 146 transitions. [2022-04-15 12:57:14,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:14,633 INFO L225 Difference]: With dead ends: 142 [2022-04-15 12:57:14,633 INFO L226 Difference]: Without dead ends: 134 [2022-04-15 12:57:14,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 8 SyntacticMatches, 79 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 12:57:14,634 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 91 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 5081 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 5124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 5081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:14,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 214 Invalid, 5124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 5081 Invalid, 0 Unknown, 0 Unchecked, 48.0s Time] [2022-04-15 12:57:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-15 12:57:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-04-15 12:57:14,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:14,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:14,655 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:14,655 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:14,657 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2022-04-15 12:57:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2022-04-15 12:57:14,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:14,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:14,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-15 12:57:14,658 INFO L87 Difference]: Start difference. First operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-15 12:57:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:14,659 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2022-04-15 12:57:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2022-04-15 12:57:14,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:14,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:14,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:14,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2022-04-15 12:57:14,661 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2022-04-15 12:57:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:14,661 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2022-04-15 12:57:14,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 42 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:14,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 134 transitions. [2022-04-15 12:57:16,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2022-04-15 12:57:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 12:57:16,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:16,425 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:16,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-15 12:57:16,425 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:16,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash -282022461, now seen corresponding path program 40 times [2022-04-15 12:57:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:16,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1313611212] [2022-04-15 12:57:16,601 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1095954960, now seen corresponding path program 1 times [2022-04-15 12:57:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:16,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321120283] [2022-04-15 12:57:16,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:16,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:16,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {21615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21609#true} is VALID [2022-04-15 12:57:16,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {21609#true} assume true; {21609#true} is VALID [2022-04-15 12:57:16,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21609#true} {21609#true} #41#return; {21609#true} is VALID [2022-04-15 12:57:16,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {21609#true} call ULTIMATE.init(); {21615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:16,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {21615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21609#true} is VALID [2022-04-15 12:57:16,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {21609#true} assume true; {21609#true} is VALID [2022-04-15 12:57:16,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21609#true} {21609#true} #41#return; {21609#true} is VALID [2022-04-15 12:57:16,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {21609#true} call #t~ret7 := main(); {21609#true} is VALID [2022-04-15 12:57:16,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {21609#true} ~x~0 := 0;~y~0 := 0; {21614#(= main_~x~0 0)} is VALID [2022-04-15 12:57:16,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {21614#(= main_~x~0 0)} [125] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_40 v_main_~x~0_Out_80))) (or (and (= v_main_~y~0_In_40 v_main_~y~0_Out_80) .cse0) (and (< (mod (+ 4294967295 v_main_~x~0_Out_80) 4294967296) 500000) .cse0 (= v_main_~y~0_Out_80 0) (= |v_main_#t~post6_Out_80| 0) (= v_main_~y~0_Out_80 v_main_~y~0_In_40)))) InVars {main_~x~0=v_main_~x~0_In_40, main_~y~0=v_main_~y~0_In_40} OutVars{main_#t~post4=|v_main_#t~post4_Out_80|, main_~y~0=v_main_~y~0_Out_80, main_~x~0=v_main_~x~0_Out_80, main_#t~post6=|v_main_#t~post6_Out_80|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {21614#(= main_~x~0 0)} is VALID [2022-04-15 12:57:16,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {21614#(= main_~x~0 0)} [124] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {21610#false} is VALID [2022-04-15 12:57:16,639 INFO L272 TraceCheckUtils]: 8: Hoare triple {21610#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {21610#false} is VALID [2022-04-15 12:57:16,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {21610#false} ~cond := #in~cond; {21610#false} is VALID [2022-04-15 12:57:16,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {21610#false} assume 0 == ~cond; {21610#false} is VALID [2022-04-15 12:57:16,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {21610#false} assume !false; {21610#false} is VALID [2022-04-15 12:57:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:57:16,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:16,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321120283] [2022-04-15 12:57:16,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321120283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:16,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:16,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:57:18,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:18,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1313611212] [2022-04-15 12:57:18,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1313611212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:18,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:18,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 12:57:18,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43378389] [2022-04-15 12:57:18,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:18,603 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.8863636363636362) internal successors, (127), 43 states have internal predecessors, (127), 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 131 [2022-04-15 12:57:18,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:18,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.8863636363636362) internal successors, (127), 43 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:20,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:20,707 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 12:57:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:20,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 12:57:20,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:57:20,708 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand has 44 states, 44 states have (on average 2.8863636363636362) internal successors, (127), 43 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:59,962 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2022-04-15 12:58:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 12:58:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.8863636363636362) internal successors, (127), 43 states have internal predecessors, (127), 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 131 [2022-04-15 12:58:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.8863636363636362) internal successors, (127), 43 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 149 transitions. [2022-04-15 12:58:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.8863636363636362) internal successors, (127), 43 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 149 transitions. [2022-04-15 12:58:59,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 149 transitions. [2022-04-15 12:59:02,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:02,654 INFO L225 Difference]: With dead ends: 145 [2022-04-15 12:59:02,654 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 12:59:02,655 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 8 SyntacticMatches, 81 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 12:59:02,655 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 93 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 5331 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 5375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 5331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:02,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 219 Invalid, 5375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 5331 Invalid, 0 Unknown, 0 Unchecked, 56.7s Time] [2022-04-15 12:59:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 12:59:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2022-04-15 12:59:02,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:02,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 136 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:02,680 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 136 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:02,680 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 136 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:02,681 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2022-04-15 12:59:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-15 12:59:02,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:02,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:02,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-15 12:59:02,682 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-15 12:59:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:02,683 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2022-04-15 12:59:02,683 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-15 12:59:02,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:02,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:02,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:02,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2022-04-15 12:59:02,685 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 131 [2022-04-15 12:59:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:02,686 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2022-04-15 12:59:02,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.8863636363636362) internal successors, (127), 43 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:02,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 137 transitions. [2022-04-15 12:59:04,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2022-04-15 12:59:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 12:59:04,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:59:04,725 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:59:04,725 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-15 12:59:04,725 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:04,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:04,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1809688971, now seen corresponding path program 41 times [2022-04-15 12:59:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:04,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1181082971] [2022-04-15 12:59:04,917 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:59:04,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1155060304, now seen corresponding path program 1 times [2022-04-15 12:59:04,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:04,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498015062] [2022-04-15 12:59:04,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:04,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:04,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {22582#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22576#true} is VALID [2022-04-15 12:59:04,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {22576#true} assume true; {22576#true} is VALID [2022-04-15 12:59:04,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22576#true} {22576#true} #41#return; {22576#true} is VALID [2022-04-15 12:59:04,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {22576#true} call ULTIMATE.init(); {22582#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:04,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {22582#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22576#true} is VALID [2022-04-15 12:59:04,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {22576#true} assume true; {22576#true} is VALID [2022-04-15 12:59:04,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22576#true} {22576#true} #41#return; {22576#true} is VALID [2022-04-15 12:59:04,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {22576#true} call #t~ret7 := main(); {22576#true} is VALID [2022-04-15 12:59:04,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {22576#true} ~x~0 := 0;~y~0 := 0; {22581#(= main_~x~0 0)} is VALID [2022-04-15 12:59:04,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {22581#(= main_~x~0 0)} [127] L9-2-->L9-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_In_41 v_main_~x~0_Out_82))) (or (and (= v_main_~y~0_In_41 v_main_~y~0_Out_82) .cse0) (and (< (mod (+ 4294967295 v_main_~x~0_Out_82) 4294967296) 500000) (= v_main_~y~0_Out_82 v_main_~y~0_In_41) .cse0 (= |v_main_#t~post6_Out_82| 0) (= v_main_~y~0_Out_82 0)))) InVars {main_~x~0=v_main_~x~0_In_41, main_~y~0=v_main_~y~0_In_41} OutVars{main_#t~post4=|v_main_#t~post4_Out_82|, main_~y~0=v_main_~y~0_Out_82, main_~x~0=v_main_~x~0_Out_82, main_#t~post6=|v_main_#t~post6_Out_82|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post6] {22581#(= main_~x~0 0)} is VALID [2022-04-15 12:59:04,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {22581#(= main_~x~0 0)} [126] L9-3_primed-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {22577#false} is VALID [2022-04-15 12:59:04,943 INFO L272 TraceCheckUtils]: 8: Hoare triple {22577#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {22577#false} is VALID [2022-04-15 12:59:04,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {22577#false} ~cond := #in~cond; {22577#false} is VALID [2022-04-15 12:59:04,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {22577#false} assume 0 == ~cond; {22577#false} is VALID [2022-04-15 12:59:04,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {22577#false} assume !false; {22577#false} is VALID [2022-04-15 12:59:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:59:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:04,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498015062] [2022-04-15 12:59:04,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498015062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:04,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:04,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:59:06,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:59:06,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1181082971] [2022-04-15 12:59:06,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1181082971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:06,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:06,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 12:59:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586740274] [2022-04-15 12:59:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:59:06,969 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 44 states have internal predecessors, (130), 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 134 [2022-04-15 12:59:06,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:59:06,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 44 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:09,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:09,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 12:59:09,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:09,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 12:59:09,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:59:09,328 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 44 states have internal predecessors, (130), 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)