/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-de51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 01:50:12,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 01:50:12,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 01:50:12,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 01:50:12,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 01:50:12,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 01:50:12,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 01:50:12,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 01:50:12,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 01:50:12,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 01:50:12,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 01:50:12,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 01:50:12,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 01:50:12,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 01:50:12,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 01:50:12,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 01:50:12,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 01:50:12,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 01:50:12,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 01:50:12,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 01:50:12,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 01:50:12,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 01:50:12,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 01:50:12,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 01:50:12,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 01:50:12,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 01:50:12,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 01:50:12,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 01:50:12,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 01:50:12,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 01:50:12,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 01:50:12,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 01:50:12,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 01:50:12,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 01:50:12,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 01:50:12,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 01:50:12,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 01:50:12,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 01:50:12,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 01:50:12,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 01:50:12,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 01:50:12,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-15 01:50:12,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 01:50:12,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 01:50:12,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 01:50:12,287 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 01:50:12,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 01:50:12,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 01:50:12,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 01:50:12,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 01:50:12,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 01:50:12,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 01:50:12,289 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 01:50:12,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 01:50:12,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 01:50:12,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 01:50:12,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 01:50:12,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 01:50:12,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 01:50:12,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 01:50:12,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:50:12,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 01:50:12,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 01:50:12,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 01:50:12,291 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-15 01:50:12,291 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-02-15 01:50:12,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 01:50:12,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 01:50:12,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 01:50:12,565 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 01:50:12,566 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 01:50:12,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-02-15 01:50:12,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e3fcc5a/f3396e36652b461c9ea14c3c133debb5/FLAGb0289936c [2022-02-15 01:50:13,010 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 01:50:13,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-02-15 01:50:13,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e3fcc5a/f3396e36652b461c9ea14c3c133debb5/FLAGb0289936c [2022-02-15 01:50:13,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e3fcc5a/f3396e36652b461c9ea14c3c133debb5 [2022-02-15 01:50:13,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 01:50:13,434 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 01:50:13,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 01:50:13,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 01:50:13,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 01:50:13,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:50:13" (1/1) ... [2022-02-15 01:50:13,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e465b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:50:13, skipping insertion in model container [2022-02-15 01:50:13,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:50:13" (1/1) ... [2022-02-15 01:50:13,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 01:50:13,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 01:50:13,584 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-de51.c[368,381] [2022-02-15 01:50:13,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:50:13,610 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 01:50:13,620 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-de51.c[368,381] [2022-02-15 01:50:13,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:50:13,642 INFO L208 MainTranslator]: Completed translation [2022-02-15 01:50:13,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:50:13 WrapperNode [2022-02-15 01:50:13,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 01:50:13,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 01:50:13,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 01:50:13,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 01:50:13,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:50:13" (1/1) ... [2022-02-15 01:50:13,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:50:13" (1/1) ... [2022-02-15 01:50:13,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:50:13" (1/1) ... [2022-02-15 01:50:13,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:50:13" (1/1) ... [2022-02-15 01:50:13,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:50:13" (1/1) ... [2022-02-15 01:50:13,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:50:13" (1/1) ... [2022-02-15 01:50:13,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:50:13" (1/1) ... [2022-02-15 01:50:13,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 01:50:13,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 01:50:13,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 01:50:13,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 01:50:13,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:50:13" (1/1) ... [2022-02-15 01:50:13,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:50:13,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 01:50:13,736 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-02-15 01:50:13,763 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-02-15 01:50:13,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 01:50:13,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 01:50:13,777 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 01:50:13,777 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-15 01:50:13,777 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 01:50:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 01:50:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 01:50:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 01:50:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 01:50:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-15 01:50:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 01:50:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 01:50:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 01:50:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 01:50:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 01:50:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 01:50:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 01:50:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 01:50:13,836 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 01:50:13,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 01:50:14,002 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 01:50:14,006 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 01:50:14,006 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-15 01:50:14,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:50:14 BoogieIcfgContainer [2022-02-15 01:50:14,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 01:50:14,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 01:50:14,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 01:50:14,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 01:50:14,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:50:13" (1/3) ... [2022-02-15 01:50:14,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d5c0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:50:14, skipping insertion in model container [2022-02-15 01:50:14,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:50:13" (2/3) ... [2022-02-15 01:50:14,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d5c0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:50:14, skipping insertion in model container [2022-02-15 01:50:14,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:50:14" (3/3) ... [2022-02-15 01:50:14,015 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.c [2022-02-15 01:50:14,019 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 01:50:14,019 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 01:50:14,122 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 01:50:14,132 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-02-15 01:50:14,132 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 01:50:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-02-15 01:50:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-15 01:50:14,152 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:14,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:14,153 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:14,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:14,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-02-15 01:50:14,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:14,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1680657645] [2022-02-15 01:50:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:14,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:14,228 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:50:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:14,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:14,363 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:14,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1680657645] [2022-02-15 01:50:14,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1680657645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:14,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:14,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-15 01:50:14,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749782783] [2022-02-15 01:50:14,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:14,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-15 01:50:14,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:14,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-15 01:50:14,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 01:50:14,400 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-02-15 01:50:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:14,453 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-02-15 01:50:14,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-15 01:50:14,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-02-15 01:50:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:14,462 INFO L225 Difference]: With dead ends: 41 [2022-02-15 01:50:14,463 INFO L226 Difference]: Without dead ends: 17 [2022-02-15 01:50:14,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 01:50:14,469 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:14,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:50:14,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-15 01:50:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-15 01:50:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-02-15 01:50:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-02-15 01:50:14,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-02-15 01:50:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:14,509 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-15 01:50:14,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-02-15 01:50:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-15 01:50:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-15 01:50:14,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:14,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:14,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 01:50:14,510 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-02-15 01:50:14,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:14,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [567015896] [2022-02-15 01:50:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:14,514 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:50:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:14,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:14,712 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:14,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [567015896] [2022-02-15 01:50:14,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [567015896] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:14,713 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:14,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:50:14,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911634031] [2022-02-15 01:50:14,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:14,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:50:14,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:14,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:50:14,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:50:14,716 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-02-15 01:50:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:14,815 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-15 01:50:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 01:50:14,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-02-15 01:50:14,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:14,816 INFO L225 Difference]: With dead ends: 28 [2022-02-15 01:50:14,817 INFO L226 Difference]: Without dead ends: 23 [2022-02-15 01:50:14,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:50:14,818 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:14,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-15 01:50:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-15 01:50:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-02-15 01:50:14,829 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-02-15 01:50:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:14,829 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-02-15 01:50:14,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-02-15 01:50:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-15 01:50:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 01:50:14,830 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:14,830 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:14,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 01:50:14,831 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:14,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-02-15 01:50:14,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:14,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1482546840] [2022-02-15 01:50:14,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:14,994 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:14,996 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:14,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:15,011 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:15,052 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:15,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:15,274 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:15,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1482546840] [2022-02-15 01:50:15,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1482546840] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:15,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:15,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 01:50:15,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449782211] [2022-02-15 01:50:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:15,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 01:50:15,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:15,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 01:50:15,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-15 01:50:15,279 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:15,376 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-15 01:50:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 01:50:15,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-15 01:50:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:15,380 INFO L225 Difference]: With dead ends: 32 [2022-02-15 01:50:15,381 INFO L226 Difference]: Without dead ends: 25 [2022-02-15 01:50:15,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:50:15,385 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:15,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:15,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-15 01:50:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-15 01:50:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 20 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-02-15 01:50:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-02-15 01:50:15,393 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 17 [2022-02-15 01:50:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:15,393 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-02-15 01:50:15,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-02-15 01:50:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 01:50:15,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:15,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:15,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 01:50:15,394 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:15,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:15,395 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-02-15 01:50:15,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:15,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [381536633] [2022-02-15 01:50:15,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:15,469 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:15,470 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:15,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:15,496 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:15,526 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:15,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:15,744 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:15,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [381536633] [2022-02-15 01:50:15,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [381536633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:15,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:15,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 01:50:15,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375495483] [2022-02-15 01:50:15,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:15,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 01:50:15,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:15,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 01:50:15,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:50:15,746 INFO L87 Difference]: Start difference. First operand 25 states and 34 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-02-15 01:50:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:15,833 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-15 01:50:15,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 01:50:15,833 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-02-15 01:50:15,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:15,834 INFO L225 Difference]: With dead ends: 32 [2022-02-15 01:50:15,834 INFO L226 Difference]: Without dead ends: 24 [2022-02-15 01:50:15,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-15 01:50:15,845 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:15,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 43 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-15 01:50:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-15 01:50:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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-02-15 01:50:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-02-15 01:50:15,853 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2022-02-15 01:50:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:15,853 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-15 01:50:15,853 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-02-15 01:50:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-15 01:50:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 01:50:15,854 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:15,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:15,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 01:50:15,855 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:15,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:15,855 INFO L85 PathProgramCache]: Analyzing trace with hash -578961840, now seen corresponding path program 1 times [2022-02-15 01:50:15,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:15,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1748458754] [2022-02-15 01:50:15,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:15,908 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:15,908 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:15,916 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:15,938 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:16,102 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:16,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1748458754] [2022-02-15 01:50:16,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1748458754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:16,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:16,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 01:50:16,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000467042] [2022-02-15 01:50:16,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:16,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 01:50:16,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:16,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 01:50:16,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:50:16,104 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 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-02-15 01:50:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:16,190 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-15 01:50:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 01:50:16,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 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-02-15 01:50:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:16,196 INFO L225 Difference]: With dead ends: 33 [2022-02-15 01:50:16,196 INFO L226 Difference]: Without dead ends: 18 [2022-02-15 01:50:16,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-02-15 01:50:16,205 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:16,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 34 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-15 01:50:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-15 01:50:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-02-15 01:50:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-02-15 01:50:16,209 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 17 [2022-02-15 01:50:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:16,209 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-02-15 01:50:16,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 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-02-15 01:50:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-15 01:50:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 01:50:16,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:16,210 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:16,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 01:50:16,210 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:16,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:16,211 INFO L85 PathProgramCache]: Analyzing trace with hash 388404751, now seen corresponding path program 1 times [2022-02-15 01:50:16,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:16,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1423616597] [2022-02-15 01:50:16,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:16,311 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:16,312 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:16,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:16,318 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-02-15 01:50:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:16,340 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-02-15 01:50:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:17,319 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:17,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1423616597] [2022-02-15 01:50:17,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1423616597] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:17,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:17,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 01:50:17,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139173957] [2022-02-15 01:50:17,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:17,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 01:50:17,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:17,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 01:50:17,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-15 01:50:17,321 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 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-02-15 01:50:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:17,942 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-15 01:50:17,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 01:50:17,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 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-02-15 01:50:17,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:17,943 INFO L225 Difference]: With dead ends: 28 [2022-02-15 01:50:17,944 INFO L226 Difference]: Without dead ends: 23 [2022-02-15 01:50:17,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-02-15 01:50:17,945 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:17,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 38 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-02-15 01:50:17,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-15 01:50:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-02-15 01:50:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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-02-15 01:50:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-02-15 01:50:17,951 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 17 [2022-02-15 01:50:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:17,951 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-02-15 01:50:17,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 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-02-15 01:50:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-15 01:50:17,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 01:50:17,952 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:17,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:17,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 01:50:17,953 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:17,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash -809859500, now seen corresponding path program 1 times [2022-02-15 01:50:17,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:17,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1322921246] [2022-02-15 01:50:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:18,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:18,007 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:18,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:18,015 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-02-15 01:50:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:18,021 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:18,053 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:18,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1322921246] [2022-02-15 01:50:18,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1322921246] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:18,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:18,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 01:50:18,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234861414] [2022-02-15 01:50:18,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:18,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 01:50:18,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:18,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 01:50:18,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 01:50:18,055 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-02-15 01:50:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:18,143 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-02-15 01:50:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 01:50:18,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-02-15 01:50:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:18,145 INFO L225 Difference]: With dead ends: 36 [2022-02-15 01:50:18,145 INFO L226 Difference]: Without dead ends: 29 [2022-02-15 01:50:18,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-15 01:50:18,146 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:18,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 26 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-15 01:50:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-02-15 01:50:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 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-02-15 01:50:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-02-15 01:50:18,153 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 18 [2022-02-15 01:50:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:18,154 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-02-15 01:50:18,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-02-15 01:50:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-02-15 01:50:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 01:50:18,154 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:18,154 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:18,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 01:50:18,155 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:18,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash 592968899, now seen corresponding path program 1 times [2022-02-15 01:50:18,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:18,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1706246232] [2022-02-15 01:50:18,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:18,203 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:18,204 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:18,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:18,209 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-02-15 01:50:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:18,215 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:18,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:18,248 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:18,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1706246232] [2022-02-15 01:50:18,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1706246232] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:18,248 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:18,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 01:50:18,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284684186] [2022-02-15 01:50:18,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:18,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 01:50:18,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:18,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 01:50:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-15 01:50:18,250 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-02-15 01:50:18,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:18,324 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-02-15 01:50:18,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 01:50:18,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-02-15 01:50:18,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:18,325 INFO L225 Difference]: With dead ends: 44 [2022-02-15 01:50:18,325 INFO L226 Difference]: Without dead ends: 34 [2022-02-15 01:50:18,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-15 01:50:18,326 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:18,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 23 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-15 01:50:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2022-02-15 01:50:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-15 01:50:18,334 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 18 [2022-02-15 01:50:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:18,334 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-15 01:50:18,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-02-15 01:50:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-15 01:50:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 01:50:18,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:18,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:18,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 01:50:18,335 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:18,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:18,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1130976308, now seen corresponding path program 1 times [2022-02-15 01:50:18,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:18,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1237931498] [2022-02-15 01:50:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:18,438 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:18,438 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:18,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:18,443 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-02-15 01:50:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:18,453 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:18,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:18,505 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:18,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1237931498] [2022-02-15 01:50:18,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1237931498] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:18,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:18,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:50:18,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756902555] [2022-02-15 01:50:18,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:18,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:50:18,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:18,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:50:18,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:50:18,507 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:18,589 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-02-15 01:50:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 01:50:18,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 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-02-15 01:50:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:18,590 INFO L225 Difference]: With dead ends: 35 [2022-02-15 01:50:18,590 INFO L226 Difference]: Without dead ends: 26 [2022-02-15 01:50:18,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:50:18,591 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:18,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 34 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:50:18,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-15 01:50:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-02-15 01:50:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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-02-15 01:50:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-15 01:50:18,596 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2022-02-15 01:50:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:18,597 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-15 01:50:18,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-15 01:50:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 01:50:18,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:18,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:18,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 01:50:18,598 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:18,598 INFO L85 PathProgramCache]: Analyzing trace with hash 629336803, now seen corresponding path program 1 times [2022-02-15 01:50:18,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:18,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1569298887] [2022-02-15 01:50:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:18,647 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:18,647 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:18,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:18,652 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-02-15 01:50:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:18,661 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-15 01:50:18,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:18,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:18,718 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:18,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1569298887] [2022-02-15 01:50:18,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1569298887] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:18,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:18,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:50:18,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681531029] [2022-02-15 01:50:18,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:18,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:50:18,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:18,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:50:18,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:50:18,720 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:18,831 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-02-15 01:50:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 01:50:18,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 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-02-15 01:50:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:18,832 INFO L225 Difference]: With dead ends: 47 [2022-02-15 01:50:18,832 INFO L226 Difference]: Without dead ends: 40 [2022-02-15 01:50:18,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-02-15 01:50:18,833 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:18,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 30 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-15 01:50:18,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-02-15 01:50:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 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-02-15 01:50:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-02-15 01:50:18,842 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 18 [2022-02-15 01:50:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:18,842 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-02-15 01:50:18,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-15 01:50:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-15 01:50:18,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:18,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:18,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 01:50:18,843 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:18,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash -528072081, now seen corresponding path program 1 times [2022-02-15 01:50:18,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:18,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999583016] [2022-02-15 01:50:18,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:18,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:18,889 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:18,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:18,894 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-02-15 01:50:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:18,904 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:18,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:18,947 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:18,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1999583016] [2022-02-15 01:50:18,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1999583016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:18,948 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:18,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:50:18,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575015627] [2022-02-15 01:50:18,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:18,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:50:18,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:18,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:50:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:50:18,949 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-02-15 01:50:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:19,029 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-02-15 01:50:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 01:50:19,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-02-15 01:50:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:19,030 INFO L225 Difference]: With dead ends: 36 [2022-02-15 01:50:19,030 INFO L226 Difference]: Without dead ends: 28 [2022-02-15 01:50:19,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 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-02-15 01:50:19,031 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:19,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 34 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:50:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-15 01:50:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-15 01:50:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 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-02-15 01:50:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-15 01:50:19,039 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-02-15 01:50:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:19,039 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-15 01:50:19,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-02-15 01:50:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-15 01:50:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 01:50:19,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:19,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:19,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 01:50:19,041 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:19,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:19,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-02-15 01:50:19,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:19,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1217599985] [2022-02-15 01:50:19,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:19,091 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:19,091 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:19,097 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-02-15 01:50:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:19,107 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-02-15 01:50:19,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:19,156 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:19,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1217599985] [2022-02-15 01:50:19,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1217599985] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:19,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:19,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:50:19,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758420711] [2022-02-15 01:50:19,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:19,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:50:19,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:19,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:50:19,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:50:19,158 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:19,266 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-02-15 01:50:19,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 01:50:19,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-15 01:50:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:19,267 INFO L225 Difference]: With dead ends: 39 [2022-02-15 01:50:19,267 INFO L226 Difference]: Without dead ends: 34 [2022-02-15 01:50:19,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-15 01:50:19,268 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:19,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 33 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-15 01:50:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-02-15 01:50:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-02-15 01:50:19,276 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2022-02-15 01:50:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:19,277 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-15 01:50:19,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-15 01:50:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-15 01:50:19,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:19,278 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:19,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 01:50:19,278 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-02-15 01:50:19,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:19,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1744338577] [2022-02-15 01:50:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:19,417 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:19,418 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:19,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:19,422 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-02-15 01:50:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:19,451 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:20,036 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:20,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1744338577] [2022-02-15 01:50:20,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1744338577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:20,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:20,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 01:50:20,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515682059] [2022-02-15 01:50:20,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:20,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 01:50:20,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:20,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 01:50:20,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-02-15 01:50:20,038 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 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-02-15 01:50:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:22,130 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2022-02-15 01:50:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 01:50:22,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 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-02-15 01:50:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:22,131 INFO L225 Difference]: With dead ends: 69 [2022-02-15 01:50:22,131 INFO L226 Difference]: Without dead ends: 47 [2022-02-15 01:50:22,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-02-15 01:50:22,133 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:22,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 65 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 170 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-02-15 01:50:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-15 01:50:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-02-15 01:50:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 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-02-15 01:50:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2022-02-15 01:50:22,148 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 21 [2022-02-15 01:50:22,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:22,149 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2022-02-15 01:50:22,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 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-02-15 01:50:22,149 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-02-15 01:50:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-15 01:50:22,152 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:22,152 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:22,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 01:50:22,153 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash -794011953, now seen corresponding path program 2 times [2022-02-15 01:50:22,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:22,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1211212570] [2022-02-15 01:50:22,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:22,191 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:22,191 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:22,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:22,199 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-02-15 01:50:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:22,235 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:22,746 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:22,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1211212570] [2022-02-15 01:50:22,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1211212570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:22,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:22,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 01:50:22,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777135438] [2022-02-15 01:50:22,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:22,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 01:50:22,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:22,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 01:50:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-15 01:50:22,748 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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-02-15 01:50:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:30,652 INFO L93 Difference]: Finished difference Result 60 states and 83 transitions. [2022-02-15 01:50:30,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 01:50:30,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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-02-15 01:50:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:30,653 INFO L225 Difference]: With dead ends: 60 [2022-02-15 01:50:30,653 INFO L226 Difference]: Without dead ends: 48 [2022-02-15 01:50:30,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=108, Invalid=310, Unknown=2, NotChecked=0, Total=420 [2022-02-15 01:50:30,654 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:30,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 44 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 50 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-02-15 01:50:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-15 01:50:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2022-02-15 01:50:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 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-02-15 01:50:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-02-15 01:50:30,668 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 21 [2022-02-15 01:50:30,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:30,668 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-02-15 01:50:30,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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-02-15 01:50:30,668 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2022-02-15 01:50:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 01:50:30,669 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:30,669 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:30,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 01:50:30,669 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:30,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:30,669 INFO L85 PathProgramCache]: Analyzing trace with hash -977123598, now seen corresponding path program 2 times [2022-02-15 01:50:30,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:30,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1489068378] [2022-02-15 01:50:30,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:30,707 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:30,707 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:30,712 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-02-15 01:50:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:30,722 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-02-15 01:50:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:30,770 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:30,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1489068378] [2022-02-15 01:50:30,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1489068378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:30,771 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:30,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:50:30,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951600991] [2022-02-15 01:50:30,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:30,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:50:30,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:30,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:50:30,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:50:30,772 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-02-15 01:50:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:30,894 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-02-15 01:50:30,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 01:50:30,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-02-15 01:50:30,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:30,895 INFO L225 Difference]: With dead ends: 54 [2022-02-15 01:50:30,895 INFO L226 Difference]: Without dead ends: 46 [2022-02-15 01:50:30,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-15 01:50:30,895 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:30,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-15 01:50:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-02-15 01:50:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 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-02-15 01:50:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-02-15 01:50:30,910 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 22 [2022-02-15 01:50:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:30,910 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-02-15 01:50:30,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-02-15 01:50:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-02-15 01:50:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 01:50:30,911 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:30,911 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:30,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 01:50:30,911 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:30,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash -439116189, now seen corresponding path program 3 times [2022-02-15 01:50:30,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:30,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [51458279] [2022-02-15 01:50:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:30,968 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:30,968 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:30,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:30,973 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-02-15 01:50:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:30,993 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-02-15 01:50:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:31,043 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:31,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [51458279] [2022-02-15 01:50:31,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [51458279] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:31,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:31,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:50:31,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396089666] [2022-02-15 01:50:31,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:31,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:50:31,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:31,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:50:31,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:50:31,046 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-02-15 01:50:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:31,152 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-02-15 01:50:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 01:50:31,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-02-15 01:50:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:31,153 INFO L225 Difference]: With dead ends: 60 [2022-02-15 01:50:31,153 INFO L226 Difference]: Without dead ends: 45 [2022-02-15 01:50:31,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:50:31,154 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:31,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 31 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-15 01:50:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-02-15 01:50:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2022-02-15 01:50:31,168 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 22 [2022-02-15 01:50:31,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:31,169 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-02-15 01:50:31,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-02-15 01:50:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-02-15 01:50:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 01:50:31,169 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:31,170 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:31,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 01:50:31,170 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:31,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:31,170 INFO L85 PathProgramCache]: Analyzing trace with hash -6760208, now seen corresponding path program 3 times [2022-02-15 01:50:31,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:31,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1150130117] [2022-02-15 01:50:31,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:31,223 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:31,223 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:31,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:31,227 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-02-15 01:50:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:31,241 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-02-15 01:50:31,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:31,340 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:31,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1150130117] [2022-02-15 01:50:31,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1150130117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:31,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:31,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 01:50:31,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959368748] [2022-02-15 01:50:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:31,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 01:50:31,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 01:50:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:50:31,342 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-02-15 01:50:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:31,637 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2022-02-15 01:50:31,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 01:50:31,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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 23 [2022-02-15 01:50:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:31,638 INFO L225 Difference]: With dead ends: 87 [2022-02-15 01:50:31,638 INFO L226 Difference]: Without dead ends: 75 [2022-02-15 01:50:31,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-02-15 01:50:31,639 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 85 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:31,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 32 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 01:50:31,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-15 01:50:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 50. [2022-02-15 01:50:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2022-02-15 01:50:31,658 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 23 [2022-02-15 01:50:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:31,658 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-02-15 01:50:31,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-02-15 01:50:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-02-15 01:50:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 01:50:31,659 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:31,659 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:31,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 01:50:31,659 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:31,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:31,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1804115870, now seen corresponding path program 4 times [2022-02-15 01:50:31,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:31,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1983990232] [2022-02-15 01:50:31,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:31,703 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:31,703 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:31,710 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-02-15 01:50:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:31,757 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-02-15 01:50:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:31,847 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:31,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1983990232] [2022-02-15 01:50:31,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1983990232] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:31,848 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:31,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 01:50:31,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289950034] [2022-02-15 01:50:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:31,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 01:50:31,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:31,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 01:50:31,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:50:31,850 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-02-15 01:50:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:32,097 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2022-02-15 01:50:32,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 01:50:32,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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 24 [2022-02-15 01:50:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:32,099 INFO L225 Difference]: With dead ends: 64 [2022-02-15 01:50:32,099 INFO L226 Difference]: Without dead ends: 50 [2022-02-15 01:50:32,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-02-15 01:50:32,100 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:32,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 45 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-15 01:50:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-02-15 01:50:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2022-02-15 01:50:32,116 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 24 [2022-02-15 01:50:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:32,117 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-02-15 01:50:32,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-02-15 01:50:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-02-15 01:50:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 01:50:32,119 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:32,119 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:32,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 01:50:32,120 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1227757058, now seen corresponding path program 4 times [2022-02-15 01:50:32,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:32,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1725781146] [2022-02-15 01:50:32,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:32,165 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:32,165 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:32,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:32,169 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-15 01:50:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:32,183 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-15 01:50:32,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:32,274 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:32,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1725781146] [2022-02-15 01:50:32,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1725781146] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:32,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:32,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 01:50:32,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344519646] [2022-02-15 01:50:32,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:32,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 01:50:32,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 01:50:32,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:50:32,276 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-02-15 01:50:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:32,551 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2022-02-15 01:50:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 01:50:32,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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 24 [2022-02-15 01:50:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:32,551 INFO L225 Difference]: With dead ends: 66 [2022-02-15 01:50:32,552 INFO L226 Difference]: Without dead ends: 61 [2022-02-15 01:50:32,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-02-15 01:50:32,552 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:32,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 37 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:50:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-15 01:50:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-02-15 01:50:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-02-15 01:50:32,574 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 24 [2022-02-15 01:50:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:32,574 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-02-15 01:50:32,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-02-15 01:50:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-02-15 01:50:32,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-15 01:50:32,575 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:32,575 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:32,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 01:50:32,575 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:32,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1822836127, now seen corresponding path program 5 times [2022-02-15 01:50:32,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:32,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1494646475] [2022-02-15 01:50:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:32,629 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:32,630 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:32,634 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-02-15 01:50:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:32,653 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:32,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:33,869 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:33,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1494646475] [2022-02-15 01:50:33,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1494646475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:33,869 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:33,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 01:50:33,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438427963] [2022-02-15 01:50:33,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:33,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 01:50:33,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:33,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 01:50:33,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-15 01:50:33,870 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-02-15 01:50:50,315 WARN L228 SmtUtils]: Spent 13.58s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:50:55,800 WARN L228 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:50:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:56,245 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2022-02-15 01:50:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-15 01:50:56,246 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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 25 [2022-02-15 01:50:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:56,247 INFO L225 Difference]: With dead ends: 104 [2022-02-15 01:50:56,247 INFO L226 Difference]: Without dead ends: 86 [2022-02-15 01:50:56,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=163, Invalid=592, Unknown=1, NotChecked=0, Total=756 [2022-02-15 01:50:56,248 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 75 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:56,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 54 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 144 Invalid, 0 Unknown, 80 Unchecked, 0.2s Time] [2022-02-15 01:50:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-15 01:50:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2022-02-15 01:50:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2022-02-15 01:50:56,280 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 25 [2022-02-15 01:50:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:56,280 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2022-02-15 01:50:56,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-02-15 01:50:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2022-02-15 01:50:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-15 01:50:56,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:56,281 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:56,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 01:50:56,281 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:56,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 5 times [2022-02-15 01:50:56,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:56,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1229207913] [2022-02-15 01:50:56,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:56,319 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:56,320 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:56,326 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-02-15 01:50:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:56,369 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.6))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:56,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:56,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-02-15 01:50:59,981 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:59,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1229207913] [2022-02-15 01:50:59,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1229207913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:59,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:59,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-15 01:50:59,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473850407] [2022-02-15 01:50:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:59,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 01:50:59,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:59,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 01:50:59,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-02-15 01:50:59,993 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 16 states, 16 states have (on average 1.3125) 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-02-15 01:51:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:00,647 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-02-15 01:51:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 01:51:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) 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 26 [2022-02-15 01:51:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:00,648 INFO L225 Difference]: With dead ends: 69 [2022-02-15 01:51:00,649 INFO L226 Difference]: Without dead ends: 64 [2022-02-15 01:51:00,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-02-15 01:51:00,650 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:00,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 79 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 203 Invalid, 0 Unknown, 51 Unchecked, 0.3s Time] [2022-02-15 01:51:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-15 01:51:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-02-15 01:51:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-02-15 01:51:00,679 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 26 [2022-02-15 01:51:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:00,680 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-02-15 01:51:00,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) 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-02-15 01:51:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-02-15 01:51:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-15 01:51:00,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:00,680 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:00,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 01:51:00,680 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:00,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1626264450, now seen corresponding path program 6 times [2022-02-15 01:51:00,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:00,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1647524644] [2022-02-15 01:51:00,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:00,727 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:00,728 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:00,732 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-02-15 01:51:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:00,742 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-02-15 01:51:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:00,839 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:00,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1647524644] [2022-02-15 01:51:00,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1647524644] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:00,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:00,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 01:51:00,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716866671] [2022-02-15 01:51:00,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:00,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 01:51:00,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:00,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 01:51:00,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-15 01:51:00,840 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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-02-15 01:51:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:01,222 INFO L93 Difference]: Finished difference Result 128 states and 178 transitions. [2022-02-15 01:51:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 01:51:01,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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 26 [2022-02-15 01:51:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:01,223 INFO L225 Difference]: With dead ends: 128 [2022-02-15 01:51:01,223 INFO L226 Difference]: Without dead ends: 117 [2022-02-15 01:51:01,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-02-15 01:51:01,224 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 95 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:01,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 47 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 01:51:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-15 01:51:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 79. [2022-02-15 01:51:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 74 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2022-02-15 01:51:01,270 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 26 [2022-02-15 01:51:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:01,270 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2022-02-15 01:51:01,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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-02-15 01:51:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2022-02-15 01:51:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 01:51:01,270 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:01,270 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:01,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 01:51:01,271 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:01,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:01,271 INFO L85 PathProgramCache]: Analyzing trace with hash 62925025, now seen corresponding path program 7 times [2022-02-15 01:51:01,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:01,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [604909127] [2022-02-15 01:51:01,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:01,326 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:01,326 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:01,330 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-02-15 01:51:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:01,344 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-02-15 01:51:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:01,421 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:01,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [604909127] [2022-02-15 01:51:01,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [604909127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:01,422 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:01,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 01:51:01,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261360385] [2022-02-15 01:51:01,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:01,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 01:51:01,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:01,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 01:51:01,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-15 01:51:01,424 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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-02-15 01:51:01,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:01,667 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2022-02-15 01:51:01,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 01:51:01,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 27 [2022-02-15 01:51:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:01,668 INFO L225 Difference]: With dead ends: 96 [2022-02-15 01:51:01,668 INFO L226 Difference]: Without dead ends: 81 [2022-02-15 01:51:01,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-02-15 01:51:01,669 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:01,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 39 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:51:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-15 01:51:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-02-15 01:51:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2022-02-15 01:51:01,697 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 27 [2022-02-15 01:51:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:01,698 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2022-02-15 01:51:01,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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-02-15 01:51:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-02-15 01:51:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 01:51:01,698 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:01,698 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:01,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-15 01:51:01,699 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:01,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash 171340688, now seen corresponding path program 8 times [2022-02-15 01:51:01,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:01,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [358308708] [2022-02-15 01:51:01,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:01,741 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:01,741 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:01,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:01,746 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-02-15 01:51:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:01,758 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-02-15 01:51:01,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:01,872 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:01,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [358308708] [2022-02-15 01:51:01,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [358308708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:01,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:01,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 01:51:01,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862976165] [2022-02-15 01:51:01,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:01,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 01:51:01,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:01,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 01:51:01,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-15 01:51:01,873 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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-02-15 01:51:02,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:02,283 INFO L93 Difference]: Finished difference Result 144 states and 199 transitions. [2022-02-15 01:51:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 01:51:02,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 27 [2022-02-15 01:51:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:02,284 INFO L225 Difference]: With dead ends: 144 [2022-02-15 01:51:02,284 INFO L226 Difference]: Without dead ends: 131 [2022-02-15 01:51:02,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-02-15 01:51:02,285 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 89 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:02,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 44 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 01:51:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-02-15 01:51:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 85. [2022-02-15 01:51:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2022-02-15 01:51:02,321 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 27 [2022-02-15 01:51:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:02,321 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2022-02-15 01:51:02,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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-02-15 01:51:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2022-02-15 01:51:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-15 01:51:02,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:02,322 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:02,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-15 01:51:02,322 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:02,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1703289154, now seen corresponding path program 9 times [2022-02-15 01:51:02,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:02,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [6336594] [2022-02-15 01:51:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:02,361 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:02,362 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:02,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:02,366 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-02-15 01:51:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:02,378 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-02-15 01:51:02,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:02,486 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:02,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [6336594] [2022-02-15 01:51:02,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [6336594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:02,487 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:02,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 01:51:02,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074844530] [2022-02-15 01:51:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:02,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 01:51:02,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:02,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 01:51:02,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-15 01:51:02,488 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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-02-15 01:51:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:02,899 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2022-02-15 01:51:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 01:51:02,899 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 28 [2022-02-15 01:51:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:02,899 INFO L225 Difference]: With dead ends: 104 [2022-02-15 01:51:02,900 INFO L226 Difference]: Without dead ends: 67 [2022-02-15 01:51:02,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-02-15 01:51:02,900 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:02,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 62 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 01:51:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-15 01:51:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-02-15 01:51:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-02-15 01:51:02,926 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 28 [2022-02-15 01:51:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:02,926 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-02-15 01:51:02,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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-02-15 01:51:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-02-15 01:51:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-15 01:51:02,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:02,926 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:02,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-15 01:51:02,927 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:02,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:02,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1788990354, now seen corresponding path program 6 times [2022-02-15 01:51:02,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:02,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [711738647] [2022-02-15 01:51:02,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:02,987 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:02,987 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:02,991 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-02-15 01:51:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:03,004 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-02-15 01:51:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:03,125 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:03,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [711738647] [2022-02-15 01:51:03,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [711738647] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:03,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:03,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 01:51:03,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130902259] [2022-02-15 01:51:03,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:03,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 01:51:03,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:03,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 01:51:03,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-15 01:51:03,127 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-02-15 01:51:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:03,663 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2022-02-15 01:51:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-15 01:51:03,663 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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 28 [2022-02-15 01:51:03,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:03,664 INFO L225 Difference]: With dead ends: 92 [2022-02-15 01:51:03,664 INFO L226 Difference]: Without dead ends: 87 [2022-02-15 01:51:03,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2022-02-15 01:51:03,665 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:03,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 52 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 01:51:03,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-15 01:51:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2022-02-15 01:51:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2022-02-15 01:51:03,701 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 28 [2022-02-15 01:51:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:03,701 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2022-02-15 01:51:03,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-02-15 01:51:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2022-02-15 01:51:03,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-15 01:51:03,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:03,702 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:03,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-15 01:51:03,702 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash 22222479, now seen corresponding path program 7 times [2022-02-15 01:51:03,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:03,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1584883857] [2022-02-15 01:51:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:03,757 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:03,758 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:03,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:03,762 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-02-15 01:51:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:03,779 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:51:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:03,924 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:03,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1584883857] [2022-02-15 01:51:03,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1584883857] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:03,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:03,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 01:51:03,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061797986] [2022-02-15 01:51:03,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:03,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 01:51:03,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:03,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 01:51:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-02-15 01:51:03,926 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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-02-15 01:51:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:04,778 INFO L93 Difference]: Finished difference Result 153 states and 212 transitions. [2022-02-15 01:51:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-15 01:51:04,779 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 29 [2022-02-15 01:51:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:04,780 INFO L225 Difference]: With dead ends: 153 [2022-02-15 01:51:04,780 INFO L226 Difference]: Without dead ends: 147 [2022-02-15 01:51:04,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2022-02-15 01:51:04,781 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 87 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:04,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 45 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 01:51:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-15 01:51:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2022-02-15 01:51:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.423529411764706) internal successors, (121), 85 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2022-02-15 01:51:04,827 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 29 [2022-02-15 01:51:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:04,827 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2022-02-15 01:51:04,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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-02-15 01:51:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2022-02-15 01:51:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-15 01:51:04,828 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:04,828 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:04,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-15 01:51:04,828 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:04,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:04,829 INFO L85 PathProgramCache]: Analyzing trace with hash 723391956, now seen corresponding path program 10 times [2022-02-15 01:51:04,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:04,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [699911154] [2022-02-15 01:51:04,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:04,878 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:04,878 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:04,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:04,883 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-02-15 01:51:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:04,900 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-02-15 01:51:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:05,036 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:05,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [699911154] [2022-02-15 01:51:05,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [699911154] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:05,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:05,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 01:51:05,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102824494] [2022-02-15 01:51:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:05,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 01:51:05,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:05,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 01:51:05,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-02-15 01:51:05,037 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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-02-15 01:51:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:05,764 INFO L93 Difference]: Finished difference Result 135 states and 184 transitions. [2022-02-15 01:51:05,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-15 01:51:05,764 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 30 [2022-02-15 01:51:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:05,765 INFO L225 Difference]: With dead ends: 135 [2022-02-15 01:51:05,765 INFO L226 Difference]: Without dead ends: 130 [2022-02-15 01:51:05,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2022-02-15 01:51:05,766 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 61 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:05,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 51 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 01:51:05,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-15 01:51:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 99. [2022-02-15 01:51:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2022-02-15 01:51:05,815 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 30 [2022-02-15 01:51:05,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:05,815 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2022-02-15 01:51:05,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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-02-15 01:51:05,816 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2022-02-15 01:51:05,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-15 01:51:05,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:05,816 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:05,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-15 01:51:05,816 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:05,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:05,816 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 11 times [2022-02-15 01:51:05,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:05,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1770044202] [2022-02-15 01:51:05,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:05,858 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:05,859 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:05,863 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-02-15 01:51:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:05,888 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:51:06,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:09,087 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:09,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1770044202] [2022-02-15 01:51:09,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1770044202] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:09,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:09,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 01:51:09,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915400267] [2022-02-15 01:51:09,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:09,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 01:51:09,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:09,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 01:51:09,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-02-15 01:51:09,089 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 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-02-15 01:51:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:10,015 INFO L93 Difference]: Finished difference Result 136 states and 175 transitions. [2022-02-15 01:51:10,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-15 01:51:10,015 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 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 31 [2022-02-15 01:51:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:10,016 INFO L225 Difference]: With dead ends: 136 [2022-02-15 01:51:10,016 INFO L226 Difference]: Without dead ends: 123 [2022-02-15 01:51:10,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2022-02-15 01:51:10,017 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:10,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 84 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 324 Invalid, 0 Unknown, 67 Unchecked, 0.3s Time] [2022-02-15 01:51:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-02-15 01:51:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2022-02-15 01:51:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.361904761904762) internal successors, (143), 105 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 147 transitions. [2022-02-15 01:51:10,092 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 147 transitions. Word has length 31 [2022-02-15 01:51:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:10,092 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 147 transitions. [2022-02-15 01:51:10,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 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-02-15 01:51:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 147 transitions. [2022-02-15 01:51:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-15 01:51:10,092 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:10,092 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:10,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-15 01:51:10,093 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:10,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash -628453999, now seen corresponding path program 12 times [2022-02-15 01:51:10,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:10,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [390157539] [2022-02-15 01:51:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:10,131 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:10,131 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:10,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:10,135 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-02-15 01:51:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:10,151 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-02-15 01:51:10,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:10,317 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:10,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [390157539] [2022-02-15 01:51:10,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [390157539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:10,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:10,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 01:51:10,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485757587] [2022-02-15 01:51:10,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:10,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 01:51:10,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:10,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 01:51:10,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-02-15 01:51:10,318 INFO L87 Difference]: Start difference. First operand 110 states and 147 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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-02-15 01:51:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:11,095 INFO L93 Difference]: Finished difference Result 187 states and 245 transitions. [2022-02-15 01:51:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-15 01:51:11,095 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 31 [2022-02-15 01:51:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:11,096 INFO L225 Difference]: With dead ends: 187 [2022-02-15 01:51:11,096 INFO L226 Difference]: Without dead ends: 153 [2022-02-15 01:51:11,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2022-02-15 01:51:11,097 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:11,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 85 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 01:51:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-15 01:51:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 91. [2022-02-15 01:51:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2022-02-15 01:51:11,144 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 31 [2022-02-15 01:51:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:11,144 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2022-02-15 01:51:11,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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-02-15 01:51:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2022-02-15 01:51:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-15 01:51:11,144 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:11,145 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:11,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-15 01:51:11,145 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash 944401809, now seen corresponding path program 13 times [2022-02-15 01:51:11,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:11,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1586052890] [2022-02-15 01:51:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:11,187 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:11,187 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:11,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:11,191 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-02-15 01:51:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:11,203 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-02-15 01:51:11,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:11,372 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:11,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1586052890] [2022-02-15 01:51:11,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1586052890] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:11,372 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:11,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 01:51:11,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398809559] [2022-02-15 01:51:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:11,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 01:51:11,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:11,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 01:51:11,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-02-15 01:51:11,374 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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-02-15 01:51:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:12,039 INFO L93 Difference]: Finished difference Result 215 states and 322 transitions. [2022-02-15 01:51:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-15 01:51:12,040 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 31 [2022-02-15 01:51:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:12,041 INFO L225 Difference]: With dead ends: 215 [2022-02-15 01:51:12,041 INFO L226 Difference]: Without dead ends: 196 [2022-02-15 01:51:12,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2022-02-15 01:51:12,042 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 140 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:12,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 46 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 01:51:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-02-15 01:51:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 105. [2022-02-15 01:51:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2022-02-15 01:51:12,106 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 31 [2022-02-15 01:51:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:12,107 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2022-02-15 01:51:12,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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-02-15 01:51:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2022-02-15 01:51:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-15 01:51:12,107 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:12,107 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:12,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-15 01:51:12,107 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:12,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:12,108 INFO L85 PathProgramCache]: Analyzing trace with hash -420451419, now seen corresponding path program 14 times [2022-02-15 01:51:12,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:12,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [452190893] [2022-02-15 01:51:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:12,140 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:12,141 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:12,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:12,164 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-02-15 01:51:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:12,200 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-02-15 01:51:12,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:12,390 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:12,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [452190893] [2022-02-15 01:51:12,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [452190893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:12,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:12,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 01:51:12,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414071059] [2022-02-15 01:51:12,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:12,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 01:51:12,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:12,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 01:51:12,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-15 01:51:12,392 INFO L87 Difference]: Start difference. First operand 105 states and 142 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-02-15 01:51:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:13,147 INFO L93 Difference]: Finished difference Result 234 states and 348 transitions. [2022-02-15 01:51:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 01:51:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 32 [2022-02-15 01:51:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:13,148 INFO L225 Difference]: With dead ends: 234 [2022-02-15 01:51:13,148 INFO L226 Difference]: Without dead ends: 215 [2022-02-15 01:51:13,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2022-02-15 01:51:13,149 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 120 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:13,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 51 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 01:51:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-02-15 01:51:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 118. [2022-02-15 01:51:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 161 transitions. [2022-02-15 01:51:13,222 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 161 transitions. Word has length 32 [2022-02-15 01:51:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:13,222 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 161 transitions. [2022-02-15 01:51:13,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-02-15 01:51:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 161 transitions. [2022-02-15 01:51:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-15 01:51:13,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:13,223 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:13,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-15 01:51:13,223 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1665087761, now seen corresponding path program 15 times [2022-02-15 01:51:13,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:13,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [852691111] [2022-02-15 01:51:13,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:13,267 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:13,267 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:13,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:13,271 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-02-15 01:51:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:13,287 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-02-15 01:51:13,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:13,438 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:13,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [852691111] [2022-02-15 01:51:13,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [852691111] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:13,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:13,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 01:51:13,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135895783] [2022-02-15 01:51:13,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:13,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 01:51:13,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:13,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 01:51:13,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-02-15 01:51:13,439 INFO L87 Difference]: Start difference. First operand 118 states and 161 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-02-15 01:51:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:14,450 INFO L93 Difference]: Finished difference Result 188 states and 247 transitions. [2022-02-15 01:51:14,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 01:51:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 33 [2022-02-15 01:51:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:14,451 INFO L225 Difference]: With dead ends: 188 [2022-02-15 01:51:14,451 INFO L226 Difference]: Without dead ends: 170 [2022-02-15 01:51:14,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-02-15 01:51:14,452 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 55 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:14,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 78 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 01:51:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-15 01:51:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 105. [2022-02-15 01:51:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2022-02-15 01:51:14,519 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 33 [2022-02-15 01:51:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:14,519 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2022-02-15 01:51:14,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-02-15 01:51:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2022-02-15 01:51:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-15 01:51:14,519 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:14,520 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:14,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-15 01:51:14,520 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:14,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1090479377, now seen corresponding path program 16 times [2022-02-15 01:51:14,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:14,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523115624] [2022-02-15 01:51:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:14,560 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:14,560 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:14,564 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-02-15 01:51:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:14,587 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-02-15 01:51:14,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:14,789 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:14,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523115624] [2022-02-15 01:51:14,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [523115624] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:14,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:14,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-15 01:51:14,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470597496] [2022-02-15 01:51:14,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:14,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 01:51:14,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:14,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 01:51:14,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-02-15 01:51:14,790 INFO L87 Difference]: Start difference. First operand 105 states and 142 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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-02-15 01:51:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:16,006 INFO L93 Difference]: Finished difference Result 277 states and 372 transitions. [2022-02-15 01:51:16,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-15 01:51:16,006 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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 33 [2022-02-15 01:51:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:16,007 INFO L225 Difference]: With dead ends: 277 [2022-02-15 01:51:16,007 INFO L226 Difference]: Without dead ends: 182 [2022-02-15 01:51:16,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=1879, Unknown=0, NotChecked=0, Total=2162 [2022-02-15 01:51:16,009 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 74 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:16,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 81 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 01:51:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-15 01:51:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 103. [2022-02-15 01:51:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 136 transitions. [2022-02-15 01:51:16,083 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 136 transitions. Word has length 33 [2022-02-15 01:51:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:16,083 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 136 transitions. [2022-02-15 01:51:16,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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-02-15 01:51:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 136 transitions. [2022-02-15 01:51:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-15 01:51:16,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:16,084 INFO L514 BasicCegarLoop]: trace histogram [7, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:16,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-15 01:51:16,084 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 814681119, now seen corresponding path program 17 times [2022-02-15 01:51:16,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:16,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [783208042] [2022-02-15 01:51:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:16,139 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:16,139 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:16,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:16,143 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-02-15 01:51:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:16,156 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-02-15 01:51:16,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:16,439 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:16,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [783208042] [2022-02-15 01:51:16,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [783208042] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:16,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:16,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-15 01:51:16,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076572720] [2022-02-15 01:51:16,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:16,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 01:51:16,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:16,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 01:51:16,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-02-15 01:51:16,440 INFO L87 Difference]: Start difference. First operand 103 states and 136 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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-02-15 01:51:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:17,531 INFO L93 Difference]: Finished difference Result 238 states and 351 transitions. [2022-02-15 01:51:17,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-15 01:51:17,531 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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 35 [2022-02-15 01:51:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:17,532 INFO L225 Difference]: With dead ends: 238 [2022-02-15 01:51:17,532 INFO L226 Difference]: Without dead ends: 224 [2022-02-15 01:51:17,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2022-02-15 01:51:17,533 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 161 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:17,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 61 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 01:51:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-02-15 01:51:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 116. [2022-02-15 01:51:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 155 transitions. [2022-02-15 01:51:17,624 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 155 transitions. Word has length 35 [2022-02-15 01:51:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:17,624 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 155 transitions. [2022-02-15 01:51:17,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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-02-15 01:51:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 155 transitions. [2022-02-15 01:51:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-15 01:51:17,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:17,625 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:17,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-15 01:51:17,625 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:17,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:17,626 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 18 times [2022-02-15 01:51:17,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:17,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1716456572] [2022-02-15 01:51:17,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:17,734 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:17,735 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:17,739 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-02-15 01:51:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:17,803 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:51:18,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:32,691 WARN L228 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:51:44,384 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:44,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1716456572] [2022-02-15 01:51:44,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1716456572] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:44,385 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:44,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-15 01:51:44,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699735986] [2022-02-15 01:51:44,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:44,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-15 01:51:44,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:44,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-15 01:51:44,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=524, Unknown=4, NotChecked=0, Total=600 [2022-02-15 01:51:44,386 INFO L87 Difference]: Start difference. First operand 116 states and 155 transitions. Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 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-02-15 01:51:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:45,293 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2022-02-15 01:51:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-15 01:51:45,293 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 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 36 [2022-02-15 01:51:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:45,294 INFO L225 Difference]: With dead ends: 131 [2022-02-15 01:51:45,294 INFO L226 Difference]: Without dead ends: 126 [2022-02-15 01:51:45,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=156, Invalid=1480, Unknown=4, NotChecked=0, Total=1640 [2022-02-15 01:51:45,295 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:45,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 83 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 324 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2022-02-15 01:51:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-15 01:51:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2022-02-15 01:51:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 161 transitions. [2022-02-15 01:51:45,387 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 161 transitions. Word has length 36 [2022-02-15 01:51:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:45,387 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 161 transitions. [2022-02-15 01:51:45,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 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-02-15 01:51:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 161 transitions. [2022-02-15 01:51:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-15 01:51:45,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:45,388 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:45,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-15 01:51:45,389 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:45,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash -598402012, now seen corresponding path program 19 times [2022-02-15 01:51:45,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:45,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [423604209] [2022-02-15 01:51:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:45,428 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:45,428 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:45,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:45,432 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-02-15 01:51:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:45,459 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-02-15 01:51:45,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:45,676 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:45,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [423604209] [2022-02-15 01:51:45,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [423604209] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:45,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:45,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-15 01:51:45,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922756083] [2022-02-15 01:51:45,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:45,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-15 01:51:45,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:45,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-15 01:51:45,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-02-15 01:51:45,678 INFO L87 Difference]: Start difference. First operand 122 states and 161 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-02-15 01:51:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:46,898 INFO L93 Difference]: Finished difference Result 204 states and 264 transitions. [2022-02-15 01:51:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-15 01:51:46,899 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 36 [2022-02-15 01:51:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:46,899 INFO L225 Difference]: With dead ends: 204 [2022-02-15 01:51:46,899 INFO L226 Difference]: Without dead ends: 199 [2022-02-15 01:51:46,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=413, Invalid=1939, Unknown=0, NotChecked=0, Total=2352 [2022-02-15 01:51:46,900 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:46,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 39 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 01:51:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-02-15 01:51:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 127. [2022-02-15 01:51:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.3360655737704918) internal successors, (163), 122 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 167 transitions. [2022-02-15 01:51:46,996 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 167 transitions. Word has length 36 [2022-02-15 01:51:46,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:46,996 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 167 transitions. [2022-02-15 01:51:46,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-02-15 01:51:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 167 transitions. [2022-02-15 01:51:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-15 01:51:46,997 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:46,997 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:46,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-15 01:51:46,997 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1800809297, now seen corresponding path program 8 times [2022-02-15 01:51:46,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:46,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2097044417] [2022-02-15 01:51:46,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:47,052 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:47,053 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:47,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:47,057 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-02-15 01:51:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:47,073 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-02-15 01:51:47,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:47,333 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:47,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2097044417] [2022-02-15 01:51:47,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2097044417] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:47,333 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:47,333 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-15 01:51:47,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140703736] [2022-02-15 01:51:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:47,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-15 01:51:47,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:47,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-15 01:51:47,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-02-15 01:51:47,334 INFO L87 Difference]: Start difference. First operand 127 states and 167 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-02-15 01:51:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:48,709 INFO L93 Difference]: Finished difference Result 289 states and 423 transitions. [2022-02-15 01:51:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-15 01:51:48,709 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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 36 [2022-02-15 01:51:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:48,711 INFO L225 Difference]: With dead ends: 289 [2022-02-15 01:51:48,711 INFO L226 Difference]: Without dead ends: 273 [2022-02-15 01:51:48,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2022-02-15 01:51:48,712 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 205 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:48,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 56 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 01:51:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-02-15 01:51:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 140. [2022-02-15 01:51:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.3407407407407408) internal successors, (181), 135 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 185 transitions. [2022-02-15 01:51:48,840 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 185 transitions. Word has length 36 [2022-02-15 01:51:48,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:48,840 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 185 transitions. [2022-02-15 01:51:48,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-02-15 01:51:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 185 transitions. [2022-02-15 01:51:48,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-15 01:51:48,841 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:48,841 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:48,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-15 01:51:48,842 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:48,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash -424783871, now seen corresponding path program 20 times [2022-02-15 01:51:48,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:48,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297238001] [2022-02-15 01:51:48,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:48,873 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:48,874 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:48,877 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-02-15 01:51:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:48,897 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-02-15 01:51:48,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:48,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-02-15 01:51:49,069 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:49,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297238001] [2022-02-15 01:51:49,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [297238001] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:49,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:49,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 01:51:49,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29564548] [2022-02-15 01:51:49,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:49,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 01:51:49,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:49,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 01:51:49,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-15 01:51:49,071 INFO L87 Difference]: Start difference. First operand 140 states and 185 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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-02-15 01:51:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:49,963 INFO L93 Difference]: Finished difference Result 232 states and 294 transitions. [2022-02-15 01:51:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-15 01:51:49,963 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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 37 [2022-02-15 01:51:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:49,964 INFO L225 Difference]: With dead ends: 232 [2022-02-15 01:51:49,965 INFO L226 Difference]: Without dead ends: 211 [2022-02-15 01:51:49,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-02-15 01:51:49,965 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:49,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 60 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 01:51:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-02-15 01:51:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 140. [2022-02-15 01:51:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 135 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 184 transitions. [2022-02-15 01:51:50,089 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 184 transitions. Word has length 37 [2022-02-15 01:51:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:50,089 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 184 transitions. [2022-02-15 01:51:50,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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-02-15 01:51:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 184 transitions. [2022-02-15 01:51:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-15 01:51:50,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:50,090 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:50,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-15 01:51:50,090 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:50,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:50,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2005031169, now seen corresponding path program 21 times [2022-02-15 01:51:50,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:50,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370887755] [2022-02-15 01:51:50,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:50,151 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:50,151 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:50,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:50,155 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-02-15 01:51:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:50,176 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-02-15 01:51:50,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:50,501 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:50,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370887755] [2022-02-15 01:51:50,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1370887755] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:50,501 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:50,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-15 01:51:50,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038193645] [2022-02-15 01:51:50,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:50,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-15 01:51:50,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:50,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-15 01:51:50,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-02-15 01:51:50,502 INFO L87 Difference]: Start difference. First operand 140 states and 184 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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-02-15 01:51:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:53,039 INFO L93 Difference]: Finished difference Result 439 states and 567 transitions. [2022-02-15 01:51:53,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-15 01:51:53,040 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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 37 [2022-02-15 01:51:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:53,041 INFO L225 Difference]: With dead ends: 439 [2022-02-15 01:51:53,041 INFO L226 Difference]: Without dead ends: 310 [2022-02-15 01:51:53,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=447, Invalid=3335, Unknown=0, NotChecked=0, Total=3782 [2022-02-15 01:51:53,043 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:53,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 98 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 01:51:53,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-02-15 01:51:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 139. [2022-02-15 01:51:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 134 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 179 transitions. [2022-02-15 01:51:53,222 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 179 transitions. Word has length 37 [2022-02-15 01:51:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:53,222 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 179 transitions. [2022-02-15 01:51:53,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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-02-15 01:51:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 179 transitions. [2022-02-15 01:51:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-15 01:51:53,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:53,223 INFO L514 BasicCegarLoop]: trace histogram [9, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:53,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-15 01:51:53,223 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:53,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash -39042254, now seen corresponding path program 9 times [2022-02-15 01:51:53,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:53,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [230777598] [2022-02-15 01:51:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:53,262 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:53,262 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:53,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:53,267 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-02-15 01:51:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:53,287 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-02-15 01:51:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:53,772 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:53,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [230777598] [2022-02-15 01:51:53,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [230777598] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:53,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:53,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-15 01:51:53,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062430144] [2022-02-15 01:51:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:53,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-15 01:51:53,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:53,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-15 01:51:53,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-02-15 01:51:53,773 INFO L87 Difference]: Start difference. First operand 139 states and 179 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-02-15 01:51:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:55,724 INFO L93 Difference]: Finished difference Result 329 states and 484 transitions. [2022-02-15 01:51:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-15 01:51:55,724 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 38 [2022-02-15 01:51:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:55,726 INFO L225 Difference]: With dead ends: 329 [2022-02-15 01:51:55,726 INFO L226 Difference]: Without dead ends: 308 [2022-02-15 01:51:55,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=360, Invalid=1200, Unknown=0, NotChecked=0, Total=1560 [2022-02-15 01:51:55,727 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 181 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:55,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 68 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-15 01:51:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-02-15 01:51:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 153. [2022-02-15 01:51:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.3175675675675675) internal successors, (195), 148 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 199 transitions. [2022-02-15 01:51:55,875 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 199 transitions. Word has length 38 [2022-02-15 01:51:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:55,875 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 199 transitions. [2022-02-15 01:51:55,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-02-15 01:51:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 199 transitions. [2022-02-15 01:51:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-15 01:51:55,876 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:55,876 INFO L514 BasicCegarLoop]: trace histogram [10, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:55,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-15 01:51:55,876 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:55,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash 479003230, now seen corresponding path program 10 times [2022-02-15 01:51:55,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:55,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2110068793] [2022-02-15 01:51:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:55,904 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:55,904 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:55,909 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-02-15 01:51:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:55,924 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-02-15 01:51:56,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:56,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-02-15 01:51:56,357 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:56,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2110068793] [2022-02-15 01:51:56,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2110068793] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:56,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:56,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 01:51:56,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738134137] [2022-02-15 01:51:56,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:56,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 01:51:56,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 01:51:56,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-02-15 01:51:56,359 INFO L87 Difference]: Start difference. First operand 153 states and 199 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-02-15 01:51:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:58,656 INFO L93 Difference]: Finished difference Result 348 states and 509 transitions. [2022-02-15 01:51:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-15 01:51:58,656 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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 39 [2022-02-15 01:51:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:58,657 INFO L225 Difference]: With dead ends: 348 [2022-02-15 01:51:58,657 INFO L226 Difference]: Without dead ends: 327 [2022-02-15 01:51:58,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2022-02-15 01:51:58,659 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 283 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:58,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 78 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-15 01:51:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-02-15 01:51:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 166. [2022-02-15 01:51:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 161 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 217 transitions. [2022-02-15 01:51:58,819 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 217 transitions. Word has length 39 [2022-02-15 01:51:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:58,819 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 217 transitions. [2022-02-15 01:51:58,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-02-15 01:51:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 217 transitions. [2022-02-15 01:51:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-15 01:51:58,820 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:58,820 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:58,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-15 01:51:58,820 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash -266855244, now seen corresponding path program 22 times [2022-02-15 01:51:58,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:58,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [45957396] [2022-02-15 01:51:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:58,853 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:58,853 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:58,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:58,859 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-02-15 01:51:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:58,888 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-15 01:51:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:52:17,502 WARN L228 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:52:29,490 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:52:29,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [45957396] [2022-02-15 01:52:29,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [45957396] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:52:29,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:52:29,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-02-15 01:52:29,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830143240] [2022-02-15 01:52:29,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:52:29,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-15 01:52:29,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:52:29,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-15 01:52:29,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=531, Unknown=1, NotChecked=0, Total=650 [2022-02-15 01:52:29,492 INFO L87 Difference]: Start difference. First operand 166 states and 217 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-02-15 01:52:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:52:30,170 INFO L93 Difference]: Finished difference Result 187 states and 248 transitions. [2022-02-15 01:52:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-15 01:52:30,170 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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 40 [2022-02-15 01:52:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:52:30,171 INFO L225 Difference]: With dead ends: 187 [2022-02-15 01:52:30,171 INFO L226 Difference]: Without dead ends: 182 [2022-02-15 01:52:30,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=250, Invalid=1309, Unknown=1, NotChecked=0, Total=1560 [2022-02-15 01:52:30,172 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:52:30,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 87 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 317 Invalid, 0 Unknown, 42 Unchecked, 0.3s Time] [2022-02-15 01:52:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-15 01:52:30,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2022-02-15 01:52:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:52:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 214 transitions. [2022-02-15 01:52:30,342 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 214 transitions. Word has length 40 [2022-02-15 01:52:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:52:30,342 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 214 transitions. [2022-02-15 01:52:30,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-02-15 01:52:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2022-02-15 01:52:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-15 01:52:30,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:52:30,343 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:52:30,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-15 01:52:30,344 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:52:30,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:52:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash -355872300, now seen corresponding path program 11 times [2022-02-15 01:52:30,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:52:30,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [838002150] [2022-02-15 01:52:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:52:30,385 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:52:30,385 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:52:30,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:52:30,388 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-02-15 01:52:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:52:30,413 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-02-15 01:52:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:52:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:52:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:52:30,865 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:52:30,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [838002150] [2022-02-15 01:52:30,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [838002150] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:52:30,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:52:30,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-02-15 01:52:30,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822117665] [2022-02-15 01:52:30,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:52:30,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-15 01:52:30,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:52:30,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-15 01:52:30,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-02-15 01:52:30,867 INFO L87 Difference]: Start difference. First operand 165 states and 214 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-02-15 01:52:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:52:35,602 INFO L93 Difference]: Finished difference Result 598 states and 755 transitions. [2022-02-15 01:52:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-02-15 01:52:35,603 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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 40 [2022-02-15 01:52:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:52:35,605 INFO L225 Difference]: With dead ends: 598 [2022-02-15 01:52:35,605 INFO L226 Difference]: Without dead ends: 458 [2022-02-15 01:52:35,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1904 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=687, Invalid=5955, Unknown=0, NotChecked=0, Total=6642 [2022-02-15 01:52:35,607 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 103 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-15 01:52:35,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 108 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-15 01:52:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-02-15 01:52:35,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 172. [2022-02-15 01:52:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.281437125748503) internal successors, (214), 167 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:52:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 218 transitions. [2022-02-15 01:52:35,792 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 218 transitions. Word has length 40 [2022-02-15 01:52:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:52:35,792 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 218 transitions. [2022-02-15 01:52:35,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-02-15 01:52:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 218 transitions. [2022-02-15 01:52:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-15 01:52:35,793 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:52:35,793 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:52:35,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-02-15 01:52:35,793 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:52:35,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:52:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 23 times [2022-02-15 01:52:35,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:52:35,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1367436899] [2022-02-15 01:52:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:52:35,841 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:52:35,842 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:52:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:52:35,845 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-02-15 01:52:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:52:35,883 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:52:36,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:52:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:52:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:52:59,625 WARN L228 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:53:18,995 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:53:18,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1367436899] [2022-02-15 01:53:18,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1367436899] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:53:18,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:53:18,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-02-15 01:53:18,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22348502] [2022-02-15 01:53:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:53:18,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-15 01:53:18,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:53:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-15 01:53:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=667, Unknown=5, NotChecked=0, Total=756 [2022-02-15 01:53:18,996 INFO L87 Difference]: Start difference. First operand 172 states and 218 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 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-02-15 01:53:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:53:20,421 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2022-02-15 01:53:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 01:53:20,422 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 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 41 [2022-02-15 01:53:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:53:20,422 INFO L225 Difference]: With dead ends: 189 [2022-02-15 01:53:20,423 INFO L226 Difference]: Without dead ends: 184 [2022-02-15 01:53:20,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 43.6s TimeCoverageRelationStatistics Valid=176, Invalid=1889, Unknown=5, NotChecked=0, Total=2070 [2022-02-15 01:53:20,424 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 01:53:20,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 103 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 445 Invalid, 0 Unknown, 109 Unchecked, 0.4s Time] [2022-02-15 01:53:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-02-15 01:53:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2022-02-15 01:53:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.281437125748503) internal successors, (214), 167 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:53:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 218 transitions. [2022-02-15 01:53:20,617 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 218 transitions. Word has length 41 [2022-02-15 01:53:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:53:20,617 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 218 transitions. [2022-02-15 01:53:20,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 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-02-15 01:53:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 218 transitions. [2022-02-15 01:53:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-15 01:53:20,618 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:53:20,618 INFO L514 BasicCegarLoop]: trace histogram [11, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:53:20,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-15 01:53:20,618 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:53:20,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:53:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1435666111, now seen corresponding path program 12 times [2022-02-15 01:53:20,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:53:20,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [894691542] [2022-02-15 01:53:20,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:53:20,649 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:53:20,650 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:53:20,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:53:20,653 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_44.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:20,669 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_44.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:20,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:53:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:53:21,391 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:53:21,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [894691542] [2022-02-15 01:53:21,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [894691542] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:53:21,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:53:21,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-02-15 01:53:21,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461774593] [2022-02-15 01:53:21,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:53:21,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-15 01:53:21,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:53:21,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-15 01:53:21,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-02-15 01:53:21,392 INFO L87 Difference]: Start difference. First operand 172 states and 218 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-02-15 01:53:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:53:24,425 INFO L93 Difference]: Finished difference Result 396 states and 575 transitions. [2022-02-15 01:53:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-15 01:53:24,426 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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 41 [2022-02-15 01:53:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:53:24,427 INFO L225 Difference]: With dead ends: 396 [2022-02-15 01:53:24,427 INFO L226 Difference]: Without dead ends: 374 [2022-02-15 01:53:24,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=483, Invalid=1679, Unknown=0, NotChecked=0, Total=2162 [2022-02-15 01:53:24,428 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 204 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-15 01:53:24,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 98 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-15 01:53:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-02-15 01:53:24,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 186. [2022-02-15 01:53:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.292817679558011) internal successors, (234), 181 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:53:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 238 transitions. [2022-02-15 01:53:24,648 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 238 transitions. Word has length 41 [2022-02-15 01:53:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:53:24,649 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 238 transitions. [2022-02-15 01:53:24,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-02-15 01:53:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 238 transitions. [2022-02-15 01:53:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-15 01:53:24,650 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:53:24,650 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:53:24,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-15 01:53:24,650 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:53:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:53:24,650 INFO L85 PathProgramCache]: Analyzing trace with hash 410232754, now seen corresponding path program 24 times [2022-02-15 01:53:24,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:53:24,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1920306964] [2022-02-15 01:53:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:53:24,695 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:53:24,696 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:53:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:53:24,699 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_45.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:24,719 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_45.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:53:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:53:24,942 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:53:24,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1920306964] [2022-02-15 01:53:24,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1920306964] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:53:24,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:53:24,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 01:53:24,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097787376] [2022-02-15 01:53:24,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:53:24,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 01:53:24,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:53:24,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 01:53:24,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-02-15 01:53:24,944 INFO L87 Difference]: Start difference. First operand 186 states and 238 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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-02-15 01:53:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:53:27,083 INFO L93 Difference]: Finished difference Result 325 states and 401 transitions. [2022-02-15 01:53:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-15 01:53:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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 42 [2022-02-15 01:53:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:53:27,084 INFO L225 Difference]: With dead ends: 325 [2022-02-15 01:53:27,084 INFO L226 Difference]: Without dead ends: 294 [2022-02-15 01:53:27,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=357, Invalid=1713, Unknown=0, NotChecked=0, Total=2070 [2022-02-15 01:53:27,086 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 61 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 01:53:27,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 60 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 01:53:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-02-15 01:53:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 174. [2022-02-15 01:53:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.301775147928994) internal successors, (220), 169 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:53:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 224 transitions. [2022-02-15 01:53:27,316 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 224 transitions. Word has length 42 [2022-02-15 01:53:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:53:27,316 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 224 transitions. [2022-02-15 01:53:27,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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-02-15 01:53:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 224 transitions. [2022-02-15 01:53:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-15 01:53:27,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:53:27,317 INFO L514 BasicCegarLoop]: trace histogram [12, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:53:27,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-02-15 01:53:27,317 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:53:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:53:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1049677711, now seen corresponding path program 13 times [2022-02-15 01:53:27,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:53:27,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1834639102] [2022-02-15 01:53:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:53:27,356 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:53:27,356 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:53:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:53:27,359 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_46.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:27,376 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_46.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:27,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:53:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:53:28,199 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:53:28,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1834639102] [2022-02-15 01:53:28,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1834639102] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:53:28,199 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:53:28,199 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-15 01:53:28,199 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992701409] [2022-02-15 01:53:28,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:53:28,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-15 01:53:28,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:53:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-15 01:53:28,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-02-15 01:53:28,200 INFO L87 Difference]: Start difference. First operand 174 states and 224 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-02-15 01:53:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:53:31,796 INFO L93 Difference]: Finished difference Result 404 states and 587 transitions. [2022-02-15 01:53:31,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-15 01:53:31,796 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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 42 [2022-02-15 01:53:31,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:53:31,797 INFO L225 Difference]: With dead ends: 404 [2022-02-15 01:53:31,797 INFO L226 Difference]: Without dead ends: 381 [2022-02-15 01:53:31,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2022-02-15 01:53:31,798 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 264 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-15 01:53:31,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 85 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-15 01:53:31,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-02-15 01:53:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 187. [2022-02-15 01:53:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:53:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 242 transitions. [2022-02-15 01:53:32,053 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 242 transitions. Word has length 42 [2022-02-15 01:53:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:53:32,054 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 242 transitions. [2022-02-15 01:53:32,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-02-15 01:53:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 242 transitions. [2022-02-15 01:53:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-15 01:53:32,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:53:32,054 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:53:32,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-02-15 01:53:32,054 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:53:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:53:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash -774755905, now seen corresponding path program 14 times [2022-02-15 01:53:32,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:53:32,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1340414220] [2022-02-15 01:53:32,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:53:32,093 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:53:32,094 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:53:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:53:32,098 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_47.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:32,128 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_47.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:32,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:53:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:53:49,818 WARN L838 $PredicateComparison]: unable to prove that (and (or (= (+ (- 6) c_main_~y~0) 0) (and (forall ((v_it_47 Int)) (or (< 0 (mod (+ c_main_~x~0 c_main_~y~0 (* 4294967295 v_it_47)) 4294967296)) (not (<= (+ 7 v_it_47) c_main_~y~0)) (not (<= 1 v_it_47)))) (< 6 c_main_~y~0) (< 0 (mod (+ c_main_~x~0 c_main_~y~0) 4294967296)))) (< 0 (mod (+ c_main_~x~0 1) 4294967296)) (< 0 (mod (+ 3 c_main_~x~0) 4294967296)) (< 0 (mod (+ 5 c_main_~x~0) 4294967296)) (< 0 (mod (+ 6 c_main_~x~0) 4294967296)) (< 0 (mod (+ 4 c_main_~x~0) 4294967296)) (< 0 (mod (+ 2 c_main_~x~0) 4294967296))) is different from false [2022-02-15 01:53:49,820 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:53:49,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1340414220] [2022-02-15 01:53:49,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1340414220] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:53:49,820 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:53:49,821 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-02-15 01:53:49,821 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372435973] [2022-02-15 01:53:49,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:53:49,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-15 01:53:49,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:53:49,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-15 01:53:49,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=573, Unknown=1, NotChecked=50, Total=756 [2022-02-15 01:53:49,822 INFO L87 Difference]: Start difference. First operand 187 states and 242 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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-02-15 01:53:51,902 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 0 (mod (+ c_main_~x~0 c_main_~y~0) 4294967296)))) (and (or (= (+ (- 6) c_main_~y~0) 0) (and (forall ((v_it_47 Int)) (or (< 0 (mod (+ c_main_~x~0 c_main_~y~0 (* 4294967295 v_it_47)) 4294967296)) (not (<= (+ 7 v_it_47) c_main_~y~0)) (not (<= 1 v_it_47)))) (< 6 c_main_~y~0) .cse0)) (< 0 (mod (+ c_main_~x~0 1) 4294967296)) (< 0 (mod (+ 3 c_main_~x~0) 4294967296)) (< 0 (mod (+ 5 c_main_~x~0) 4294967296)) (< 0 (mod (+ 6 c_main_~x~0) 4294967296)) (< 0 (mod (+ 4 c_main_~x~0) 4294967296)) (or (and .cse0 (forall ((v_it_47 Int)) (or (< 0 (mod (+ c_main_~x~0 c_main_~y~0 (* 4294967295 v_it_47)) 4294967296)) (not (<= (+ 6 v_it_47) c_main_~y~0)) (not (<= 1 v_it_47)))) (< 5 c_main_~y~0)) (= (+ (- 5) c_main_~y~0) 0)) (< 0 (mod (+ 2 c_main_~x~0) 4294967296)))) is different from false [2022-02-15 01:53:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:53:52,689 INFO L93 Difference]: Finished difference Result 236 states and 316 transitions. [2022-02-15 01:53:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 01:53:52,689 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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 43 [2022-02-15 01:53:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:53:52,690 INFO L225 Difference]: With dead ends: 236 [2022-02-15 01:53:52,690 INFO L226 Difference]: Without dead ends: 231 [2022-02-15 01:53:52,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=298, Invalid=1514, Unknown=2, NotChecked=166, Total=1980 [2022-02-15 01:53:52,691 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 51 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:53:52,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 58 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 244 Invalid, 0 Unknown, 103 Unchecked, 0.3s Time] [2022-02-15 01:53:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-15 01:53:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 211. [2022-02-15 01:53:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3155339805825244) internal successors, (271), 206 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:53:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 275 transitions. [2022-02-15 01:53:53,067 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 275 transitions. Word has length 43 [2022-02-15 01:53:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:53:53,067 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 275 transitions. [2022-02-15 01:53:53,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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-02-15 01:53:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 275 transitions. [2022-02-15 01:53:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-15 01:53:53,068 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:53:53,068 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:53:53,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-02-15 01:53:53,068 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:53:53,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:53:53,068 INFO L85 PathProgramCache]: Analyzing trace with hash 919531266, now seen corresponding path program 25 times [2022-02-15 01:53:53,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:53:53,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122020302] [2022-02-15 01:53:53,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:53:53,096 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:53:53,097 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:53:53,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:53:53,101 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_48.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:53,131 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_48.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:53:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:53:54,036 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:53:54,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [122020302] [2022-02-15 01:53:54,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [122020302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:53:54,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:53:54,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-02-15 01:53:54,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795450459] [2022-02-15 01:53:54,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:53:54,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-15 01:53:54,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:53:54,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-15 01:53:54,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-02-15 01:53:54,038 INFO L87 Difference]: Start difference. First operand 211 states and 275 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-02-15 01:53:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:53:57,480 INFO L93 Difference]: Finished difference Result 432 states and 529 transitions. [2022-02-15 01:53:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 01:53:57,481 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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 44 [2022-02-15 01:53:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:53:57,482 INFO L225 Difference]: With dead ends: 432 [2022-02-15 01:53:57,482 INFO L226 Difference]: Without dead ends: 414 [2022-02-15 01:53:57,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=264, Invalid=1716, Unknown=0, NotChecked=0, Total=1980 [2022-02-15 01:53:57,483 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 01:53:57,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 67 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 01:53:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-02-15 01:53:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 211. [2022-02-15 01:53:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3106796116504855) internal successors, (270), 206 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:53:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 274 transitions. [2022-02-15 01:53:57,760 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 274 transitions. Word has length 44 [2022-02-15 01:53:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:53:57,760 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 274 transitions. [2022-02-15 01:53:57,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-02-15 01:53:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 274 transitions. [2022-02-15 01:53:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-15 01:53:57,761 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:53:57,761 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:53:57,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-02-15 01:53:57,761 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:53:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:53:57,762 INFO L85 PathProgramCache]: Analyzing trace with hash -107841918, now seen corresponding path program 15 times [2022-02-15 01:53:57,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:53:57,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1373040512] [2022-02-15 01:53:57,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:53:57,794 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:53:57,794 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:53:57,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:53:57,798 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_49.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:57,835 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_49.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:53:57,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:53:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:53:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:53:58,262 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:53:58,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1373040512] [2022-02-15 01:53:58,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1373040512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:53:58,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:53:58,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-15 01:53:58,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867965585] [2022-02-15 01:53:58,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:53:58,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-15 01:53:58,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:53:58,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-15 01:53:58,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-02-15 01:53:58,264 INFO L87 Difference]: Start difference. First operand 211 states and 274 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-02-15 01:54:04,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:54:04,769 INFO L93 Difference]: Finished difference Result 483 states and 598 transitions. [2022-02-15 01:54:04,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-15 01:54:04,770 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 44 [2022-02-15 01:54:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:54:04,771 INFO L225 Difference]: With dead ends: 483 [2022-02-15 01:54:04,771 INFO L226 Difference]: Without dead ends: 477 [2022-02-15 01:54:04,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1734 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=790, Invalid=5530, Unknown=0, NotChecked=0, Total=6320 [2022-02-15 01:54:04,772 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 90 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-15 01:54:04,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 84 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-02-15 01:54:04,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-02-15 01:54:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 233. [2022-02-15 01:54:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 228 states have (on average 1.3289473684210527) internal successors, (303), 228 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 307 transitions. [2022-02-15 01:54:05,099 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 307 transitions. Word has length 44 [2022-02-15 01:54:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:54:05,099 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 307 transitions. [2022-02-15 01:54:05,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-02-15 01:54:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 307 transitions. [2022-02-15 01:54:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-15 01:54:05,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:54:05,100 INFO L514 BasicCegarLoop]: trace histogram [13, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:54:05,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-02-15 01:54:05,100 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:54:05,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:54:05,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1336668930, now seen corresponding path program 26 times [2022-02-15 01:54:05,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:54:05,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1663392800] [2022-02-15 01:54:05,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:54:05,145 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:54:05,145 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:54:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:54:05,149 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_50.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:05,175 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_50.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:05,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:54:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:54:06,029 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:54:06,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1663392800] [2022-02-15 01:54:06,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1663392800] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:54:06,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:54:06,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-02-15 01:54:06,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938161329] [2022-02-15 01:54:06,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:54:06,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-15 01:54:06,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:54:06,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-15 01:54:06,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2022-02-15 01:54:06,031 INFO L87 Difference]: Start difference. First operand 233 states and 307 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 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-02-15 01:54:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:54:10,026 INFO L93 Difference]: Finished difference Result 550 states and 821 transitions. [2022-02-15 01:54:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-15 01:54:10,027 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 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 44 [2022-02-15 01:54:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:54:10,029 INFO L225 Difference]: With dead ends: 550 [2022-02-15 01:54:10,029 INFO L226 Difference]: Without dead ends: 527 [2022-02-15 01:54:10,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=531, Invalid=2019, Unknown=0, NotChecked=0, Total=2550 [2022-02-15 01:54:10,029 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 215 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-15 01:54:10,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 115 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-15 01:54:10,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-02-15 01:54:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 250. [2022-02-15 01:54:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.3346938775510204) internal successors, (327), 245 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 331 transitions. [2022-02-15 01:54:10,383 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 331 transitions. Word has length 44 [2022-02-15 01:54:10,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:54:10,383 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 331 transitions. [2022-02-15 01:54:10,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 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-02-15 01:54:10,383 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 331 transitions. [2022-02-15 01:54:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-15 01:54:10,384 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:54:10,384 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:54:10,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-02-15 01:54:10,384 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:54:10,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:54:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash 986362945, now seen corresponding path program 27 times [2022-02-15 01:54:10,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:54:10,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059043864] [2022-02-15 01:54:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:54:10,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:54:10,416 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:54:10,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:54:10,420 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_51.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:10,457 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_51.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:10,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:54:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:54:11,242 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:54:11,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059043864] [2022-02-15 01:54:11,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2059043864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:54:11,243 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:54:11,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-15 01:54:11,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277506139] [2022-02-15 01:54:11,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:54:11,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-15 01:54:11,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:54:11,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-15 01:54:11,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2022-02-15 01:54:11,244 INFO L87 Difference]: Start difference. First operand 250 states and 331 transitions. Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 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-02-15 01:54:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:54:21,487 INFO L93 Difference]: Finished difference Result 1045 states and 1295 transitions. [2022-02-15 01:54:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-02-15 01:54:21,487 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 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 45 [2022-02-15 01:54:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:54:21,489 INFO L225 Difference]: With dead ends: 1045 [2022-02-15 01:54:21,489 INFO L226 Difference]: Without dead ends: 823 [2022-02-15 01:54:21,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3139 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=982, Invalid=9320, Unknown=0, NotChecked=0, Total=10302 [2022-02-15 01:54:21,490 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 101 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-02-15 01:54:21,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 147 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-02-15 01:54:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-02-15 01:54:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 257. [2022-02-15 01:54:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.3095238095238095) internal successors, (330), 252 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 334 transitions. [2022-02-15 01:54:21,845 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 334 transitions. Word has length 45 [2022-02-15 01:54:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:54:21,845 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 334 transitions. [2022-02-15 01:54:21,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 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-02-15 01:54:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 334 transitions. [2022-02-15 01:54:21,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-15 01:54:21,846 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:54:21,846 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:54:21,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-02-15 01:54:21,846 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:54:21,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:54:21,846 INFO L85 PathProgramCache]: Analyzing trace with hash 284721058, now seen corresponding path program 28 times [2022-02-15 01:54:21,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:54:21,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1224152634] [2022-02-15 01:54:21,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:54:21,875 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:54:21,876 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:54:21,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:54:21,879 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_52.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:21,941 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_52.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:54:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:55:06,332 WARN L228 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:55:38,641 WARN L228 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:55:38,642 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:55:38,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1224152634] [2022-02-15 01:55:38,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1224152634] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:55:38,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:55:38,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 01:55:38,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335705926] [2022-02-15 01:55:38,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:55:38,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 01:55:38,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:55:38,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 01:55:38,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=818, Unknown=15, NotChecked=0, Total=930 [2022-02-15 01:55:38,643 INFO L87 Difference]: Start difference. First operand 257 states and 334 transitions. Second operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 27 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-02-15 01:55:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:55:42,618 INFO L93 Difference]: Finished difference Result 276 states and 352 transitions. [2022-02-15 01:55:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-15 01:55:42,619 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 27 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 46 [2022-02-15 01:55:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:55:42,619 INFO L225 Difference]: With dead ends: 276 [2022-02-15 01:55:42,619 INFO L226 Difference]: Without dead ends: 242 [2022-02-15 01:55:42,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 79.3s TimeCoverageRelationStatistics Valid=197, Invalid=2338, Unknown=15, NotChecked=0, Total=2550 [2022-02-15 01:55:42,620 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 01:55:42,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 118 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 536 Invalid, 0 Unknown, 71 Unchecked, 0.5s Time] [2022-02-15 01:55:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-02-15 01:55:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-02-15 01:55:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.3206751054852321) internal successors, (313), 237 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:55:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 317 transitions. [2022-02-15 01:55:42,960 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 317 transitions. Word has length 46 [2022-02-15 01:55:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:55:42,960 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 317 transitions. [2022-02-15 01:55:42,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 27 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-02-15 01:55:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 317 transitions. [2022-02-15 01:55:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-15 01:55:42,961 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:55:42,961 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:55:42,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-02-15 01:55:42,961 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:55:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:55:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2044791261, now seen corresponding path program 29 times [2022-02-15 01:55:42,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:55:42,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [166386804] [2022-02-15 01:55:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:55:42,988 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:55:42,988 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:55:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:55:42,992 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_53.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:55:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:55:43,014 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_53.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:55:43,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:55:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:55:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:55:44,177 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:55:44,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [166386804] [2022-02-15 01:55:44,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [166386804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:55:44,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:55:44,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-02-15 01:55:44,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475447816] [2022-02-15 01:55:44,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:55:44,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-15 01:55:44,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:55:44,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-15 01:55:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-02-15 01:55:44,179 INFO L87 Difference]: Start difference. First operand 242 states and 317 transitions. Second operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 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-02-15 01:55:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:55:50,082 INFO L93 Difference]: Finished difference Result 594 states and 895 transitions. [2022-02-15 01:55:50,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-15 01:55:50,083 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 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 46 [2022-02-15 01:55:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:55:50,084 INFO L225 Difference]: With dead ends: 594 [2022-02-15 01:55:50,084 INFO L226 Difference]: Without dead ends: 571 [2022-02-15 01:55:50,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=651, Invalid=2429, Unknown=0, NotChecked=0, Total=3080 [2022-02-15 01:55:50,085 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 329 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:55:50,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 92 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 01:55:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-02-15 01:55:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 260. [2022-02-15 01:55:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 255 states have (on average 1.3294117647058823) internal successors, (339), 255 states have internal predecessors, (339), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:55:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 343 transitions. [2022-02-15 01:55:50,492 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 343 transitions. Word has length 46 [2022-02-15 01:55:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:55:50,493 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 343 transitions. [2022-02-15 01:55:50,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 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-02-15 01:55:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 343 transitions. [2022-02-15 01:55:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-15 01:55:50,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:55:50,494 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:55:50,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-02-15 01:55:50,494 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:55:50,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:55:50,494 INFO L85 PathProgramCache]: Analyzing trace with hash -15117393, now seen corresponding path program 30 times [2022-02-15 01:55:50,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:55:50,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227479642] [2022-02-15 01:55:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:55:50,531 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:55:50,531 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:55:50,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:55:50,540 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_54.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:55:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:55:50,571 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_54.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:55:50,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:55:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:55:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:55:51,307 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:55:51,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227479642] [2022-02-15 01:55:51,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1227479642] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:55:51,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:55:51,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-15 01:55:51,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972442415] [2022-02-15 01:55:51,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:55:51,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-15 01:55:51,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:55:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-15 01:55:51,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-02-15 01:55:51,309 INFO L87 Difference]: Start difference. First operand 260 states and 343 transitions. Second operand has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 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-02-15 01:55:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:55:54,791 INFO L93 Difference]: Finished difference Result 546 states and 666 transitions. [2022-02-15 01:55:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 01:55:54,791 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 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 47 [2022-02-15 01:55:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:55:54,792 INFO L225 Difference]: With dead ends: 546 [2022-02-15 01:55:54,792 INFO L226 Difference]: Without dead ends: 519 [2022-02-15 01:55:54,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2022-02-15 01:55:54,793 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:55:54,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 54 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-15 01:55:54,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-02-15 01:55:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 243. [2022-02-15 01:55:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.3109243697478992) internal successors, (312), 238 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:55:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 316 transitions. [2022-02-15 01:55:55,209 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 316 transitions. Word has length 47 [2022-02-15 01:55:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:55:55,210 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 316 transitions. [2022-02-15 01:55:55,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 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-02-15 01:55:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 316 transitions. [2022-02-15 01:55:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-15 01:55:55,211 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:55:55,211 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:55:55,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-02-15 01:55:55,211 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:55:55,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:55:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1502985036, now seen corresponding path program 31 times [2022-02-15 01:55:55,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:55:55,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1459780313] [2022-02-15 01:55:55,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:55:55,254 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:55:55,254 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:55:55,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:55:55,258 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_55.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:55:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:55:55,297 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_55.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:55:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:55:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:55:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:56:51,082 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:56:51,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1459780313] [2022-02-15 01:56:51,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1459780313] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:56:51,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:56:51,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-02-15 01:56:51,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104240136] [2022-02-15 01:56:51,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:56:51,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-02-15 01:56:51,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:56:51,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-02-15 01:56:51,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=814, Unknown=3, NotChecked=0, Total=992 [2022-02-15 01:56:51,083 INFO L87 Difference]: Start difference. First operand 243 states and 316 transitions. Second operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 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-02-15 01:56:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:56:52,077 INFO L93 Difference]: Finished difference Result 266 states and 353 transitions. [2022-02-15 01:56:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-15 01:56:52,078 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 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 48 [2022-02-15 01:56:52,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:56:52,079 INFO L225 Difference]: With dead ends: 266 [2022-02-15 01:56:52,079 INFO L226 Difference]: Without dead ends: 261 [2022-02-15 01:56:52,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 55.9s TimeCoverageRelationStatistics Valid=379, Invalid=2068, Unknown=3, NotChecked=0, Total=2450 [2022-02-15 01:56:52,079 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:56:52,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 281 Invalid, 0 Unknown, 50 Unchecked, 0.3s Time] [2022-02-15 01:56:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-02-15 01:56:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 247. [2022-02-15 01:56:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.2975206611570247) internal successors, (314), 242 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 318 transitions. [2022-02-15 01:56:52,472 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 318 transitions. Word has length 48 [2022-02-15 01:56:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:56:52,475 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 318 transitions. [2022-02-15 01:56:52,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 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-02-15 01:56:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 318 transitions. [2022-02-15 01:56:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-15 01:56:52,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:56:52,476 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:56:52,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-02-15 01:56:52,476 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:56:52,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:56:52,476 INFO L85 PathProgramCache]: Analyzing trace with hash 755437972, now seen corresponding path program 16 times [2022-02-15 01:56:52,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:56:52,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1579898909] [2022-02-15 01:56:52,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:56:52,520 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:56:52,520 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:56:52,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:56:52,524 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_56.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:56:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:56:52,562 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_56.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:56:52,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:56:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:56:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:56:53,436 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:56:53,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1579898909] [2022-02-15 01:56:53,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1579898909] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:56:53,436 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:56:53,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 01:56:53,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320174875] [2022-02-15 01:56:53,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:56:53,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 01:56:53,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:56:53,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 01:56:53,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-02-15 01:56:53,437 INFO L87 Difference]: Start difference. First operand 247 states and 318 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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-02-15 01:57:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:57:06,056 INFO L93 Difference]: Finished difference Result 611 states and 742 transitions. [2022-02-15 01:57:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-02-15 01:57:06,056 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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 48 [2022-02-15 01:57:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:57:06,058 INFO L225 Difference]: With dead ends: 611 [2022-02-15 01:57:06,058 INFO L226 Difference]: Without dead ends: 605 [2022-02-15 01:57:06,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2507 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1032, Invalid=7710, Unknown=0, NotChecked=0, Total=8742 [2022-02-15 01:57:06,059 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 96 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:57:06,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 94 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-02-15 01:57:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-02-15 01:57:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 270. [2022-02-15 01:57:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.3169811320754716) internal successors, (349), 265 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:57:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 353 transitions. [2022-02-15 01:57:06,477 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 353 transitions. Word has length 48 [2022-02-15 01:57:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:57:06,477 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 353 transitions. [2022-02-15 01:57:06,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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-02-15 01:57:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 353 transitions. [2022-02-15 01:57:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-15 01:57:06,478 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:57:06,478 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:57:06,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-02-15 01:57:06,478 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:57:06,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:57:06,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1247890577, now seen corresponding path program 32 times [2022-02-15 01:57:06,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:57:06,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1058981404] [2022-02-15 01:57:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:57:06,528 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:57:06,528 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:57:06,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:57:06,533 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_57.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:57:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:57:06,574 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_57.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:57:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:57:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:57:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:57:07,328 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:57:07,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1058981404] [2022-02-15 01:57:07,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1058981404] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:57:07,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:57:07,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-02-15 01:57:07,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264075405] [2022-02-15 01:57:07,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:57:07,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-15 01:57:07,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:57:07,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-15 01:57:07,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-02-15 01:57:07,329 INFO L87 Difference]: Start difference. First operand 270 states and 353 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 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-02-15 01:57:10,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:57:10,917 INFO L93 Difference]: Finished difference Result 558 states and 678 transitions. [2022-02-15 01:57:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-15 01:57:10,918 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 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 49 [2022-02-15 01:57:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:57:10,919 INFO L225 Difference]: With dead ends: 558 [2022-02-15 01:57:10,919 INFO L226 Difference]: Without dead ends: 530 [2022-02-15 01:57:10,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=386, Invalid=1870, Unknown=0, NotChecked=0, Total=2256 [2022-02-15 01:57:10,920 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 45 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:57:10,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 49 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-15 01:57:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-02-15 01:57:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 253. [2022-02-15 01:57:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 248 states have (on average 1.2983870967741935) internal successors, (322), 248 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:57:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 326 transitions. [2022-02-15 01:57:11,306 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 326 transitions. Word has length 49 [2022-02-15 01:57:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:57:11,306 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 326 transitions. [2022-02-15 01:57:11,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 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-02-15 01:57:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 326 transitions. [2022-02-15 01:57:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-15 01:57:11,307 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:57:11,307 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:57:11,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-02-15 01:57:11,307 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:57:11,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:57:11,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1978235759, now seen corresponding path program 33 times [2022-02-15 01:57:11,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:57:11,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1474126973] [2022-02-15 01:57:11,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:57:11,356 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:57:11,356 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:57:11,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:57:11,360 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_58.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:57:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:57:11,402 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_58.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:57:11,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:57:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:57:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:57:12,193 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:57:12,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1474126973] [2022-02-15 01:57:12,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1474126973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:57:12,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:57:12,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-15 01:57:12,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812237529] [2022-02-15 01:57:12,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:57:12,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-15 01:57:12,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:57:12,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-15 01:57:12,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-02-15 01:57:12,194 INFO L87 Difference]: Start difference. First operand 253 states and 326 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 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-02-15 01:57:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:57:23,870 INFO L93 Difference]: Finished difference Result 625 states and 764 transitions. [2022-02-15 01:57:23,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-02-15 01:57:23,871 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 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 49 [2022-02-15 01:57:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:57:23,872 INFO L225 Difference]: With dead ends: 625 [2022-02-15 01:57:23,872 INFO L226 Difference]: Without dead ends: 619 [2022-02-15 01:57:23,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2769 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1145, Invalid=8361, Unknown=0, NotChecked=0, Total=9506 [2022-02-15 01:57:23,874 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 117 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:57:23,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 86 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-02-15 01:57:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-02-15 01:57:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 280. [2022-02-15 01:57:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 1.3054545454545454) internal successors, (359), 275 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:57:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 363 transitions. [2022-02-15 01:57:24,326 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 363 transitions. Word has length 49 [2022-02-15 01:57:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:57:24,327 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 363 transitions. [2022-02-15 01:57:24,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 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-02-15 01:57:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 363 transitions. [2022-02-15 01:57:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-15 01:57:24,327 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:57:24,327 INFO L514 BasicCegarLoop]: trace histogram [10, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:57:24,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-02-15 01:57:24,328 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:57:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:57:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1773069292, now seen corresponding path program 34 times [2022-02-15 01:57:24,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:57:24,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1708591833] [2022-02-15 01:57:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:57:24,364 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:57:24,365 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:57:24,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:57:24,369 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_59.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:57:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:57:24,413 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_59.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:57:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:57:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:57:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:57:25,445 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:57:25,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1708591833] [2022-02-15 01:57:25,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1708591833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:57:25,445 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:57:25,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 01:57:25,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394748880] [2022-02-15 01:57:25,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:57:25,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 01:57:25,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:57:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 01:57:25,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-02-15 01:57:25,446 INFO L87 Difference]: Start difference. First operand 280 states and 363 transitions. Second operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 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-02-15 01:57:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:57:46,553 INFO L93 Difference]: Finished difference Result 1250 states and 1525 transitions. [2022-02-15 01:57:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-02-15 01:57:46,554 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 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 50 [2022-02-15 01:57:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:57:46,556 INFO L225 Difference]: With dead ends: 1250 [2022-02-15 01:57:46,556 INFO L226 Difference]: Without dead ends: 1001 [2022-02-15 01:57:46,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4902 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1353, Invalid=13899, Unknown=0, NotChecked=0, Total=15252 [2022-02-15 01:57:46,557 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 128 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:57:46,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 147 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-02-15 01:57:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-02-15 01:57:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 287. [2022-02-15 01:57:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.2801418439716312) internal successors, (361), 282 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:57:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 365 transitions. [2022-02-15 01:57:47,005 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 365 transitions. Word has length 50 [2022-02-15 01:57:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:57:47,006 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 365 transitions. [2022-02-15 01:57:47,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 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-02-15 01:57:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 365 transitions. [2022-02-15 01:57:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-15 01:57:47,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:57:47,007 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:57:47,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-02-15 01:57:47,007 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:57:47,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:57:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1540323473, now seen corresponding path program 35 times [2022-02-15 01:57:47,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:57:47,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538358676] [2022-02-15 01:57:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:57:47,057 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:57:47,057 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:57:47,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:57:47,061 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_60.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:57:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:57:47,111 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_60.6))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:57:48,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:57:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:57:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:58:24,957 WARN L228 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:58:56,117 WARN L228 SmtUtils]: Spent 7.84s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:58:58,136 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 6 c_main_~x~0))) (and (or (and (= (+ c_main_~x~0 c_main_~y~0) c_main_~n~0) (< 6 c_main_~y~0) (< 0 (mod c_main_~n~0 4294967296)) (forall ((v_it_60 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_60) c_main_~n~0) 4294967296)) (not (<= (+ 7 v_it_60) c_main_~y~0)) (not (<= 1 v_it_60))))) (and (= (+ (- 6) c_main_~y~0) 0) (= .cse0 c_main_~n~0))) (< 0 (mod (+ c_main_~x~0 1) 4294967296)) (< 0 (mod (+ 3 c_main_~x~0) 4294967296)) (< 0 (mod (+ 5 c_main_~x~0) 4294967296)) (< 0 (mod .cse0 4294967296)) (< 0 (mod (+ 4 c_main_~x~0) 4294967296)) (< 0 (mod (+ 2 c_main_~x~0) 4294967296)))) is different from false [2022-02-15 01:59:44,421 WARN L228 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:59:44,422 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:59:44,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1538358676] [2022-02-15 01:59:44,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1538358676] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:59:44,422 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:59:44,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-02-15 01:59:44,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603436167] [2022-02-15 01:59:44,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:59:44,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-15 01:59:44,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:59:44,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-15 01:59:44,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=940, Unknown=19, NotChecked=62, Total=1122 [2022-02-15 01:59:44,423 INFO L87 Difference]: Start difference. First operand 287 states and 365 transitions. Second operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 30 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-02-15 02:00:33,425 WARN L228 SmtUtils]: Spent 25.96s on a formula simplification. DAG size of input: 69 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 02:00:35,439 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (+ c_main_~x~0 c_main_~y~0) c_main_~n~0)) (.cse1 (< 0 (mod c_main_~n~0 4294967296))) (.cse2 (+ 6 c_main_~x~0)) (.cse3 (+ 7 c_main_~x~0))) (and (or (and .cse0 (< 6 c_main_~y~0) .cse1 (forall ((v_it_60 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_60) c_main_~n~0) 4294967296)) (not (<= (+ 7 v_it_60) c_main_~y~0)) (not (<= 1 v_it_60))))) (and (= (+ (- 6) c_main_~y~0) 0) (= .cse2 c_main_~n~0))) (< 0 (mod (+ c_main_~x~0 1) 4294967296)) (< 0 (mod (+ 3 c_main_~x~0) 4294967296)) (< 0 (mod (+ 5 c_main_~x~0) 4294967296)) (or (and (forall ((v_it_60 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_60) c_main_~n~0) 4294967296)) (not (<= (+ v_it_60 8) c_main_~y~0)) (not (<= 1 v_it_60)))) (< 7 c_main_~y~0) .cse0 .cse1) (and (= c_main_~n~0 .cse3) (= (+ (- 7) c_main_~y~0) 0))) (< 0 (mod .cse2 4294967296)) (< 0 (mod (+ 4 c_main_~x~0) 4294967296)) (< 0 (mod (+ 2 c_main_~x~0) 4294967296)) (< 0 (mod .cse3 4294967296)))) is different from false [2022-02-15 02:00:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:00:40,108 INFO L93 Difference]: Finished difference Result 654 states and 784 transitions. [2022-02-15 02:00:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-15 02:00:40,109 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 30 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 51 [2022-02-15 02:00:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:00:40,111 INFO L225 Difference]: With dead ends: 654 [2022-02-15 02:00:40,111 INFO L226 Difference]: Without dead ends: 599 [2022-02-15 02:00:40,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 169.1s TimeCoverageRelationStatistics Valid=224, Invalid=2835, Unknown=29, NotChecked=218, Total=3306 [2022-02-15 02:00:40,112 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-15 02:00:40,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 151 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1036 Invalid, 0 Unknown, 133 Unchecked, 2.0s Time] [2022-02-15 02:00:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-02-15 02:00:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 291. [2022-02-15 02:00:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 286 states have (on average 1.2342657342657342) internal successors, (353), 286 states have internal predecessors, (353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:00:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 357 transitions. [2022-02-15 02:00:40,686 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 357 transitions. Word has length 51 [2022-02-15 02:00:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:00:40,686 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 357 transitions. [2022-02-15 02:00:40,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 30 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-02-15 02:00:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 357 transitions. [2022-02-15 02:00:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-15 02:00:40,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:00:40,687 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:00:40,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-02-15 02:00:40,687 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:00:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:00:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2100347007, now seen corresponding path program 36 times [2022-02-15 02:00:40,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:00:40,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1329951778] [2022-02-15 02:00:40,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:00:40,735 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 02:00:40,735 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 02:00:40,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:00:40,740 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_61.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:00:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:00:40,806 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_61.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:00:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:00:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:00:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:00:42,761 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:00:42,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1329951778] [2022-02-15 02:00:42,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1329951778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:00:42,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:00:42,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-02-15 02:00:42,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902942406] [2022-02-15 02:00:42,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:00:42,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-15 02:00:42,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:00:42,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-15 02:00:42,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-02-15 02:00:42,763 INFO L87 Difference]: Start difference. First operand 291 states and 357 transitions. Second operand has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 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-02-15 02:01:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:01:01,411 INFO L93 Difference]: Finished difference Result 926 states and 1083 transitions. [2022-02-15 02:01:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-15 02:01:01,412 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 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 53 [2022-02-15 02:01:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:01:01,413 INFO L225 Difference]: With dead ends: 926 [2022-02-15 02:01:01,413 INFO L226 Difference]: Without dead ends: 669 [2022-02-15 02:01:01,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2369 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=887, Invalid=8233, Unknown=0, NotChecked=0, Total=9120 [2022-02-15 02:01:01,415 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 73 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-02-15 02:01:01,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 140 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-02-15 02:01:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-02-15 02:01:02,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 300. [2022-02-15 02:01:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.2101694915254237) internal successors, (357), 295 states have internal predecessors, (357), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:01:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 361 transitions. [2022-02-15 02:01:02,023 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 361 transitions. Word has length 53 [2022-02-15 02:01:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:01:02,023 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 361 transitions. [2022-02-15 02:01:02,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 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-02-15 02:01:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 361 transitions. [2022-02-15 02:01:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-15 02:01:02,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:01:02,024 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:01:02,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-02-15 02:01:02,025 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:01:02,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:01:02,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1945484158, now seen corresponding path program 37 times [2022-02-15 02:01:02,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:01:02,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [137184770] [2022-02-15 02:01:02,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:01:02,066 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 02:01:02,067 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 02:01:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:01:02,072 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_62.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:01:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:01:02,148 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_62.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:01:02,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:01:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:01:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:01:17,705 WARN L228 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 02:01:52,843 WARN L228 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 02:02:25,862 WARN L228 SmtUtils]: Spent 11.81s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 02:02:55,284 WARN L228 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 02:02:55,286 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:02:55,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [137184770] [2022-02-15 02:02:55,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [137184770] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:02:55,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:02:55,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-02-15 02:02:55,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3937382] [2022-02-15 02:02:55,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:02:55,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-15 02:02:55,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:02:55,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-15 02:02:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=968, Unknown=10, NotChecked=0, Total=1122 [2022-02-15 02:02:55,287 INFO L87 Difference]: Start difference. First operand 300 states and 361 transitions. Second operand has 33 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 31 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-02-15 02:02:58,593 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_main_~x~0))) (and (or (and (= (+ (- 4) c_main_~y~0) 0) (= c_main_~n~0 .cse0)) (and (= (+ c_main_~x~0 c_main_~y~0) c_main_~n~0) (< 0 (mod c_main_~n~0 4294967296)) (forall ((v_it_62 Int)) (or (not (<= 1 v_it_62)) (< 0 (mod (+ (* 4294967295 v_it_62) c_main_~n~0) 4294967296)) (not (<= (+ 5 v_it_62 c_main_~x~0) c_main_~n~0)))) (< .cse0 c_main_~n~0))) (= |c_#NULL.base| |c_old(#NULL.base)|) (< 0 (mod (+ c_main_~x~0 1) 4294967296)) (< 0 (mod (+ 3 c_main_~x~0) 4294967296)) (< 0 (mod .cse0 4294967296)) (<= (+ (* (div (+ (* (- 1) c_main_~x~0) 4294967291 c_main_~n~0) 4294967296) 4294967296) 4 c_main_~x~0) c_main_~n~0) (< 0 (mod (+ 2 c_main_~x~0) 4294967296)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-02-15 02:03:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:03:01,415 INFO L93 Difference]: Finished difference Result 608 states and 686 transitions. [2022-02-15 02:03:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-15 02:03:01,416 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 31 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 56 [2022-02-15 02:03:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:03:01,417 INFO L225 Difference]: With dead ends: 608 [2022-02-15 02:03:01,417 INFO L226 Difference]: Without dead ends: 566 [2022-02-15 02:03:01,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 116.4s TimeCoverageRelationStatistics Valid=331, Invalid=2968, Unknown=11, NotChecked=112, Total=3422 [2022-02-15 02:03:01,418 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 02:03:01,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 725 Invalid, 0 Unknown, 122 Unchecked, 0.8s Time] [2022-02-15 02:03:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-02-15 02:03:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 287. [2022-02-15 02:03:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.2269503546099292) internal successors, (346), 282 states have internal predecessors, (346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:03:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2022-02-15 02:03:02,029 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 56 [2022-02-15 02:03:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:03:02,029 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2022-02-15 02:03:02,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 31 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-02-15 02:03:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2022-02-15 02:03:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-15 02:03:02,030 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:03:02,030 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:03:02,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-02-15 02:03:02,030 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:03:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:03:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1971532620, now seen corresponding path program 38 times [2022-02-15 02:03:02,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:03:02,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396566663] [2022-02-15 02:03:02,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:03:02,072 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 02:03:02,072 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 02:03:02,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:03:02,076 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_63.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:03:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:03:02,125 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_63.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:03:02,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:03:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:03:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:03:03,893 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:03:03,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396566663] [2022-02-15 02:03:03,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [396566663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:03:03,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:03:03,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-02-15 02:03:03,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558508173] [2022-02-15 02:03:03,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:03:03,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-15 02:03:03,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:03:03,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-15 02:03:03,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2022-02-15 02:03:03,894 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 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-02-15 02:04:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:04:17,085 INFO L93 Difference]: Finished difference Result 1406 states and 1737 transitions. [2022-02-15 02:04:17,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2022-02-15 02:04:17,086 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 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 56 [2022-02-15 02:04:17,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:04:17,089 INFO L225 Difference]: With dead ends: 1406 [2022-02-15 02:04:17,089 INFO L226 Difference]: Without dead ends: 1400 [2022-02-15 02:04:17,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32740 ImplicationChecksByTransitivity, 44.1s TimeCoverageRelationStatistics Valid=12075, Invalid=63825, Unknown=0, NotChecked=0, Total=75900 [2022-02-15 02:04:17,094 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 445 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 827 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 827 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.4s IncrementalHoareTripleChecker+Time [2022-02-15 02:04:17,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 77 Invalid, 2394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [827 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 26.4s Time] [2022-02-15 02:04:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2022-02-15 02:04:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 371. [2022-02-15 02:04:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 366 states have (on average 1.3415300546448088) internal successors, (491), 366 states have internal predecessors, (491), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:04:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 495 transitions. [2022-02-15 02:04:17,846 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 495 transitions. Word has length 56 [2022-02-15 02:04:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:04:17,846 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 495 transitions. [2022-02-15 02:04:17,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 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-02-15 02:04:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 495 transitions. [2022-02-15 02:04:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-15 02:04:17,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:04:17,847 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:04:17,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-02-15 02:04:17,847 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:04:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:04:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1705835599, now seen corresponding path program 39 times [2022-02-15 02:04:17,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:04:17,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [594673782] [2022-02-15 02:04:17,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:04:17,901 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 02:04:17,901 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 02:04:17,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:04:17,905 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_64.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:04:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:04:17,960 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_64.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:04:18,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:04:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:04:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:04:20,190 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:04:20,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [594673782] [2022-02-15 02:04:20,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [594673782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:04:20,190 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:04:20,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 02:04:20,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151098920] [2022-02-15 02:04:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:04:20,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 02:04:20,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:04:20,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 02:04:20,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-02-15 02:04:20,191 INFO L87 Difference]: Start difference. First operand 371 states and 495 transitions. Second operand has 29 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 28 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)