/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:12:26,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:12:26,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:12:26,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:12:26,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:12:26,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:12:26,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:12:26,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:12:26,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:12:26,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:12:26,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:12:26,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:12:26,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:12:26,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:12:26,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:12:26,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:12:26,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:12:26,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:12:26,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:12:26,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:12:26,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:12:26,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:12:26,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:12:26,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:12:26,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:12:26,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:12:26,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:12:26,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:12:26,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:12:26,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:12:26,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:12:26,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:12:26,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:12:26,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:12:26,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:12:26,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:12:26,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:12:26,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:12:26,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:12:26,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:12:26,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:12:26,672 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 21:12:26,680 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:12:26,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:12:26,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:12:26,682 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:12:26,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:12:26,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:12:26,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:12:26,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:12:26,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:12:26,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:12:26,683 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:12:26,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:12:26,683 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:12:26,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:12:26,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:12:26,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:12:26,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:12:26,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:12:26,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:12:26,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:12:26,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:12:26,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:12:26,684 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:12:26,684 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-01-31 21:12:26,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:12:26,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:12:26,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:12:26,864 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:12:26,865 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:12:26,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-01-31 21:12:26,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e884947b2/2723016476ef4e049ea3903025199058/FLAGa341ebfaa [2022-01-31 21:12:27,256 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:12:27,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-01-31 21:12:27,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e884947b2/2723016476ef4e049ea3903025199058/FLAGa341ebfaa [2022-01-31 21:12:27,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e884947b2/2723016476ef4e049ea3903025199058 [2022-01-31 21:12:27,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:12:27,278 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:12:27,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:12:27,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:12:27,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:12:27,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:12:27" (1/1) ... [2022-01-31 21:12:27,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a5fc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:27, skipping insertion in model container [2022-01-31 21:12:27,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:12:27" (1/1) ... [2022-01-31 21:12:27,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:12:27,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:12:27,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c[368,381] [2022-01-31 21:12:27,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:12:27,432 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:12:27,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c[368,381] [2022-01-31 21:12:27,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:12:27,451 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:12:27,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:27 WrapperNode [2022-01-31 21:12:27,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:12:27,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:12:27,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:12:27,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:12:27,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:27" (1/1) ... [2022-01-31 21:12:27,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:27" (1/1) ... [2022-01-31 21:12:27,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:27" (1/1) ... [2022-01-31 21:12:27,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:27" (1/1) ... [2022-01-31 21:12:27,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:27" (1/1) ... [2022-01-31 21:12:27,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:27" (1/1) ... [2022-01-31 21:12:27,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:27" (1/1) ... [2022-01-31 21:12:27,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:12:27,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:12:27,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:12:27,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:12:27,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:27" (1/1) ... [2022-01-31 21:12:27,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:12:27,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:12:27,488 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-01-31 21:12:27,504 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-01-31 21:12:27,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:12:27,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:12:27,517 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:12:27,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 21:12:27,517 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:12:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:12:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:12:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:12:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:12:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 21:12:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 21:12:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:12:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:12:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:12:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:12:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:12:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:12:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:12:27,561 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:12:27,563 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:12:27,665 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:12:27,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:12:27,669 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 21:12:27,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:12:27 BoogieIcfgContainer [2022-01-31 21:12:27,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:12:27,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:12:27,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:12:27,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:12:27,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:12:27" (1/3) ... [2022-01-31 21:12:27,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629583fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:12:27, skipping insertion in model container [2022-01-31 21:12:27,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:27" (2/3) ... [2022-01-31 21:12:27,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629583fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:12:27, skipping insertion in model container [2022-01-31 21:12:27,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:12:27" (3/3) ... [2022-01-31 21:12:27,691 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de32.c [2022-01-31 21:12:27,694 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:12:27,694 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:12:27,733 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:12:27,737 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-01-31 21:12:27,737 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:12:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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-01-31 21:12:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 21:12:27,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:27,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:27,766 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:27,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:27,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-01-31 21:12:27,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:27,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1717037693] [2022-01-31 21:12:27,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:27,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:27,844 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:12:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:28,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:28,033 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:28,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1717037693] [2022-01-31 21:12:28,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1717037693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:28,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:28,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:12:28,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23248830] [2022-01-31 21:12:28,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:28,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:12:28,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:28,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:12:28,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:12:28,062 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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 6 states, 6 states have (on average 1.6666666666666667) 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-01-31 21:12:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:28,201 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-01-31 21:12:28,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:12:28,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) 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-01-31 21:12:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:28,206 INFO L225 Difference]: With dead ends: 47 [2022-01-31 21:12:28,207 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 21:12:28,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:12:28,212 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:28,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:12:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 21:12:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-31 21:12:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-01-31 21:12:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-01-31 21:12:28,240 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2022-01-31 21:12:28,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:28,240 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-01-31 21:12:28,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) 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-01-31 21:12:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-01-31 21:12:28,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 21:12:28,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:28,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:28,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:12:28,243 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 1 times [2022-01-31 21:12:28,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:28,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1724731238] [2022-01-31 21:12:28,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:28,374 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:28,374 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:28,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:28,399 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:28,428 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:28,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:28,517 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:28,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1724731238] [2022-01-31 21:12:28,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1724731238] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:28,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:28,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:12:28,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95395808] [2022-01-31 21:12:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:28,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:12:28,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:12:28,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:12:28,522 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:28,594 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-01-31 21:12:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:12:28,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 21:12:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:28,595 INFO L225 Difference]: With dead ends: 30 [2022-01-31 21:12:28,596 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 21:12:28,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:12:28,597 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:28,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:12:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 21:12:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-01-31 21:12:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-01-31 21:12:28,606 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-01-31 21:12:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:28,607 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-01-31 21:12:28,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-01-31 21:12:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 21:12:28,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:28,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:28,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:12:28,609 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:28,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:28,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1179931951, now seen corresponding path program 1 times [2022-01-31 21:12:28,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:28,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [225021306] [2022-01-31 21:12:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:28,685 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:28,685 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:28,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:28,692 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:28,711 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:28,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:28,777 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:28,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [225021306] [2022-01-31 21:12:28,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [225021306] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:28,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:28,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:12:28,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707845200] [2022-01-31 21:12:28,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:28,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:12:28,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:28,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:12:28,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:12:28,779 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:28,863 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-01-31 21:12:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:12:28,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 21:12:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:28,864 INFO L225 Difference]: With dead ends: 27 [2022-01-31 21:12:28,864 INFO L226 Difference]: Without dead ends: 18 [2022-01-31 21:12:28,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:12:28,865 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:28,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 45 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:12:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-31 21:12:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-31 21:12:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-01-31 21:12:28,869 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-01-31 21:12:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:28,869 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-01-31 21:12:28,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-01-31 21:12:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 21:12:28,869 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:28,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:28,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:12:28,870 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 1 times [2022-01-31 21:12:28,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:28,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [243065611] [2022-01-31 21:12:28,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:28,946 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:28,947 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:28,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:28,952 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:28,969 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:29,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:29,306 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:29,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [243065611] [2022-01-31 21:12:29,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [243065611] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:29,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:29,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:12:29,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978420042] [2022-01-31 21:12:29,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:29,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:12:29,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:12:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:12:29,308 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:29,687 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-01-31 21:12:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:12:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 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 16 [2022-01-31 21:12:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:29,688 INFO L225 Difference]: With dead ends: 27 [2022-01-31 21:12:29,688 INFO L226 Difference]: Without dead ends: 20 [2022-01-31 21:12:29,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:12:29,690 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:29,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 22 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 26 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-01-31 21:12:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-31 21:12:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-01-31 21:12:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-01-31 21:12:29,694 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-01-31 21:12:29,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:29,694 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-01-31 21:12:29,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-01-31 21:12:29,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 21:12:29,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:29,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:29,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:12:29,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:29,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1578117650, now seen corresponding path program 1 times [2022-01-31 21:12:29,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:29,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1817614247] [2022-01-31 21:12:29,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:29,731 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:29,731 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:29,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:29,737 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:12:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:29,745 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:12:29,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:29,784 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:29,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1817614247] [2022-01-31 21:12:29,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1817614247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:29,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:29,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:12:29,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832303507] [2022-01-31 21:12:29,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:29,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:12:29,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:29,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:12:29,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:12:29,786 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:29,833 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-01-31 21:12:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:12:29,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 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 16 [2022-01-31 21:12:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:29,834 INFO L225 Difference]: With dead ends: 23 [2022-01-31 21:12:29,834 INFO L226 Difference]: Without dead ends: 18 [2022-01-31 21:12:29,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:12:29,835 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:29,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:12:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-31 21:12:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-31 21:12:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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-01-31 21:12:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-01-31 21:12:29,839 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-01-31 21:12:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:29,840 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-01-31 21:12:29,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-01-31 21:12:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:12:29,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:29,840 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:29,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:12:29,841 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:29,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-01-31 21:12:29,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:29,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2001396440] [2022-01-31 21:12:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:29,889 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:29,890 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:29,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:29,894 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:29,912 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:29,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:29,975 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:29,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2001396440] [2022-01-31 21:12:29,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2001396440] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:29,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:29,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:12:29,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86214070] [2022-01-31 21:12:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:29,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:12:29,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:29,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:12:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:12:29,977 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 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-01-31 21:12:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:30,065 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-01-31 21:12:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:12:30,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 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-01-31 21:12:30,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:30,066 INFO L225 Difference]: With dead ends: 28 [2022-01-31 21:12:30,066 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 21:12:30,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:12:30,069 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:30,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 40 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:12:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 21:12:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-01-31 21:12:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-01-31 21:12:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-01-31 21:12:30,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2022-01-31 21:12:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:30,081 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-01-31 21:12:30,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 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-01-31 21:12:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-01-31 21:12:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:12:30,082 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:30,082 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:30,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:12:30,083 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash 656236558, now seen corresponding path program 2 times [2022-01-31 21:12:30,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:30,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1842198356] [2022-01-31 21:12:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:30,183 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:30,184 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:30,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:30,188 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:30,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:30,285 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:30,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1842198356] [2022-01-31 21:12:30,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1842198356] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:30,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:30,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:12:30,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882433311] [2022-01-31 21:12:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:30,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:12:30,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:30,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:12:30,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:12:30,287 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:30,415 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-01-31 21:12:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:12:30,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 21:12:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:30,417 INFO L225 Difference]: With dead ends: 33 [2022-01-31 21:12:30,417 INFO L226 Difference]: Without dead ends: 20 [2022-01-31 21:12:30,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:12:30,419 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:30,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 38 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:12:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-31 21:12:30,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-01-31 21:12:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-01-31 21:12:30,428 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-01-31 21:12:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:30,428 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-01-31 21:12:30,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-01-31 21:12:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 21:12:30,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:30,429 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:30,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:12:30,429 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1137046944, now seen corresponding path program 3 times [2022-01-31 21:12:30,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:30,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [300619457] [2022-01-31 21:12:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:30,462 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:30,463 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:30,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:30,467 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:30,486 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:30,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:30,544 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:30,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [300619457] [2022-01-31 21:12:30,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [300619457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:30,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:30,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:12:30,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105059608] [2022-01-31 21:12:30,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:30,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:12:30,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:30,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:12:30,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:12:30,545 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:30,662 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-01-31 21:12:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:12:30,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 21:12:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:30,663 INFO L225 Difference]: With dead ends: 26 [2022-01-31 21:12:30,663 INFO L226 Difference]: Without dead ends: 21 [2022-01-31 21:12:30,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:12:30,664 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:30,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 46 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:12:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-31 21:12:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-31 21:12:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-01-31 21:12:30,669 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-01-31 21:12:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:30,669 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-01-31 21:12:30,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-01-31 21:12:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:12:30,670 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:30,670 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:30,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:12:30,670 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:30,670 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 4 times [2022-01-31 21:12:30,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:30,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1072390512] [2022-01-31 21:12:30,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:30,711 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:30,712 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:30,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:30,716 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:12:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:30,728 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:12:30,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:30,810 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:30,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1072390512] [2022-01-31 21:12:30,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1072390512] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:30,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:30,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:12:30,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231396199] [2022-01-31 21:12:30,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:30,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:12:30,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:30,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:12:30,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:12:30,812 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 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-01-31 21:12:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:30,961 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-01-31 21:12:30,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:12:30,961 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 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-01-31 21:12:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:30,962 INFO L225 Difference]: With dead ends: 34 [2022-01-31 21:12:30,962 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 21:12:30,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:12:30,962 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:30,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 35 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:12:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 21:12:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2022-01-31 21:12:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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-01-31 21:12:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-01-31 21:12:30,968 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2022-01-31 21:12:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:30,968 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-01-31 21:12:30,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 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-01-31 21:12:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-01-31 21:12:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 21:12:30,969 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:30,969 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:30,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:12:30,969 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash -676577280, now seen corresponding path program 5 times [2022-01-31 21:12:30,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:30,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1449908968] [2022-01-31 21:12:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:31,054 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:31,054 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:31,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:31,058 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:31,068 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:31,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:31,180 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:31,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1449908968] [2022-01-31 21:12:31,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1449908968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:31,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:31,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:12:31,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911663765] [2022-01-31 21:12:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:31,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:12:31,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:31,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:12:31,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:12:31,182 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:31,405 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-01-31 21:12:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:12:31,405 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 21:12:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:31,406 INFO L225 Difference]: With dead ends: 39 [2022-01-31 21:12:31,406 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 21:12:31,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:12:31,407 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:31,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 53 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:12:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 21:12:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-31 21:12:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-01-31 21:12:31,412 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2022-01-31 21:12:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:31,412 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-01-31 21:12:31,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-01-31 21:12:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 21:12:31,413 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:31,413 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:31,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:12:31,413 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1250397230, now seen corresponding path program 6 times [2022-01-31 21:12:31,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:31,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [876887548] [2022-01-31 21:12:31,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:31,454 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:31,454 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:31,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:31,458 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:31,467 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:31,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:31,590 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:31,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [876887548] [2022-01-31 21:12:31,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [876887548] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:31,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:31,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:12:31,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212264160] [2022-01-31 21:12:31,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:31,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:12:31,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:31,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:12:31,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:12:31,592 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:31,840 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-01-31 21:12:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:12:31,841 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 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 22 [2022-01-31 21:12:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:31,841 INFO L225 Difference]: With dead ends: 29 [2022-01-31 21:12:31,841 INFO L226 Difference]: Without dead ends: 24 [2022-01-31 21:12:31,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:12:31,842 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:31,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 56 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:12:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-31 21:12:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-31 21:12:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 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-01-31 21:12:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-01-31 21:12:31,848 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2022-01-31 21:12:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:31,848 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-01-31 21:12:31,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-01-31 21:12:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:12:31,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:31,849 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:31,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:12:31,849 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:31,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:31,849 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 7 times [2022-01-31 21:12:31,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:31,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [417360956] [2022-01-31 21:12:31,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:31,877 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:31,877 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:31,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:31,881 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:31,890 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:31,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:31,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-01-31 21:12:31,999 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:31,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [417360956] [2022-01-31 21:12:31,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [417360956] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:31,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:31,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:12:31,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105221493] [2022-01-31 21:12:31,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:31,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:12:31,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:32,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:12:32,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:12:32,000 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 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-01-31 21:12:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:32,204 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-01-31 21:12:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:12:32,204 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 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-01-31 21:12:32,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:32,204 INFO L225 Difference]: With dead ends: 40 [2022-01-31 21:12:32,205 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 21:12:32,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:12:32,205 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:32,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 35 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:12:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 21:12:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2022-01-31 21:12:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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-01-31 21:12:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-01-31 21:12:32,212 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2022-01-31 21:12:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:32,213 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-01-31 21:12:32,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 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-01-31 21:12:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-01-31 21:12:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 21:12:32,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:32,213 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:32,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:12:32,213 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash 144737870, now seen corresponding path program 8 times [2022-01-31 21:12:32,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:32,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [728840922] [2022-01-31 21:12:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:32,250 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:32,251 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:32,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:32,254 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:32,265 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:32,421 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:32,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [728840922] [2022-01-31 21:12:32,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [728840922] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:32,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:32,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:12:32,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763260519] [2022-01-31 21:12:32,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:32,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:12:32,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:32,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:12:32,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:12:32,422 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:32,830 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-01-31 21:12:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:12:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 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 24 [2022-01-31 21:12:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:32,831 INFO L225 Difference]: With dead ends: 45 [2022-01-31 21:12:32,831 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 21:12:32,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:12:32,832 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:32,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:12:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 21:12:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 21:12:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-01-31 21:12:32,838 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2022-01-31 21:12:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:32,838 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-01-31 21:12:32,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-01-31 21:12:32,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 21:12:32,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:32,839 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:32,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:12:32,839 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:32,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash -405165152, now seen corresponding path program 9 times [2022-01-31 21:12:32,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:32,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [988978764] [2022-01-31 21:12:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:32,871 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:32,872 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:32,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:32,875 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:32,885 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:32,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:33,062 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:33,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [988978764] [2022-01-31 21:12:33,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [988978764] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:33,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:33,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:12:33,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416451578] [2022-01-31 21:12:33,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:33,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:12:33,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:33,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:12:33,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:12:33,063 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:33,592 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-01-31 21:12:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:12:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 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 25 [2022-01-31 21:12:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:33,593 INFO L225 Difference]: With dead ends: 32 [2022-01-31 21:12:33,593 INFO L226 Difference]: Without dead ends: 27 [2022-01-31 21:12:33,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:12:33,594 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:33,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 76 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:12:33,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-31 21:12:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-31 21:12:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-01-31 21:12:33,601 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-01-31 21:12:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:33,601 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-01-31 21:12:33,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-01-31 21:12:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 21:12:33,601 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:33,601 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:33,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:12:33,601 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:33,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:33,602 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 10 times [2022-01-31 21:12:33,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:33,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1346050881] [2022-01-31 21:12:33,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:33,642 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:33,643 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:33,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:33,646 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:33,657 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:33,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:33,830 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:33,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1346050881] [2022-01-31 21:12:33,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1346050881] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:33,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:33,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:12:33,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491233772] [2022-01-31 21:12:33,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:33,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:12:33,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:33,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:12:33,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:12:33,831 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 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-01-31 21:12:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:34,188 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-01-31 21:12:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:12:34,188 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 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-01-31 21:12:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:34,189 INFO L225 Difference]: With dead ends: 46 [2022-01-31 21:12:34,189 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 21:12:34,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:12:34,189 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:34,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 35 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:12:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 21:12:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-01-31 21:12:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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-01-31 21:12:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-01-31 21:12:34,197 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2022-01-31 21:12:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:34,197 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-01-31 21:12:34,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 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-01-31 21:12:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-01-31 21:12:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 21:12:34,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:34,198 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:34,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:12:34,198 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:34,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1712811712, now seen corresponding path program 11 times [2022-01-31 21:12:34,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:34,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1430521355] [2022-01-31 21:12:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:34,229 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:34,230 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:34,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:34,233 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:34,249 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:34,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:34,468 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:34,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1430521355] [2022-01-31 21:12:34,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1430521355] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:34,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:34,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:12:34,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259340447] [2022-01-31 21:12:34,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:34,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:12:34,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:12:34,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:12:34,470 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:35,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:35,096 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-01-31 21:12:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:12:35,096 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 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 27 [2022-01-31 21:12:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:35,097 INFO L225 Difference]: With dead ends: 51 [2022-01-31 21:12:35,097 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 21:12:35,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 21:12:35,098 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:35,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 68 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:12:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 21:12:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 21:12:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-01-31 21:12:35,105 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2022-01-31 21:12:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:35,105 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-01-31 21:12:35,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-01-31 21:12:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 21:12:35,105 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:35,105 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:35,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:12:35,106 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:35,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1642818962, now seen corresponding path program 12 times [2022-01-31 21:12:35,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:35,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [740838005] [2022-01-31 21:12:35,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:35,140 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:35,140 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:35,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:35,143 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:35,154 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:35,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:35,449 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:35,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [740838005] [2022-01-31 21:12:35,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [740838005] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:35,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:35,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:12:35,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934259952] [2022-01-31 21:12:35,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:35,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:12:35,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:35,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:12:35,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:12:35,450 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:36,447 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-01-31 21:12:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:12:36,448 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 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 28 [2022-01-31 21:12:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:36,448 INFO L225 Difference]: With dead ends: 35 [2022-01-31 21:12:36,448 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 21:12:36,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 21:12:36,449 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:36,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 71 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:12:36,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 21:12:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-31 21:12:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 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-01-31 21:12:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-01-31 21:12:36,457 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-01-31 21:12:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:36,457 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-01-31 21:12:36,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-01-31 21:12:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:12:36,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:36,457 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:36,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:12:36,457 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 13 times [2022-01-31 21:12:36,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:36,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [703440830] [2022-01-31 21:12:36,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:36,485 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:36,485 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:36,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:36,488 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:36,504 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:36,812 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:36,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [703440830] [2022-01-31 21:12:36,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [703440830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:36,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:36,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:12:36,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008183809] [2022-01-31 21:12:36,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:36,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:12:36,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:36,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:12:36,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:12:36,814 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 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-01-31 21:12:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:37,341 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-01-31 21:12:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:12:37,341 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 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-01-31 21:12:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:37,341 INFO L225 Difference]: With dead ends: 52 [2022-01-31 21:12:37,341 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 21:12:37,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:12:37,342 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:37,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 55 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:12:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 21:12:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2022-01-31 21:12:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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-01-31 21:12:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-01-31 21:12:37,351 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2022-01-31 21:12:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:37,351 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-01-31 21:12:37,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 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-01-31 21:12:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-01-31 21:12:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:12:37,352 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:37,352 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:37,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:12:37,352 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1392182130, now seen corresponding path program 14 times [2022-01-31 21:12:37,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:37,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [329000277] [2022-01-31 21:12:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:37,493 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:37,493 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:37,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:37,496 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:37,510 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:37,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:37,846 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:37,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [329000277] [2022-01-31 21:12:37,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [329000277] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:37,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:37,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:12:37,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250848498] [2022-01-31 21:12:37,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:37,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:12:37,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:37,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:12:37,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:12:37,847 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:39,041 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-01-31 21:12:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 21:12:39,041 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 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 30 [2022-01-31 21:12:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:39,041 INFO L225 Difference]: With dead ends: 57 [2022-01-31 21:12:39,041 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 21:12:39,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=1678, Unknown=0, NotChecked=0, Total=1892 [2022-01-31 21:12:39,042 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:39,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 78 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:12:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 21:12:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-31 21:12:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-01-31 21:12:39,050 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2022-01-31 21:12:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:39,051 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-01-31 21:12:39,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-01-31 21:12:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:12:39,051 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:39,051 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:39,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:12:39,062 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:39,062 INFO L85 PathProgramCache]: Analyzing trace with hash 43269344, now seen corresponding path program 15 times [2022-01-31 21:12:39,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:39,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1408549027] [2022-01-31 21:12:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:39,091 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:39,092 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:39,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:39,095 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:39,108 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:39,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:39,620 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:39,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1408549027] [2022-01-31 21:12:39,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1408549027] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:39,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:39,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:12:39,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030507935] [2022-01-31 21:12:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:39,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:12:39,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:39,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:12:39,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:12:39,621 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:41,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:41,583 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-01-31 21:12:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 21:12:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 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 31 [2022-01-31 21:12:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:41,583 INFO L225 Difference]: With dead ends: 38 [2022-01-31 21:12:41,583 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 21:12:41,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 21:12:41,584 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:41,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 81 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:12:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 21:12:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-01-31 21:12:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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-01-31 21:12:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-01-31 21:12:41,593 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2022-01-31 21:12:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:41,593 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-01-31 21:12:41,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-01-31 21:12:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 21:12:41,593 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:41,593 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:41,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:12:41,593 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:41,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 16 times [2022-01-31 21:12:41,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:41,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [351758267] [2022-01-31 21:12:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:41,653 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:41,653 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:41,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:41,657 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:41,680 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:41,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:42,096 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [351758267] [2022-01-31 21:12:42,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [351758267] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:42,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:42,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:12:42,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948682471] [2022-01-31 21:12:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:42,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:12:42,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:42,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:12:42,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:12:42,098 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 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-01-31 21:12:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:42,988 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-01-31 21:12:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:12:42,988 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 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-01-31 21:12:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:42,988 INFO L225 Difference]: With dead ends: 58 [2022-01-31 21:12:42,989 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 21:12:42,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 21:12:42,989 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:42,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 45 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:12:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 21:12:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2022-01-31 21:12:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 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-01-31 21:12:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-01-31 21:12:42,999 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-01-31 21:12:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:43,000 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-01-31 21:12:43,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 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-01-31 21:12:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-01-31 21:12:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 21:12:43,000 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:43,000 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:43,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:12:43,000 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash -263990656, now seen corresponding path program 17 times [2022-01-31 21:12:43,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:43,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2107797404] [2022-01-31 21:12:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:43,035 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:43,035 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:43,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:43,038 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:43,053 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:43,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:43,658 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:43,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2107797404] [2022-01-31 21:12:43,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2107797404] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:43,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:43,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:12:43,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980315270] [2022-01-31 21:12:43,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:43,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:12:43,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:43,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:12:43,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:12:43,660 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:45,606 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-01-31 21:12:45,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-31 21:12:45,606 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 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 33 [2022-01-31 21:12:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:45,607 INFO L225 Difference]: With dead ends: 63 [2022-01-31 21:12:45,607 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 21:12:45,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=263, Invalid=2287, Unknown=0, NotChecked=0, Total=2550 [2022-01-31 21:12:45,608 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:45,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 88 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:12:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 21:12:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-01-31 21:12:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-01-31 21:12:45,617 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2022-01-31 21:12:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:45,617 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-01-31 21:12:45,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-01-31 21:12:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 21:12:45,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:45,618 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:45,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 21:12:45,618 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:45,618 INFO L85 PathProgramCache]: Analyzing trace with hash -685840210, now seen corresponding path program 18 times [2022-01-31 21:12:45,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:45,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1159156345] [2022-01-31 21:12:45,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:45,658 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:45,658 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:45,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:45,661 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:45,676 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:45,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:46,546 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:46,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1159156345] [2022-01-31 21:12:46,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1159156345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:46,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:46,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 21:12:46,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393862358] [2022-01-31 21:12:46,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:46,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 21:12:46,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:46,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 21:12:46,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:12:46,548 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:50,740 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-01-31 21:12:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 21:12:50,740 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 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 34 [2022-01-31 21:12:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:50,741 INFO L225 Difference]: With dead ends: 41 [2022-01-31 21:12:50,741 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 21:12:50,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=312, Invalid=1758, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 21:12:50,742 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:50,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:12:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 21:12:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-01-31 21:12:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 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-01-31 21:12:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-01-31 21:12:50,752 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34 [2022-01-31 21:12:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:50,752 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-01-31 21:12:50,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-01-31 21:12:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:12:50,753 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:50,753 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:50,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 21:12:50,753 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:50,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:50,753 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 19 times [2022-01-31 21:12:50,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:50,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1266572484] [2022-01-31 21:12:50,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:50,795 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:50,795 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:50,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:50,798 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:50,816 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:50,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:51,548 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:51,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1266572484] [2022-01-31 21:12:51,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1266572484] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:51,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:51,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:12:51,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196619754] [2022-01-31 21:12:51,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:51,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:12:51,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:51,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:12:51,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:12:51,549 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 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-01-31 21:12:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:52,787 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-01-31 21:12:52,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:12:52,787 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 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-01-31 21:12:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:52,788 INFO L225 Difference]: With dead ends: 64 [2022-01-31 21:12:52,788 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 21:12:52,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=338, Invalid=994, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 21:12:52,788 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:52,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 40 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:12:52,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 21:12:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2022-01-31 21:12:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 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-01-31 21:12:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-01-31 21:12:52,800 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2022-01-31 21:12:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:52,800 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-01-31 21:12:52,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 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-01-31 21:12:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-01-31 21:12:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:12:52,801 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:52,801 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:52,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 21:12:52,801 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:52,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:52,801 INFO L85 PathProgramCache]: Analyzing trace with hash -858602802, now seen corresponding path program 20 times [2022-01-31 21:12:52,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:52,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1184943952] [2022-01-31 21:12:52,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:52,838 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:52,839 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:52,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:52,842 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:52,859 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:53,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:54,069 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:54,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1184943952] [2022-01-31 21:12:54,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1184943952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:54,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:54,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:12:54,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915137] [2022-01-31 21:12:54,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:54,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:12:54,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:54,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:12:54,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:12:54,070 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:58,408 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-01-31 21:12:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 21:12:58,408 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 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 36 [2022-01-31 21:12:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:58,408 INFO L225 Difference]: With dead ends: 69 [2022-01-31 21:12:58,408 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 21:12:58,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=316, Invalid=2990, Unknown=0, NotChecked=0, Total=3306 [2022-01-31 21:12:58,410 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:58,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 113 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:12:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 21:12:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-31 21:12:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-01-31 21:12:58,421 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 36 [2022-01-31 21:12:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:58,421 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-01-31 21:12:58,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-01-31 21:12:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 21:12:58,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:58,422 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:58,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 21:12:58,422 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:58,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash 843169312, now seen corresponding path program 21 times [2022-01-31 21:12:58,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:58,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [842651748] [2022-01-31 21:12:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:58,448 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:58,449 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:58,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:58,452 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:58,471 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:58,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:13:00,163 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:00,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [842651748] [2022-01-31 21:13:00,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [842651748] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:00,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:00,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-31 21:13:00,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175233911] [2022-01-31 21:13:00,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:00,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 21:13:00,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:00,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 21:13:00,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:13:00,164 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:07,367 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-01-31 21:13:07,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:13:07,368 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 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 37 [2022-01-31 21:13:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:07,368 INFO L225 Difference]: With dead ends: 44 [2022-01-31 21:13:07,368 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 21:13:07,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=387, Invalid=2265, Unknown=0, NotChecked=0, Total=2652 [2022-01-31 21:13:07,369 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:07,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 106 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 21:13:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 21:13:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-01-31 21:13:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 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-01-31 21:13:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-01-31 21:13:07,381 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 37 [2022-01-31 21:13:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:07,381 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-01-31 21:13:07,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-01-31 21:13:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 21:13:07,382 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:07,382 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:07,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 21:13:07,382 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:07,382 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 22 times [2022-01-31 21:13:07,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:07,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1796812199] [2022-01-31 21:13:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:07,426 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:07,426 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:07,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:07,431 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:07,454 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:07,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:13:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:13:09,000 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:09,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1796812199] [2022-01-31 21:13:09,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1796812199] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:09,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:09,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:13:09,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388909816] [2022-01-31 21:13:09,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:09,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:13:09,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:09,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:13:09,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:13:09,002 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 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-01-31 21:13:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:11,484 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-01-31 21:13:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 21:13:11,484 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 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-01-31 21:13:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:11,484 INFO L225 Difference]: With dead ends: 70 [2022-01-31 21:13:11,484 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 21:13:11,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=419, Invalid=1221, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 21:13:11,485 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:11,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 30 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:13:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 21:13:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2022-01-31 21:13:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 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-01-31 21:13:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-01-31 21:13:11,499 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2022-01-31 21:13:11,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:11,500 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-01-31 21:13:11,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 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-01-31 21:13:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-01-31 21:13:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 21:13:11,500 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:11,500 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:11,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 21:13:11,500 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:11,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash -359267392, now seen corresponding path program 23 times [2022-01-31 21:13:11,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:11,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1120660670] [2022-01-31 21:13:11,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:11,542 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:11,542 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:11,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:11,545 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:11,565 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:11,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:13:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:13:13,022 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:13,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1120660670] [2022-01-31 21:13:13,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1120660670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:13,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:13,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-31 21:13:13,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166248329] [2022-01-31 21:13:13,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:13,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 21:13:13,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 21:13:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:13:13,024 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:19,960 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-01-31 21:13:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 21:13:19,961 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 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 39 [2022-01-31 21:13:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:19,961 INFO L225 Difference]: With dead ends: 75 [2022-01-31 21:13:19,961 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 21:13:19,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=373, Invalid=3787, Unknown=0, NotChecked=0, Total=4160 [2022-01-31 21:13:19,962 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:19,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 118 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-31 21:13:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 21:13:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-31 21:13:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-01-31 21:13:19,975 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 39 [2022-01-31 21:13:19,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:19,976 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-01-31 21:13:19,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-01-31 21:13:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 21:13:19,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:19,976 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:19,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 21:13:19,976 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash -416379154, now seen corresponding path program 24 times [2022-01-31 21:13:19,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:19,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014484902] [2022-01-31 21:13:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:20,007 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:20,007 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:20,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:20,011 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:20,030 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:20,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:13:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:13:22,634 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:22,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014484902] [2022-01-31 21:13:22,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2014484902] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:22,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:22,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-01-31 21:13:22,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327239900] [2022-01-31 21:13:22,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:22,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 21:13:22,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:22,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 21:13:22,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:13:22,636 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:37,421 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-01-31 21:13:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-31 21:13:37,422 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 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 40 [2022-01-31 21:13:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:37,422 INFO L225 Difference]: With dead ends: 47 [2022-01-31 21:13:37,422 INFO L226 Difference]: Without dead ends: 42 [2022-01-31 21:13:37,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=470, Invalid=2836, Unknown=0, NotChecked=0, Total=3306 [2022-01-31 21:13:37,423 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:37,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 126 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-01-31 21:13:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-31 21:13:37,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-01-31 21:13:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 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-01-31 21:13:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-01-31 21:13:37,437 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 40 [2022-01-31 21:13:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:37,437 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-01-31 21:13:37,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-01-31 21:13:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:13:37,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:37,438 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:37,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 21:13:37,438 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 25 times [2022-01-31 21:13:37,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:37,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1758848430] [2022-01-31 21:13:37,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:37,466 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:37,466 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:37,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:37,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:37,482 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:37,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:13:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:13:39,434 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:39,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1758848430] [2022-01-31 21:13:39,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1758848430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:39,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:39,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 21:13:39,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74476881] [2022-01-31 21:13:39,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:39,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 21:13:39,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:39,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 21:13:39,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:13:39,435 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 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-01-31 21:13:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:43,904 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-01-31 21:13:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:13:43,904 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 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-01-31 21:13:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:43,905 INFO L225 Difference]: With dead ends: 76 [2022-01-31 21:13:43,905 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 21:13:43,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=509, Invalid=1471, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 21:13:43,906 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 66 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:43,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 45 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:13:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 21:13:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 44. [2022-01-31 21:13:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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-01-31 21:13:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-01-31 21:13:43,923 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2022-01-31 21:13:43,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:43,923 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-01-31 21:13:43,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 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-01-31 21:13:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-01-31 21:13:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:13:43,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:43,923 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:43,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 21:13:43,924 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:43,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash 395434254, now seen corresponding path program 26 times [2022-01-31 21:13:43,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:43,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [669831424] [2022-01-31 21:13:43,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:43,966 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:43,966 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:43,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:43,969 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:43,999 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:13:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:44,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-01-31 21:13:46,495 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:46,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [669831424] [2022-01-31 21:13:46,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [669831424] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:46,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:46,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 21:13:46,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823295892] [2022-01-31 21:13:46,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:46,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 21:13:46,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:46,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 21:13:46,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:13:46,498 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:59,685 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-01-31 21:13:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-31 21:13:59,685 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 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 42 [2022-01-31 21:13:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:59,686 INFO L225 Difference]: With dead ends: 81 [2022-01-31 21:13:59,686 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 21:13:59,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=434, Invalid=4678, Unknown=0, NotChecked=0, Total=5112 [2022-01-31 21:13:59,687 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:59,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 128 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-01-31 21:13:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 21:13:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-01-31 21:13:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-01-31 21:13:59,703 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 42 [2022-01-31 21:13:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:59,703 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-01-31 21:13:59,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:59,703 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-01-31 21:13:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 21:13:59,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:59,703 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:59,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 21:13:59,704 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:59,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:59,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1246089376, now seen corresponding path program 27 times [2022-01-31 21:13:59,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:59,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1461659820] [2022-01-31 21:13:59,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:59,740 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:59,741 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:59,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:59,744 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:59,763 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:00,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:05,544 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:05,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1461659820] [2022-01-31 21:14:05,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1461659820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:05,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:05,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-31 21:14:05,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154815561] [2022-01-31 21:14:05,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:05,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 21:14:05,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:05,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 21:14:05,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 21:14:05,546 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:33,278 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-01-31 21:14:33,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 21:14:33,278 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 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 43 [2022-01-31 21:14:33,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:33,279 INFO L225 Difference]: With dead ends: 50 [2022-01-31 21:14:33,279 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 21:14:33,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=561, Invalid=3471, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 21:14:33,280 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:33,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 131 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-01-31 21:14:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 21:14:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-01-31 21:14:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 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-01-31 21:14:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-01-31 21:14:33,297 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 43 [2022-01-31 21:14:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:33,297 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-01-31 21:14:33,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-01-31 21:14:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:14:33,297 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:33,297 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:33,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 21:14:33,297 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:33,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 28 times [2022-01-31 21:14:33,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:33,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [555722003] [2022-01-31 21:14:33,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:33,333 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:33,333 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:33,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:33,336 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:33,355 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:33,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:33,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:36,069 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:36,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [555722003] [2022-01-31 21:14:36,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [555722003] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:36,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:36,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:14:36,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293211341] [2022-01-31 21:14:36,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:36,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:14:36,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:14:36,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:14:36,071 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 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-01-31 21:14:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:41,939 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-01-31 21:14:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 21:14:41,939 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 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-01-31 21:14:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:41,939 INFO L225 Difference]: With dead ends: 82 [2022-01-31 21:14:41,939 INFO L226 Difference]: Without dead ends: 77 [2022-01-31 21:14:41,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=608, Invalid=1744, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 21:14:41,941 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:41,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 45 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-31 21:14:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-31 21:14:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2022-01-31 21:14:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 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-01-31 21:14:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-01-31 21:14:41,961 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2022-01-31 21:14:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:41,961 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-01-31 21:14:41,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 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-01-31 21:14:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-01-31 21:14:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 21:14:41,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:41,961 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:41,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 21:14:41,961 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:41,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:41,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1907827968, now seen corresponding path program 29 times [2022-01-31 21:14:41,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:41,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [66713172] [2022-01-31 21:14:41,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:41,993 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:41,993 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:41,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:41,997 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:42,021 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:42,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:46,795 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:46,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [66713172] [2022-01-31 21:14:46,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [66713172] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:46,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:46,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-01-31 21:14:46,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203944795] [2022-01-31 21:14:46,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:46,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 21:14:46,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:46,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 21:14:46,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:14:46,796 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:14,262 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-01-31 21:15:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 21:15:14,262 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 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 45 [2022-01-31 21:15:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:14,263 INFO L225 Difference]: With dead ends: 87 [2022-01-31 21:15:14,263 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 21:15:14,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=499, Invalid=5663, Unknown=0, NotChecked=0, Total=6162 [2022-01-31 21:15:14,264 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:14,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 128 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-01-31 21:15:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 21:15:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-01-31 21:15:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-01-31 21:15:14,283 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 45 [2022-01-31 21:15:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:14,283 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-01-31 21:15:14,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-01-31 21:15:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:15:14,284 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:14,284 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:14,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 21:15:14,284 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:14,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:14,284 INFO L85 PathProgramCache]: Analyzing trace with hash -154434258, now seen corresponding path program 30 times [2022-01-31 21:15:14,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:14,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743316933] [2022-01-31 21:15:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:14,313 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:14,314 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:14,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:14,317 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:14,346 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:14,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:22,577 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:22,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743316933] [2022-01-31 21:15:22,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [743316933] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:22,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:22,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-31 21:15:22,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018440428] [2022-01-31 21:15:22,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:22,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 21:15:22,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:22,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 21:15:22,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 21:15:22,578 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:31,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:16:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:11,790 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-01-31 21:16:11,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 21:16:11,791 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 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 46 [2022-01-31 21:16:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:11,791 INFO L225 Difference]: With dead ends: 53 [2022-01-31 21:16:11,791 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 21:16:11,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=660, Invalid=4170, Unknown=0, NotChecked=0, Total=4830 [2022-01-31 21:16:11,793 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:11,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 141 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 16.5s Time] [2022-01-31 21:16:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 21:16:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-01-31 21:16:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 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-01-31 21:16:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-01-31 21:16:11,813 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 46 [2022-01-31 21:16:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:11,813 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-01-31 21:16:11,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:16:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-01-31 21:16:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:16:11,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:11,814 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:11,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 21:16:11,814 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash -457999617, now seen corresponding path program 31 times [2022-01-31 21:16:11,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:11,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1558559498] [2022-01-31 21:16:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:11,843 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:11,843 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:11,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:11,846 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:11,864 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:16:16,992 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:16,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1558559498] [2022-01-31 21:16:16,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1558559498] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:16,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:16,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 21:16:16,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076470049] [2022-01-31 21:16:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:16,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 21:16:16,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 21:16:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:16:16,993 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 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-01-31 21:16:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:25,776 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-01-31 21:16:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:16:25,776 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 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-01-31 21:16:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:25,777 INFO L225 Difference]: With dead ends: 88 [2022-01-31 21:16:25,777 INFO L226 Difference]: Without dead ends: 83 [2022-01-31 21:16:25,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=716, Invalid=2040, Unknown=0, NotChecked=0, Total=2756 [2022-01-31 21:16:25,777 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:25,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 45 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-01-31 21:16:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-31 21:16:25,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50. [2022-01-31 21:16:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 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-01-31 21:16:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-01-31 21:16:25,801 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 47 [2022-01-31 21:16:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:25,801 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-01-31 21:16:25,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 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-01-31 21:16:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-01-31 21:16:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:16:25,801 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:25,802 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:25,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 21:16:25,802 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:25,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:25,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1278591154, now seen corresponding path program 32 times [2022-01-31 21:16:25,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:25,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [786416992] [2022-01-31 21:16:25,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:25,831 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:25,831 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:25,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:25,835 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:25,867 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:26,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:16:35,001 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:35,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [786416992] [2022-01-31 21:16:35,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [786416992] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:35,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:35,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-01-31 21:16:35,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872899227] [2022-01-31 21:16:35,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:35,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 21:16:35,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:35,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 21:16:35,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 21:16:35,003 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:17,390 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-01-31 21:17:17,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-31 21:17:17,390 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 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 48 [2022-01-31 21:17:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:17,390 INFO L225 Difference]: With dead ends: 93 [2022-01-31 21:17:17,390 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 21:17:17,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 42.2s TimeCoverageRelationStatistics Valid=568, Invalid=6742, Unknown=0, NotChecked=0, Total=7310 [2022-01-31 21:17:17,391 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:17,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 143 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-01-31 21:17:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 21:17:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-01-31 21:17:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-01-31 21:17:17,414 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 48 [2022-01-31 21:17:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:17,414 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-01-31 21:17:17,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-01-31 21:17:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:17:17,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:17,414 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:17,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 21:17:17,415 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:17,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1691717792, now seen corresponding path program 33 times [2022-01-31 21:17:17,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:17,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [415430514] [2022-01-31 21:17:17,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:17,448 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:17,448 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:17,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:17,452 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:17,485 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:17:30,177 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:30,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [415430514] [2022-01-31 21:17:30,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [415430514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:30,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:30,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-01-31 21:17:30,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367967739] [2022-01-31 21:17:30,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:30,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-31 21:17:30,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:30,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-31 21:17:30,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 21:17:30,179 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:18:01,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:18:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:51,604 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-01-31 21:18:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 21:18:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (3), 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 49 [2022-01-31 21:18:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:51,605 INFO L225 Difference]: With dead ends: 56 [2022-01-31 21:18:51,605 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 21:18:51,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 68.5s TimeCoverageRelationStatistics Valid=767, Invalid=4933, Unknown=0, NotChecked=0, Total=5700 [2022-01-31 21:18:51,606 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 212 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:51,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 161 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 806 Invalid, 1 Unknown, 0 Unchecked, 25.5s Time] [2022-01-31 21:18:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 21:18:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-01-31 21:18:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 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-01-31 21:18:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-01-31 21:18:51,629 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 49 [2022-01-31 21:18:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:51,630 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-01-31 21:18:51,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:18:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-01-31 21:18:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:18:51,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:51,630 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:51,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 21:18:51,630 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash 938139085, now seen corresponding path program 34 times [2022-01-31 21:18:51,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:51,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [787897577] [2022-01-31 21:18:51,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:51,657 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:51,658 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:51,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:51,661 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:51,680 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:51,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:18:58,622 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:58,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [787897577] [2022-01-31 21:18:58,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [787897577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:58,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:58,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-01-31 21:18:58,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97176364] [2022-01-31 21:18:58,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:58,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 21:18:58,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:58,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 21:18:58,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=591, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:18:58,624 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 28 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-01-31 21:19:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:10,295 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2022-01-31 21:19:10,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 21:19:10,295 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 28 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-01-31 21:19:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:10,296 INFO L225 Difference]: With dead ends: 94 [2022-01-31 21:19:10,296 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 21:19:10,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=833, Invalid=2359, Unknown=0, NotChecked=0, Total=3192 [2022-01-31 21:19:10,296 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 72 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:10,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 40 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-01-31 21:19:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 21:19:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 53. [2022-01-31 21:19:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 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-01-31 21:19:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-01-31 21:19:10,325 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 50 [2022-01-31 21:19:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:10,325 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-01-31 21:19:10,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 28 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-01-31 21:19:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-01-31 21:19:10,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:19:10,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:10,327 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:19:10,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 21:19:10,328 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:10,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:10,328 INFO L85 PathProgramCache]: Analyzing trace with hash -947964352, now seen corresponding path program 35 times [2022-01-31 21:19:10,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:10,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1400476712] [2022-01-31 21:19:10,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:10,351 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:19:10,351 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:10,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:10,354 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:10,392 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:10,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:19:26,264 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:26,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1400476712] [2022-01-31 21:19:26,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1400476712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:26,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:26,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-01-31 21:19:26,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374667995] [2022-01-31 21:19:26,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:26,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-31 21:19:26,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:26,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-31 21:19:26,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1495, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 21:19:26,265 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 41 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:38,600 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-01-31 21:20:38,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-01-31 21:20:38,601 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (3), 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 51 [2022-01-31 21:20:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:38,601 INFO L225 Difference]: With dead ends: 99 [2022-01-31 21:20:38,601 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 21:20:38,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 66.6s TimeCoverageRelationStatistics Valid=641, Invalid=7915, Unknown=0, NotChecked=0, Total=8556 [2022-01-31 21:20:38,602 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:38,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 21.4s Time] [2022-01-31 21:20:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 21:20:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-31 21:20:38,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-01-31 21:20:38,628 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 51 [2022-01-31 21:20:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:38,628 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-01-31 21:20:38,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-01-31 21:20:38,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:20:38,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:38,629 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:20:38,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 21:20:38,629 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash -444740754, now seen corresponding path program 36 times [2022-01-31 21:20:38,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:38,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1590582937] [2022-01-31 21:20:38,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:38,670 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:20:38,671 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:38,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:38,675 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:38,712 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:39,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:21:04,062 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:21:04,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1590582937] [2022-01-31 21:21:04,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1590582937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:21:04,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:21:04,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-01-31 21:21:04,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256257900] [2022-01-31 21:21:04,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:21:04,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 21:21:04,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:21:04,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 21:21:04,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1563, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 21:21:04,064 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 42 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 41 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:21:32,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:22:16,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:22:23,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:22:47,426 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:22:52,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:23:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:15,855 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-01-31 21:23:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-31 21:23:15,856 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 41 states have internal predecessors, (48), 2 states have call successors, (3), 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 52 [2022-01-31 21:23:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:15,856 INFO L225 Difference]: With dead ends: 59 [2022-01-31 21:23:15,856 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 21:23:15,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 109.1s TimeCoverageRelationStatistics Valid=882, Invalid=5760, Unknown=0, NotChecked=0, Total=6642 [2022-01-31 21:23:15,857 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 246 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:15,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 166 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 917 Invalid, 1 Unknown, 0 Unchecked, 47.8s Time] [2022-01-31 21:23:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 21:23:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-01-31 21:23:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 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-01-31 21:23:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-01-31 21:23:15,890 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 52 [2022-01-31 21:23:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:15,890 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-01-31 21:23:15,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 41 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-01-31 21:23:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:23:15,890 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:15,890 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:15,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 21:23:15,890 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash -867566401, now seen corresponding path program 37 times [2022-01-31 21:23:15,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:15,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1769650061] [2022-01-31 21:23:15,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:15,929 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:15,930 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:23:15,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:15,933 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:23:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:15,964 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:23:16,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:23:27,509 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:27,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1769650061] [2022-01-31 21:23:27,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1769650061] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:27,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:27,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 21:23:27,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343931283] [2022-01-31 21:23:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:27,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 21:23:27,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:27,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 21:23:27,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=671, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:23:27,511 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 30 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-01-31 21:23:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:45,888 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-01-31 21:23:45,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 21:23:45,888 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.53125) internal successors, (49), 30 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-01-31 21:23:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:45,889 INFO L225 Difference]: With dead ends: 100 [2022-01-31 21:23:45,889 INFO L226 Difference]: Without dead ends: 95 [2022-01-31 21:23:45,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=959, Invalid=2701, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 21:23:45,904 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 79 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:45,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 35 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-01-31 21:23:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-31 21:23:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 56. [2022-01-31 21:23:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 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-01-31 21:23:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-01-31 21:23:45,937 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 53 [2022-01-31 21:23:45,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:45,937 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-01-31 21:23:45,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.53125) internal successors, (49), 30 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-01-31 21:23:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-01-31 21:23:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 21:23:45,937 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:45,937 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:45,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 21:23:45,938 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1090259570, now seen corresponding path program 38 times [2022-01-31 21:23:45,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:45,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1626851126] [2022-01-31 21:23:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:45,975 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:45,975 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:23:45,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:45,978 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:23:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:46,014 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:23:46,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:24:07,136 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:07,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1626851126] [2022-01-31 21:24:07,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1626851126] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:07,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:07,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-01-31 21:24:07,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641356792] [2022-01-31 21:24:07,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:07,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-31 21:24:07,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:07,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-31 21:24:07,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1729, Unknown=0, NotChecked=0, Total=1892 [2022-01-31 21:24:07,137 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 44 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:58,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:25:13,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:25:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:46,205 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2022-01-31 21:25:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-31 21:25:46,206 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (3), 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 54 [2022-01-31 21:25:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:46,206 INFO L225 Difference]: With dead ends: 105 [2022-01-31 21:25:46,206 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 21:25:46,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1926 ImplicationChecksByTransitivity, 96.7s TimeCoverageRelationStatistics Valid=718, Invalid=9180, Unknown=2, NotChecked=0, Total=9900 [2022-01-31 21:25:46,208 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:46,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 23.3s Time] [2022-01-31 21:25:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 21:25:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-01-31 21:25:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-01-31 21:25:46,242 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 54 [2022-01-31 21:25:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:46,242 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-01-31 21:25:46,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-01-31 21:25:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:25:46,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:46,242 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:25:46,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 21:25:46,243 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:46,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:46,243 INFO L85 PathProgramCache]: Analyzing trace with hash 812376544, now seen corresponding path program 39 times [2022-01-31 21:25:46,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:46,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2071811145] [2022-01-31 21:25:46,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:46,277 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:46,277 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:25:46,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:46,280 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:25:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:46,315 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:25:46,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:26:24,471 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:26:24,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2071811145] [2022-01-31 21:26:24,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2071811145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:26:24,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:26:24,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-01-31 21:26:24,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699297350] [2022-01-31 21:26:24,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:26:24,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-31 21:26:24,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:26:24,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-31 21:26:24,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1800, Unknown=2, NotChecked=0, Total=1980 [2022-01-31 21:26:24,472 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 45 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 44 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:46,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []