/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-d966a43 [2022-01-31 21:14:10,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:14:10,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:14:10,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:14:10,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:14:10,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:14:10,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:14:10,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:14:10,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:14:10,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:14:10,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:14:10,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:14:10,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:14:10,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:14:10,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:14:10,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:14:10,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:14:10,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:14:10,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:14:10,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:14:10,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:14:10,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:14:10,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:14:10,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:14:10,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:14:10,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:14:10,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:14:10,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:14:10,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:14:10,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:14:10,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:14:10,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:14:10,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:14:10,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:14:10,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:14:10,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:14:10,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:14:10,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:14:10,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:14:10,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:14:10,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:14:10,164 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 21:14:10,171 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:14:10,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:14:10,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:14:10,172 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:14:10,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:14:10,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:14:10,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:14:10,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:14:10,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:14:10,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:14:10,173 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:14:10,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:14:10,173 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:14:10,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:14:10,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:14:10,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:14:10,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:14:10,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:14:10,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:14:10,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:14:10,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:14:10,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:14:10,174 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:14:10,174 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 21:14:10,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:14:10,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:14:10,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:14:10,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:14:10,348 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:14:10,349 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-01-31 21:14:10,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6617ab972/48d2be38c5dd458b854c56075ea5d75f/FLAG4fa86f86d [2022-01-31 21:14:10,726 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:14:10,726 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-01-31 21:14:10,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6617ab972/48d2be38c5dd458b854c56075ea5d75f/FLAG4fa86f86d [2022-01-31 21:14:11,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6617ab972/48d2be38c5dd458b854c56075ea5d75f [2022-01-31 21:14:11,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:14:11,174 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:14:11,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:14:11,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:14:11,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:14:11,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:14:11" (1/1) ... [2022-01-31 21:14:11,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582a79c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:11, skipping insertion in model container [2022-01-31 21:14:11,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:14:11" (1/1) ... [2022-01-31 21:14:11,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:14:11,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:14:11,274 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-01-31 21:14:11,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:14:11,306 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:14:11,312 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-01-31 21:14:11,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:14:11,322 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:14:11,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:11 WrapperNode [2022-01-31 21:14:11,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:14:11,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:14:11,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:14:11,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:14:11,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:11" (1/1) ... [2022-01-31 21:14:11,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:11" (1/1) ... [2022-01-31 21:14:11,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:11" (1/1) ... [2022-01-31 21:14:11,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:11" (1/1) ... [2022-01-31 21:14:11,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:11" (1/1) ... [2022-01-31 21:14:11,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:11" (1/1) ... [2022-01-31 21:14:11,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:11" (1/1) ... [2022-01-31 21:14:11,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:14:11,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:14:11,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:14:11,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:14:11,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:11" (1/1) ... [2022-01-31 21:14:11,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:14:11,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:14:11,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 21:14:11,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 21:14:11,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:14:11,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:14:11,392 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:14:11,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 21:14:11,393 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:14:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:14:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:14:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:14:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:14:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 21:14:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 21:14:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:14:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:14:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:14:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:14:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:14:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:14:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:14:11,444 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:14:11,445 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:14:11,527 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:14:11,531 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:14:11,531 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-31 21:14:11,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:14:11 BoogieIcfgContainer [2022-01-31 21:14:11,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:14:11,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:14:11,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:14:11,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:14:11,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:14:11" (1/3) ... [2022-01-31 21:14:11,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202a294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:14:11, skipping insertion in model container [2022-01-31 21:14:11,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:11" (2/3) ... [2022-01-31 21:14:11,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202a294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:14:11, skipping insertion in model container [2022-01-31 21:14:11,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:14:11" (3/3) ... [2022-01-31 21:14:11,550 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.c [2022-01-31 21:14:11,553 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:14:11,553 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:14:11,600 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:14:11,604 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-01-31 21:14:11,605 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:14:11,613 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-01-31 21:14:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 21:14:11,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:11,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:11,619 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:11,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-01-31 21:14:11,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:11,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [841788202] [2022-01-31 21:14:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:11,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:11,665 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:14:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:11,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:11,789 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:11,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [841788202] [2022-01-31 21:14:11,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [841788202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:11,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:11,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 21:14:11,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768255962] [2022-01-31 21:14:11,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:11,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 21:14:11,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:11,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 21:14:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 21:14:11,819 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-01-31 21:14:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:11,864 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-01-31 21:14:11,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 21:14:11,866 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-01-31 21:14:11,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:11,875 INFO L225 Difference]: With dead ends: 41 [2022-01-31 21:14:11,875 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 21:14:11,877 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-01-31 21:14:11,881 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-01-31 21:14:11,883 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-01-31 21:14:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 21:14:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-31 21:14:11,911 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-01-31 21:14:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-01-31 21:14:11,914 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-01-31 21:14:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:11,915 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-01-31 21:14:11,915 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-01-31 21:14:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-01-31 21:14:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 21:14:11,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:11,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:11,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:14:11,917 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:11,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-01-31 21:14:11,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:11,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1496077067] [2022-01-31 21:14:11,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:11,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:11,926 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:14:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:12,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:12,091 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:12,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1496077067] [2022-01-31 21:14:12,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1496077067] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:12,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:12,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:12,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866143998] [2022-01-31 21:14:12,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:12,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:12,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:12,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:12,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:12,094 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-01-31 21:14:12,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:12,172 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-01-31 21:14:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:14:12,172 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-01-31 21:14:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:12,173 INFO L225 Difference]: With dead ends: 28 [2022-01-31 21:14:12,173 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 21:14:12,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:14:12,174 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-01-31 21:14:12,175 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-01-31 21:14:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 21:14:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-31 21:14:12,179 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-01-31 21:14:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-01-31 21:14:12,179 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-01-31 21:14:12,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:12,180 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-01-31 21:14:12,180 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-01-31 21:14:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-01-31 21:14:12,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:14:12,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:12,180 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:12,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:14:12,181 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:12,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:12,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-01-31 21:14:12,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:12,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1522818620] [2022-01-31 21:14:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:12,294 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:12,296 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:12,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:12,309 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-01-31 21:14:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:12,335 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-01-31 21:14:12,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:12,454 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:12,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1522818620] [2022-01-31 21:14:12,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1522818620] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:12,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:12,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:14:12,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139816185] [2022-01-31 21:14:12,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:12,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:14:12,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:12,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:14:12,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:14:12,456 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-01-31 21:14:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:12,528 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-01-31 21:14:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:14:12,528 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-01-31 21:14:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:12,529 INFO L225 Difference]: With dead ends: 32 [2022-01-31 21:14:12,530 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 21:14:12,530 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-01-31 21:14:12,531 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:12,531 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.0s Time] [2022-01-31 21:14:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 21:14:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 21:14:12,536 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-01-31 21:14:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-01-31 21:14:12,536 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 17 [2022-01-31 21:14:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:12,537 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-01-31 21:14:12,537 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-01-31 21:14:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-01-31 21:14:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:14:12,537 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:12,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:12,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:14:12,538 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:12,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-01-31 21:14:12,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:12,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1845090459] [2022-01-31 21:14:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:12,577 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:12,578 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:12,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:12,584 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-01-31 21:14:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:12,601 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-01-31 21:14:12,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:12,766 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:12,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1845090459] [2022-01-31 21:14:12,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1845090459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:12,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:12,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:14:12,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984019672] [2022-01-31 21:14:12,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:12,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:14:12,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:12,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:14:12,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:14:12,772 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-01-31 21:14:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:12,857 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-01-31 21:14:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:14:12,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 21:14:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:12,859 INFO L225 Difference]: With dead ends: 32 [2022-01-31 21:14:12,859 INFO L226 Difference]: Without dead ends: 24 [2022-01-31 21:14:12,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:14:12,863 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:12,864 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.0s Time] [2022-01-31 21:14:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-31 21:14:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-31 21:14:12,867 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-01-31 21:14:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-01-31 21:14:12,868 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2022-01-31 21:14:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:12,868 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-01-31 21:14:12,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-01-31 21:14:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:14:12,869 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:12,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:12,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:14:12,869 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash -578961840, now seen corresponding path program 1 times [2022-01-31 21:14:12,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:12,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523953918] [2022-01-31 21:14:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:12,911 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:12,911 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:12,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:12,917 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-01-31 21:14:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:12,930 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-01-31 21:14:13,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:13,067 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:13,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523953918] [2022-01-31 21:14:13,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [523953918] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:13,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:13,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:14:13,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778215450] [2022-01-31 21:14:13,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:13,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:14:13,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:13,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:14:13,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:14:13,070 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-01-31 21:14:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:13,137 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-01-31 21:14:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:14:13,138 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-01-31 21:14:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:13,141 INFO L225 Difference]: With dead ends: 33 [2022-01-31 21:14:13,141 INFO L226 Difference]: Without dead ends: 18 [2022-01-31 21:14:13,144 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-01-31 21:14:13,148 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:13,148 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.0s Time] [2022-01-31 21:14:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-31 21:14:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-31 21:14:13,153 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-01-31 21:14:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-01-31 21:14:13,155 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 17 [2022-01-31 21:14:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:13,156 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-01-31 21:14:13,156 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-01-31 21:14:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-01-31 21:14:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:14:13,156 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:13,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:13,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:14:13,157 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:13,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash 388404751, now seen corresponding path program 1 times [2022-01-31 21:14:13,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:13,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1798797778] [2022-01-31 21:14:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:13,226 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:13,227 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:13,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:13,233 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:14:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:13,247 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:14:13,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:13,959 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:13,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1798797778] [2022-01-31 21:14:13,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1798797778] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:13,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:13,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:14:13,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806453336] [2022-01-31 21:14:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:13,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:14:13,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:13,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:14:13,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:14:13,961 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-01-31 21:14:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:14,495 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-01-31 21:14:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:14:14,495 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-01-31 21:14:14,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:14,495 INFO L225 Difference]: With dead ends: 28 [2022-01-31 21:14:14,495 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 21:14:14,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:14:14,496 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:14,496 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.0s Time] [2022-01-31 21:14:14,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 21:14:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-01-31 21:14:14,500 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-01-31 21:14:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-01-31 21:14:14,500 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 17 [2022-01-31 21:14:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:14,501 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-01-31 21:14:14,501 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-01-31 21:14:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-01-31 21:14:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:14:14,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:14,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:14,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:14:14,501 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:14,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash -809859500, now seen corresponding path program 1 times [2022-01-31 21:14:14,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:14,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [557873865] [2022-01-31 21:14:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:14,540 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:14,540 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:14,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:14,545 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:14,549 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-01-31 21:14:14,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:14,574 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:14,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [557873865] [2022-01-31 21:14:14,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [557873865] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:14,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:14,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:14:14,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569609072] [2022-01-31 21:14:14,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:14,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:14:14,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:14,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:14:14,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:14:14,575 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-01-31 21:14:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:14,639 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-01-31 21:14:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:14:14,639 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-01-31 21:14:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:14,640 INFO L225 Difference]: With dead ends: 36 [2022-01-31 21:14:14,640 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 21:14:14,640 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-01-31 21:14:14,641 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:14,641 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.0s Time] [2022-01-31 21:14:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 21:14:14,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-01-31 21:14:14,646 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-01-31 21:14:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-01-31 21:14:14,646 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 18 [2022-01-31 21:14:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:14,646 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-01-31 21:14:14,646 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-01-31 21:14:14,646 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-01-31 21:14:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:14:14,647 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:14,647 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:14,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:14:14,647 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:14,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:14,647 INFO L85 PathProgramCache]: Analyzing trace with hash 592968899, now seen corresponding path program 1 times [2022-01-31 21:14:14,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:14,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1946777101] [2022-01-31 21:14:14,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:14,684 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:14,685 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:14,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:14,688 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:14,692 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-01-31 21:14:14,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:14,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-01-31 21:14:14,717 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:14,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1946777101] [2022-01-31 21:14:14,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1946777101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:14,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:14,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:14:14,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133528080] [2022-01-31 21:14:14,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:14,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:14:14,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:14,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:14:14,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:14:14,719 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-01-31 21:14:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:14,778 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-01-31 21:14:14,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:14:14,778 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-01-31 21:14:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:14,780 INFO L225 Difference]: With dead ends: 44 [2022-01-31 21:14:14,780 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 21:14:14,780 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-01-31 21:14:14,780 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:14,781 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.0s Time] [2022-01-31 21:14:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 21:14:14,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2022-01-31 21:14:14,790 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-01-31 21:14:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-01-31 21:14:14,791 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 18 [2022-01-31 21:14:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:14,791 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-01-31 21:14:14,791 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-01-31 21:14:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-01-31 21:14:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:14:14,792 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:14,792 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:14,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:14:14,792 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1130976308, now seen corresponding path program 1 times [2022-01-31 21:14:14,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:14,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [815287029] [2022-01-31 21:14:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:14,869 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:14,870 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:14,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:14,873 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:14,900 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-01-31 21:14:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:14,936 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:14,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [815287029] [2022-01-31 21:14:14,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [815287029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:14,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:14,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:14,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456481517] [2022-01-31 21:14:14,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:14,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:14,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:14,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:14,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:14,938 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-01-31 21:14:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:14,996 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-01-31 21:14:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:14:14,997 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-01-31 21:14:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:14,997 INFO L225 Difference]: With dead ends: 35 [2022-01-31 21:14:14,997 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 21:14:14,998 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-01-31 21:14:14,998 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-01-31 21:14:14,998 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-01-31 21:14:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 21:14:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-01-31 21:14:15,002 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-01-31 21:14:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-01-31 21:14:15,002 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2022-01-31 21:14:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:15,002 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-01-31 21:14:15,002 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-01-31 21:14:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-01-31 21:14:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:14:15,003 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:15,003 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:15,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:14:15,003 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash 629336803, now seen corresponding path program 1 times [2022-01-31 21:14:15,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:15,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [330637403] [2022-01-31 21:14:15,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:15,038 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:15,039 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:15,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:15,043 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:14:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:15,049 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-01-31 21:14:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:15,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-01-31 21:14:15,086 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:15,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [330637403] [2022-01-31 21:14:15,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [330637403] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:15,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:15,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:15,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435324611] [2022-01-31 21:14:15,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:15,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:15,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:15,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:15,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:15,087 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-01-31 21:14:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:15,187 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-01-31 21:14:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:14:15,187 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-01-31 21:14:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:15,188 INFO L225 Difference]: With dead ends: 47 [2022-01-31 21:14:15,188 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 21:14:15,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:14:15,188 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-01-31 21:14:15,189 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-01-31 21:14:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 21:14:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-01-31 21:14:15,194 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-01-31 21:14:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-01-31 21:14:15,194 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 18 [2022-01-31 21:14:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:15,194 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-01-31 21:14:15,194 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-01-31 21:14:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-01-31 21:14:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 21:14:15,195 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:15,195 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-01-31 21:14:15,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:14:15,199 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash -528072081, now seen corresponding path program 1 times [2022-01-31 21:14:15,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:15,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [860625905] [2022-01-31 21:14:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:15,240 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:15,240 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:15,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:15,246 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:15,263 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-01-31 21:14:15,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:15,303 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:15,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [860625905] [2022-01-31 21:14:15,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [860625905] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:15,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:15,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:15,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669467722] [2022-01-31 21:14:15,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:15,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:15,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:15,304 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-01-31 21:14:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:15,371 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-01-31 21:14:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:14:15,372 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-01-31 21:14:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:15,372 INFO L225 Difference]: With dead ends: 36 [2022-01-31 21:14:15,372 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 21:14:15,373 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-01-31 21:14:15,373 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-01-31 21:14:15,373 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-01-31 21:14:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 21:14:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-01-31 21:14:15,378 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-01-31 21:14:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-01-31 21:14:15,378 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-01-31 21:14:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:15,378 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-01-31 21:14:15,379 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-01-31 21:14:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-01-31 21:14:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:14:15,379 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:15,379 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-01-31 21:14:15,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:14:15,379 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:15,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-01-31 21:14:15,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:15,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1741143593] [2022-01-31 21:14:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:15,416 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:15,417 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:15,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:15,420 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:15,427 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:15,459 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:15,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1741143593] [2022-01-31 21:14:15,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1741143593] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:15,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:15,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:15,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122217648] [2022-01-31 21:14:15,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:15,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:15,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:15,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:15,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:15,460 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-01-31 21:14:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:15,554 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-01-31 21:14:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:14:15,555 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-01-31 21:14:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:15,555 INFO L225 Difference]: With dead ends: 39 [2022-01-31 21:14:15,555 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 21:14:15,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:14:15,556 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-01-31 21:14:15,556 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-01-31 21:14:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 21:14:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-01-31 21:14:15,562 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-01-31 21:14:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-01-31 21:14:15,562 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2022-01-31 21:14:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:15,562 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-01-31 21:14:15,562 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-01-31 21:14:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-01-31 21:14:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 21:14:15,563 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:15,563 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-01-31 21:14:15,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:14:15,563 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-01-31 21:14:15,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:15,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2029985779] [2022-01-31 21:14:15,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:15,662 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:15,663 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:15,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:15,666 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:15,686 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-01-31 21:14:15,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:16,179 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:16,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2029985779] [2022-01-31 21:14:16,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2029985779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:16,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:16,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:14:16,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306638741] [2022-01-31 21:14:16,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:16,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:14:16,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:16,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:14:16,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:14:16,180 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-01-31 21:14:17,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:17,980 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2022-01-31 21:14:17,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:14:17,981 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-01-31 21:14:17,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:17,981 INFO L225 Difference]: With dead ends: 69 [2022-01-31 21:14:17,981 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 21:14:17,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:14:17,982 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-01-31 21:14:17,982 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-01-31 21:14:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 21:14:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-01-31 21:14:17,991 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-01-31 21:14:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2022-01-31 21:14:17,991 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 21 [2022-01-31 21:14:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:17,991 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2022-01-31 21:14:17,991 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-01-31 21:14:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-01-31 21:14:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 21:14:17,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:17,992 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-01-31 21:14:17,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:14:17,992 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash -794011953, now seen corresponding path program 2 times [2022-01-31 21:14:17,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:17,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1278446573] [2022-01-31 21:14:17,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:18,021 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:18,021 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:18,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:18,028 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:18,056 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-01-31 21:14:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:18,450 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:18,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1278446573] [2022-01-31 21:14:18,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1278446573] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:18,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:18,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:14:18,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317294759] [2022-01-31 21:14:18,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:18,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:14:18,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:18,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:14:18,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:14:18,451 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-01-31 21:14:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:23,733 INFO L93 Difference]: Finished difference Result 60 states and 83 transitions. [2022-01-31 21:14:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:14:23,733 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-01-31 21:14:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:23,733 INFO L225 Difference]: With dead ends: 60 [2022-01-31 21:14:23,733 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 21:14:23,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:14:23,734 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-01-31 21:14:23,734 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-01-31 21:14:23,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 21:14:23,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2022-01-31 21:14:23,744 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-01-31 21:14:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-01-31 21:14:23,746 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 21 [2022-01-31 21:14:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:23,746 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-01-31 21:14:23,746 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-01-31 21:14:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2022-01-31 21:14:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 21:14:23,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:23,747 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-01-31 21:14:23,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:14:23,749 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:23,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:23,750 INFO L85 PathProgramCache]: Analyzing trace with hash -977123598, now seen corresponding path program 2 times [2022-01-31 21:14:23,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:23,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1345026247] [2022-01-31 21:14:23,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:23,802 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:23,803 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:23,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:23,806 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:23,816 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:23,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:23,880 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:23,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1345026247] [2022-01-31 21:14:23,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1345026247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:23,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:23,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:23,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660683224] [2022-01-31 21:14:23,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:23,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:23,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:23,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:23,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:23,882 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-01-31 21:14:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:23,975 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-01-31 21:14:23,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:14:23,975 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-01-31 21:14:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:23,977 INFO L225 Difference]: With dead ends: 54 [2022-01-31 21:14:23,977 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 21:14:23,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:14:23,979 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:23,979 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.0s Time] [2022-01-31 21:14:23,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 21:14:23,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-01-31 21:14:23,994 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-01-31 21:14:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-01-31 21:14:23,994 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 22 [2022-01-31 21:14:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:23,994 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-01-31 21:14:23,994 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-01-31 21:14:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-01-31 21:14:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 21:14:23,997 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:23,997 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-01-31 21:14:23,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:14:23,997 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash -439116189, now seen corresponding path program 3 times [2022-01-31 21:14:23,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:23,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1125850358] [2022-01-31 21:14:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:24,029 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:24,029 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:24,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:24,034 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:24,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:24,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:24,087 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:24,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1125850358] [2022-01-31 21:14:24,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1125850358] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:24,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:24,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:24,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057899587] [2022-01-31 21:14:24,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:24,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:24,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:24,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:24,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:24,088 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-01-31 21:14:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:24,176 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-01-31 21:14:24,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:14:24,176 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-01-31 21:14:24,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:24,176 INFO L225 Difference]: With dead ends: 60 [2022-01-31 21:14:24,177 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 21:14:24,177 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-01-31 21:14:24,177 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-01-31 21:14:24,177 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-01-31 21:14:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 21:14:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-01-31 21:14:24,189 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-01-31 21:14:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2022-01-31 21:14:24,189 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 22 [2022-01-31 21:14:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:24,189 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-01-31 21:14:24,189 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-01-31 21:14:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-01-31 21:14:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:14:24,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:24,190 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-01-31 21:14:24,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:14:24,190 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash -6760208, now seen corresponding path program 3 times [2022-01-31 21:14:24,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:24,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1026969021] [2022-01-31 21:14:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:24,235 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:24,235 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:24,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:24,239 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:24,247 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:24,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:24,314 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:24,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1026969021] [2022-01-31 21:14:24,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1026969021] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:24,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:24,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:14:24,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401849089] [2022-01-31 21:14:24,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:24,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:14:24,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:24,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:14:24,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:14:24,315 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-01-31 21:14:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:24,530 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2022-01-31 21:14:24,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:14:24,530 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-01-31 21:14:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:24,531 INFO L225 Difference]: With dead ends: 87 [2022-01-31 21:14:24,531 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 21:14:24,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:14:24,531 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.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:24,531 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.1s Time] [2022-01-31 21:14:24,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 21:14:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 50. [2022-01-31 21:14:24,542 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-01-31 21:14:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2022-01-31 21:14:24,542 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 23 [2022-01-31 21:14:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:24,542 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-01-31 21:14:24,542 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-01-31 21:14:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-01-31 21:14:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 21:14:24,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:24,543 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-01-31 21:14:24,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:14:24,543 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:24,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:24,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1804115870, now seen corresponding path program 4 times [2022-01-31 21:14:24,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:24,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1043376207] [2022-01-31 21:14:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:24,597 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:24,598 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:24,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:24,606 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:24,624 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:24,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:24,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-01-31 21:14:24,688 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:24,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1043376207] [2022-01-31 21:14:24,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1043376207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:24,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:24,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:14:24,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812619673] [2022-01-31 21:14:24,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:24,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:14:24,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:24,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:14:24,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:14:24,689 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-01-31 21:14:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:24,878 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2022-01-31 21:14:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:14:24,879 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-01-31 21:14:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:24,879 INFO L225 Difference]: With dead ends: 64 [2022-01-31 21:14:24,879 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 21:14:24,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:14:24,880 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-01-31 21:14:24,880 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-01-31 21:14:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 21:14:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-01-31 21:14:24,888 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-01-31 21:14:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2022-01-31 21:14:24,889 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 24 [2022-01-31 21:14:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:24,889 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-01-31 21:14:24,889 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-01-31 21:14:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-01-31 21:14:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 21:14:24,889 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:24,889 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-01-31 21:14:24,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:14:24,889 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:24,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:24,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1227757058, now seen corresponding path program 4 times [2022-01-31 21:14:24,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:24,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1234099406] [2022-01-31 21:14:24,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:26,936 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:26,936 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:26,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:26,944 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-01-31 21:14:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:26,951 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-01-31 21:14:26,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:27,019 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:27,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1234099406] [2022-01-31 21:14:27,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1234099406] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:27,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:27,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:14:27,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991281948] [2022-01-31 21:14:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:27,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:14:27,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:27,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:14:27,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:14:27,020 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-01-31 21:14:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:27,229 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2022-01-31 21:14:27,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:14:27,229 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-01-31 21:14:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:27,229 INFO L225 Difference]: With dead ends: 66 [2022-01-31 21:14:27,229 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 21:14:27,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:14:27,230 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-01-31 21:14:27,230 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-01-31 21:14:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 21:14:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-01-31 21:14:27,242 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-01-31 21:14:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-01-31 21:14:27,243 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 24 [2022-01-31 21:14:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:27,243 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-01-31 21:14:27,243 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-01-31 21:14:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-01-31 21:14:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 21:14:27,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:27,244 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-01-31 21:14:27,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:14:27,244 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:27,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:27,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1822836127, now seen corresponding path program 5 times [2022-01-31 21:14:27,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:27,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [990938432] [2022-01-31 21:14:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:27,278 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:27,278 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:27,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:27,281 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:27,307 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-01-31 21:14:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:30,502 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:30,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [990938432] [2022-01-31 21:14:30,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [990938432] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:30,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:30,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:14:30,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652962435] [2022-01-31 21:14:30,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:30,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:14:30,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:30,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:14:30,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:14:30,503 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-01-31 21:14:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:38,579 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2022-01-31 21:14:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:14:38,579 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-01-31 21:14:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:38,580 INFO L225 Difference]: With dead ends: 104 [2022-01-31 21:14:38,580 INFO L226 Difference]: Without dead ends: 86 [2022-01-31 21:14:38,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:14:38,580 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-01-31 21:14:38,581 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-01-31 21:14:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-31 21:14:38,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2022-01-31 21:14:38,597 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-01-31 21:14:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2022-01-31 21:14:38,598 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 25 [2022-01-31 21:14:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:38,598 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2022-01-31 21:14:38,598 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-01-31 21:14:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2022-01-31 21:14:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 21:14:38,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:38,599 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-01-31 21:14:38,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:14:38,599 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:38,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 5 times [2022-01-31 21:14:38,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:38,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [905473385] [2022-01-31 21:14:38,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:38,631 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:38,631 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:38,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:38,634 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:38,691 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-01-31 21:14:38,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:43,579 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:43,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [905473385] [2022-01-31 21:14:43,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [905473385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:43,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:43,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:14:43,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048121796] [2022-01-31 21:14:43,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:43,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:14:43,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:43,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:14:43,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=257, Unknown=1, NotChecked=0, Total=306 [2022-01-31 21:14:43,580 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-01-31 21:14:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:44,123 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-01-31 21:14:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:14:44,124 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-01-31 21:14:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:44,124 INFO L225 Difference]: With dead ends: 69 [2022-01-31 21:14:44,124 INFO L226 Difference]: Without dead ends: 64 [2022-01-31 21:14:44,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=101, Invalid=654, Unknown=1, NotChecked=0, Total=756 [2022-01-31 21:14:44,125 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:44,125 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.2s Time] [2022-01-31 21:14:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-31 21:14:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-01-31 21:14:44,143 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-01-31 21:14:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-01-31 21:14:44,143 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 26 [2022-01-31 21:14:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:44,143 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-01-31 21:14:44,144 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-01-31 21:14:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-01-31 21:14:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 21:14:44,144 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:44,167 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-01-31 21:14:44,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:14:44,168 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:44,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1626264450, now seen corresponding path program 6 times [2022-01-31 21:14:44,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:44,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1074097694] [2022-01-31 21:14:44,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:44,255 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:44,255 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:44,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:44,258 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:44,266 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:44,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:44,339 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:44,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1074097694] [2022-01-31 21:14:44,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1074097694] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:44,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:44,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:14:44,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984081828] [2022-01-31 21:14:44,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:44,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:14:44,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:14:44,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:14:44,340 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-01-31 21:14:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:44,642 INFO L93 Difference]: Finished difference Result 128 states and 178 transitions. [2022-01-31 21:14:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:14:44,643 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-01-31 21:14:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:44,644 INFO L225 Difference]: With dead ends: 128 [2022-01-31 21:14:44,644 INFO L226 Difference]: Without dead ends: 117 [2022-01-31 21:14:44,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:14:44,646 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 95 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-01-31 21:14:44,646 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-01-31 21:14:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-01-31 21:14:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 79. [2022-01-31 21:14:44,670 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-01-31 21:14:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2022-01-31 21:14:44,670 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 26 [2022-01-31 21:14:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:44,670 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2022-01-31 21:14:44,670 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-01-31 21:14:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2022-01-31 21:14:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 21:14:44,671 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:44,671 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-01-31 21:14:44,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 21:14:44,671 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:44,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:44,671 INFO L85 PathProgramCache]: Analyzing trace with hash 62925025, now seen corresponding path program 7 times [2022-01-31 21:14:44,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:44,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1390576338] [2022-01-31 21:14:44,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:44,707 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:44,707 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:44,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:44,710 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:44,719 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:44,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:44,784 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:44,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1390576338] [2022-01-31 21:14:44,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1390576338] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:44,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:44,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:14:44,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695586697] [2022-01-31 21:14:44,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:44,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:14:44,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:44,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:14:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:14:44,785 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-01-31 21:14:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:44,992 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2022-01-31 21:14:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:14:44,992 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-01-31 21:14:44,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:44,992 INFO L225 Difference]: With dead ends: 96 [2022-01-31 21:14:44,993 INFO L226 Difference]: Without dead ends: 81 [2022-01-31 21:14:44,993 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-01-31 21:14:44,993 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-01-31 21:14:44,993 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-01-31 21:14:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-31 21:14:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-01-31 21:14:45,017 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-01-31 21:14:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2022-01-31 21:14:45,018 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 27 [2022-01-31 21:14:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:45,018 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2022-01-31 21:14:45,018 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-01-31 21:14:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-01-31 21:14:45,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 21:14:45,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:45,018 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-01-31 21:14:45,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 21:14:45,019 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:45,019 INFO L85 PathProgramCache]: Analyzing trace with hash 171340688, now seen corresponding path program 8 times [2022-01-31 21:14:45,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:45,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1965013784] [2022-01-31 21:14:45,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:45,057 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:45,057 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:45,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:45,060 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:45,068 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:45,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:45,169 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:45,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1965013784] [2022-01-31 21:14:45,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1965013784] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:45,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:45,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:14:45,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803425281] [2022-01-31 21:14:45,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:45,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:14:45,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:45,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:14:45,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:14:45,170 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-01-31 21:14:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:45,523 INFO L93 Difference]: Finished difference Result 144 states and 199 transitions. [2022-01-31 21:14:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:14:45,523 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-01-31 21:14:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:45,523 INFO L225 Difference]: With dead ends: 144 [2022-01-31 21:14:45,524 INFO L226 Difference]: Without dead ends: 131 [2022-01-31 21:14:45,524 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-01-31 21:14:45,524 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 89 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-01-31 21:14:45,524 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-01-31 21:14:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-01-31 21:14:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 85. [2022-01-31 21:14:45,553 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-01-31 21:14:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2022-01-31 21:14:45,554 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 27 [2022-01-31 21:14:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:45,554 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2022-01-31 21:14:45,554 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-01-31 21:14:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2022-01-31 21:14:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 21:14:45,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:45,554 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-01-31 21:14:45,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 21:14:45,555 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:45,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1703289154, now seen corresponding path program 9 times [2022-01-31 21:14:45,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:45,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [741606654] [2022-01-31 21:14:45,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:45,584 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:45,584 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:45,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:45,587 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:45,595 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:45,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:45,682 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:45,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [741606654] [2022-01-31 21:14:45,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [741606654] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:45,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:45,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:14:45,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243060052] [2022-01-31 21:14:45,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:45,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:14:45,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:45,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:14:45,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:14:45,683 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-01-31 21:14:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:46,080 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2022-01-31 21:14:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:14:46,080 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-01-31 21:14:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:46,081 INFO L225 Difference]: With dead ends: 104 [2022-01-31 21:14:46,081 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 21:14:46,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:14:46,081 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-01-31 21:14:46,082 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-01-31 21:14:46,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 21:14:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-01-31 21:14:46,097 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-01-31 21:14:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-01-31 21:14:46,098 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 28 [2022-01-31 21:14:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:46,098 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-01-31 21:14:46,098 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-01-31 21:14:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-01-31 21:14:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 21:14:46,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:46,098 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-01-31 21:14:46,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 21:14:46,098 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:46,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1788990354, now seen corresponding path program 6 times [2022-01-31 21:14:46,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:46,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [665363185] [2022-01-31 21:14:46,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:46,177 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:46,178 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:46,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:46,181 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:46,189 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:46,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:46,283 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:46,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [665363185] [2022-01-31 21:14:46,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [665363185] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:46,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:46,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:14:46,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959651660] [2022-01-31 21:14:46,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:46,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:14:46,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:46,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:14:46,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:14:46,284 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-01-31 21:14:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:46,727 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2022-01-31 21:14:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:14:46,728 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-01-31 21:14:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:46,728 INFO L225 Difference]: With dead ends: 92 [2022-01-31 21:14:46,728 INFO L226 Difference]: Without dead ends: 87 [2022-01-31 21:14:46,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:14:46,729 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.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:46,729 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.2s Time] [2022-01-31 21:14:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-31 21:14:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2022-01-31 21:14:46,755 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-01-31 21:14:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2022-01-31 21:14:46,755 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 28 [2022-01-31 21:14:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:46,755 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2022-01-31 21:14:46,755 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-01-31 21:14:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2022-01-31 21:14:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:14:46,755 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:46,756 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-01-31 21:14:46,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 21:14:46,756 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash 22222479, now seen corresponding path program 7 times [2022-01-31 21:14:46,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:46,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643121166] [2022-01-31 21:14:46,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:46,790 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:46,790 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:46,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:46,793 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:46,805 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-01-31 21:14:46,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:46,914 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:46,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643121166] [2022-01-31 21:14:46,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1643121166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:46,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:46,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:14:46,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492571146] [2022-01-31 21:14:46,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:46,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:14:46,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:46,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:14:46,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:14:46,916 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-01-31 21:14:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:47,677 INFO L93 Difference]: Finished difference Result 153 states and 212 transitions. [2022-01-31 21:14:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 21:14:47,677 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-01-31 21:14:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:47,678 INFO L225 Difference]: With dead ends: 153 [2022-01-31 21:14:47,678 INFO L226 Difference]: Without dead ends: 147 [2022-01-31 21:14:47,678 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-01-31 21:14:47,679 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 87 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-01-31 21:14:47,679 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-01-31 21:14:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-01-31 21:14:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2022-01-31 21:14:47,711 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-01-31 21:14:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2022-01-31 21:14:47,711 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 29 [2022-01-31 21:14:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:47,711 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2022-01-31 21:14:47,711 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-01-31 21:14:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2022-01-31 21:14:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:14:47,712 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:47,712 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-01-31 21:14:47,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 21:14:47,712 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash 723391956, now seen corresponding path program 10 times [2022-01-31 21:14:47,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:47,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1247955699] [2022-01-31 21:14:47,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:47,772 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:47,772 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:47,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:47,775 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:47,789 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:47,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:47,919 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:47,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1247955699] [2022-01-31 21:14:47,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1247955699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:47,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:47,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:14:47,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850184909] [2022-01-31 21:14:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:47,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:14:47,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:47,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:14:47,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:14:47,920 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-01-31 21:14:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:48,570 INFO L93 Difference]: Finished difference Result 135 states and 184 transitions. [2022-01-31 21:14:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:14:48,570 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-01-31 21:14:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:48,571 INFO L225 Difference]: With dead ends: 135 [2022-01-31 21:14:48,571 INFO L226 Difference]: Without dead ends: 130 [2022-01-31 21:14:48,571 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-01-31 21:14:48,571 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 61 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-01-31 21:14:48,572 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-01-31 21:14:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-01-31 21:14:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 99. [2022-01-31 21:14:48,628 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-01-31 21:14:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2022-01-31 21:14:48,628 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 30 [2022-01-31 21:14:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:48,628 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2022-01-31 21:14:48,628 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-01-31 21:14:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2022-01-31 21:14:48,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:14:48,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:48,629 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-01-31 21:14:48,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 21:14:48,629 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:48,629 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 11 times [2022-01-31 21:14:48,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:48,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [156786981] [2022-01-31 21:14:48,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:48,683 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:48,683 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:48,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:48,688 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:48,728 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-01-31 21:14:49,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:58,405 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:58,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [156786981] [2022-01-31 21:14:58,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [156786981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:58,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:58,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:14:58,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922836406] [2022-01-31 21:14:58,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:58,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:14:58,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:58,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:14:58,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=398, Unknown=3, NotChecked=0, Total=462 [2022-01-31 21:14:58,406 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-01-31 21:14:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:59,159 INFO L93 Difference]: Finished difference Result 136 states and 175 transitions. [2022-01-31 21:14:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:14:59,159 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-01-31 21:14:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:59,160 INFO L225 Difference]: With dead ends: 136 [2022-01-31 21:14:59,160 INFO L226 Difference]: Without dead ends: 123 [2022-01-31 21:14:59,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=137, Invalid=1120, Unknown=3, NotChecked=0, Total=1260 [2022-01-31 21:14:59,160 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.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:59,161 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.2s Time] [2022-01-31 21:14:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-31 21:14:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2022-01-31 21:14:59,215 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-01-31 21:14:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 147 transitions. [2022-01-31 21:14:59,216 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 147 transitions. Word has length 31 [2022-01-31 21:14:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:59,216 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 147 transitions. [2022-01-31 21:14:59,216 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-01-31 21:14:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 147 transitions. [2022-01-31 21:14:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:14:59,216 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:59,216 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-01-31 21:14:59,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 21:14:59,217 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash -628453999, now seen corresponding path program 12 times [2022-01-31 21:14:59,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:59,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [683908828] [2022-01-31 21:14:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:59,257 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:59,258 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:59,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:59,260 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:59,270 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:59,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:59,398 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:59,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [683908828] [2022-01-31 21:14:59,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [683908828] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:59,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:59,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:14:59,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701490204] [2022-01-31 21:14:59,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:59,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:14:59,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:59,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:14:59,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:14:59,399 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-01-31 21:15:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:00,073 INFO L93 Difference]: Finished difference Result 187 states and 245 transitions. [2022-01-31 21:15:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:15:00,073 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-01-31 21:15:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:00,074 INFO L225 Difference]: With dead ends: 187 [2022-01-31 21:15:00,074 INFO L226 Difference]: Without dead ends: 153 [2022-01-31 21:15:00,074 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-01-31 21:15:00,075 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-01-31 21:15:00,075 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-01-31 21:15:00,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-01-31 21:15:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 91. [2022-01-31 21:15:00,120 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-01-31 21:15:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2022-01-31 21:15:00,120 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 31 [2022-01-31 21:15:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:00,120 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2022-01-31 21:15:00,121 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-01-31 21:15:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2022-01-31 21:15:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:15:00,121 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:00,121 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-01-31 21:15:00,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 21:15:00,121 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash 944401809, now seen corresponding path program 13 times [2022-01-31 21:15:00,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:00,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [763093289] [2022-01-31 21:15:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:00,158 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:00,159 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:00,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:00,162 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:00,169 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:00,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:00,301 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:00,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [763093289] [2022-01-31 21:15:00,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [763093289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:00,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:00,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:15:00,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613229012] [2022-01-31 21:15:00,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:00,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:15:00,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:00,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:15:00,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:15:00,302 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-01-31 21:15:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:00,898 INFO L93 Difference]: Finished difference Result 215 states and 322 transitions. [2022-01-31 21:15:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:15:00,899 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-01-31 21:15:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:00,899 INFO L225 Difference]: With dead ends: 215 [2022-01-31 21:15:00,899 INFO L226 Difference]: Without dead ends: 196 [2022-01-31 21:15:00,900 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-01-31 21:15:00,900 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-01-31 21:15:00,900 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-01-31 21:15:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-01-31 21:15:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 105. [2022-01-31 21:15:00,957 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-01-31 21:15:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2022-01-31 21:15:00,957 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 31 [2022-01-31 21:15:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:00,957 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2022-01-31 21:15:00,957 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-01-31 21:15:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2022-01-31 21:15:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 21:15:00,958 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:00,958 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-01-31 21:15:00,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 21:15:00,958 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash -420451419, now seen corresponding path program 14 times [2022-01-31 21:15:00,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:00,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [998095284] [2022-01-31 21:15:00,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:00,986 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:00,986 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:00,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:00,989 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:00,997 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:01,137 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:01,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [998095284] [2022-01-31 21:15:01,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [998095284] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:01,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:01,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:15:01,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029799793] [2022-01-31 21:15:01,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:01,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:15:01,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:01,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:15:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:15:01,138 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-01-31 21:15:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:01,813 INFO L93 Difference]: Finished difference Result 234 states and 348 transitions. [2022-01-31 21:15:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:15:01,813 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-01-31 21:15:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:01,814 INFO L225 Difference]: With dead ends: 234 [2022-01-31 21:15:01,814 INFO L226 Difference]: Without dead ends: 215 [2022-01-31 21:15:01,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:15:01,814 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.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:01,815 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.3s Time] [2022-01-31 21:15:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-01-31 21:15:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 118. [2022-01-31 21:15:01,882 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-01-31 21:15:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 161 transitions. [2022-01-31 21:15:01,883 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 161 transitions. Word has length 32 [2022-01-31 21:15:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:01,883 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 161 transitions. [2022-01-31 21:15:01,883 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-01-31 21:15:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 161 transitions. [2022-01-31 21:15:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 21:15:01,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:01,884 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-01-31 21:15:01,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 21:15:01,884 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:01,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1665087761, now seen corresponding path program 15 times [2022-01-31 21:15:01,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:01,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [153579013] [2022-01-31 21:15:01,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:01,925 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:01,925 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:01,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:01,928 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:01,938 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:02,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:02,065 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:02,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [153579013] [2022-01-31 21:15:02,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [153579013] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:02,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:02,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:15:02,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558050264] [2022-01-31 21:15:02,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:02,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:15:02,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:02,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:15:02,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:15:02,066 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-01-31 21:15:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:03,006 INFO L93 Difference]: Finished difference Result 188 states and 247 transitions. [2022-01-31 21:15:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 21:15:03,007 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-01-31 21:15:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:03,007 INFO L225 Difference]: With dead ends: 188 [2022-01-31 21:15:03,007 INFO L226 Difference]: Without dead ends: 170 [2022-01-31 21:15:03,008 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-01-31 21:15:03,008 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.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:03,008 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.3s Time] [2022-01-31 21:15:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-01-31 21:15:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 105. [2022-01-31 21:15:03,066 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-01-31 21:15:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2022-01-31 21:15:03,066 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 33 [2022-01-31 21:15:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:03,066 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2022-01-31 21:15:03,067 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-01-31 21:15:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2022-01-31 21:15:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 21:15:03,067 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:03,067 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-01-31 21:15:03,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 21:15:03,067 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:03,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:03,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1090479377, now seen corresponding path program 16 times [2022-01-31 21:15:03,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:03,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1992333668] [2022-01-31 21:15:03,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:03,106 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:03,106 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:03,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:03,109 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:03,120 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:03,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:03,304 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:03,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1992333668] [2022-01-31 21:15:03,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1992333668] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:03,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:03,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:15:03,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189198689] [2022-01-31 21:15:03,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:03,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:15:03,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:03,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:15:03,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:15:03,305 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-01-31 21:15:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:04,328 INFO L93 Difference]: Finished difference Result 277 states and 372 transitions. [2022-01-31 21:15:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 21:15:04,328 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-01-31 21:15:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:04,329 INFO L225 Difference]: With dead ends: 277 [2022-01-31 21:15:04,329 INFO L226 Difference]: Without dead ends: 182 [2022-01-31 21:15:04,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=1879, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 21:15:04,329 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 74 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:04,330 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.4s Time] [2022-01-31 21:15:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-01-31 21:15:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 103. [2022-01-31 21:15:04,386 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-01-31 21:15:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 136 transitions. [2022-01-31 21:15:04,387 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 136 transitions. Word has length 33 [2022-01-31 21:15:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:04,387 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 136 transitions. [2022-01-31 21:15:04,387 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-01-31 21:15:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 136 transitions. [2022-01-31 21:15:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:15:04,388 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:04,388 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-01-31 21:15:04,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 21:15:04,388 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:04,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash 814681119, now seen corresponding path program 17 times [2022-01-31 21:15:04,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:04,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [437666667] [2022-01-31 21:15:04,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:04,437 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:04,437 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:04,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:04,440 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:04,453 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:04,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:04,666 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:04,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [437666667] [2022-01-31 21:15:04,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [437666667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:04,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:04,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:15:04,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483605755] [2022-01-31 21:15:04,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:04,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:15:04,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:04,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:15:04,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:15:04,668 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-01-31 21:15:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:05,725 INFO L93 Difference]: Finished difference Result 238 states and 351 transitions. [2022-01-31 21:15:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:15:05,726 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-01-31 21:15:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:05,726 INFO L225 Difference]: With dead ends: 238 [2022-01-31 21:15:05,726 INFO L226 Difference]: Without dead ends: 224 [2022-01-31 21:15:05,727 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-01-31 21:15:05,727 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 161 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-01-31 21:15:05,727 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-01-31 21:15:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-01-31 21:15:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 116. [2022-01-31 21:15:05,797 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-01-31 21:15:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 155 transitions. [2022-01-31 21:15:05,798 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 155 transitions. Word has length 35 [2022-01-31 21:15:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:05,798 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 155 transitions. [2022-01-31 21:15:05,798 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-01-31 21:15:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 155 transitions. [2022-01-31 21:15:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:15:05,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:05,798 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-01-31 21:15:05,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 21:15:05,798 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:05,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:05,799 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 18 times [2022-01-31 21:15:05,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:05,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [189687388] [2022-01-31 21:15:05,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:05,828 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:05,828 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:05,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:05,832 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:05,867 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-01-31 21:15:06,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:30,280 WARN L228 SmtUtils]: Spent 6.91s 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-01-31 21:15:30,281 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:30,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [189687388] [2022-01-31 21:15:30,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [189687388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:30,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:30,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:15:30,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684636558] [2022-01-31 21:15:30,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:30,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:15:30,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:15:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=527, Unknown=1, NotChecked=0, Total=600 [2022-01-31 21:15:30,282 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-01-31 21:15:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:31,659 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2022-01-31 21:15:31,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:15:31,659 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-01-31 21:15:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:31,660 INFO L225 Difference]: With dead ends: 131 [2022-01-31 21:15:31,660 INFO L226 Difference]: Without dead ends: 126 [2022-01-31 21:15:31,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=156, Invalid=1483, Unknown=1, NotChecked=0, Total=1640 [2022-01-31 21:15:31,660 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-01-31 21:15:31,661 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-01-31 21:15:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-01-31 21:15:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2022-01-31 21:15:31,740 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-01-31 21:15:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 161 transitions. [2022-01-31 21:15:31,741 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 161 transitions. Word has length 36 [2022-01-31 21:15:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:31,741 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 161 transitions. [2022-01-31 21:15:31,741 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-01-31 21:15:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 161 transitions. [2022-01-31 21:15:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:15:31,741 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:31,741 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-01-31 21:15:31,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 21:15:31,742 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash -598402012, now seen corresponding path program 19 times [2022-01-31 21:15:31,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:31,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [187573081] [2022-01-31 21:15:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:31,787 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:31,787 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:31,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:31,790 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:31,802 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:31,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:31,982 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:31,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [187573081] [2022-01-31 21:15:31,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [187573081] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:31,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:31,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:15:31,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462937881] [2022-01-31 21:15:31,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:31,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:15:31,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:31,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:15:31,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:15:31,983 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-01-31 21:15:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:33,070 INFO L93 Difference]: Finished difference Result 204 states and 264 transitions. [2022-01-31 21:15:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 21:15:33,070 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-01-31 21:15:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:33,071 INFO L225 Difference]: With dead ends: 204 [2022-01-31 21:15:33,071 INFO L226 Difference]: Without dead ends: 199 [2022-01-31 21:15:33,072 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-01-31 21:15:33,072 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-01-31 21:15:33,072 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-01-31 21:15:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-01-31 21:15:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 127. [2022-01-31 21:15:33,162 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-01-31 21:15:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 167 transitions. [2022-01-31 21:15:33,162 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 167 transitions. Word has length 36 [2022-01-31 21:15:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:33,162 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 167 transitions. [2022-01-31 21:15:33,162 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-01-31 21:15:33,162 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 167 transitions. [2022-01-31 21:15:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:15:33,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:33,163 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-01-31 21:15:33,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 21:15:33,163 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:33,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:33,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1800809297, now seen corresponding path program 8 times [2022-01-31 21:15:33,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:33,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [888639582] [2022-01-31 21:15:33,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:33,194 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:33,194 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:33,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:33,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:33,205 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:33,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:33,427 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:33,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [888639582] [2022-01-31 21:15:33,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [888639582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:33,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:33,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:15:33,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449550848] [2022-01-31 21:15:33,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:33,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:15:33,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:33,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:15:33,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:15:33,429 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-01-31 21:15:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:34,668 INFO L93 Difference]: Finished difference Result 289 states and 423 transitions. [2022-01-31 21:15:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:15:34,668 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-01-31 21:15:34,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:34,669 INFO L225 Difference]: With dead ends: 289 [2022-01-31 21:15:34,669 INFO L226 Difference]: Without dead ends: 273 [2022-01-31 21:15:34,669 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-01-31 21:15:34,670 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 205 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:34,670 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.6s Time] [2022-01-31 21:15:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-01-31 21:15:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 140. [2022-01-31 21:15:34,774 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-01-31 21:15:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 185 transitions. [2022-01-31 21:15:34,775 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 185 transitions. Word has length 36 [2022-01-31 21:15:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:34,775 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 185 transitions. [2022-01-31 21:15:34,776 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-01-31 21:15:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 185 transitions. [2022-01-31 21:15:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 21:15:34,782 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:34,782 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-01-31 21:15:34,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 21:15:34,783 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:34,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:34,783 INFO L85 PathProgramCache]: Analyzing trace with hash -424783871, now seen corresponding path program 20 times [2022-01-31 21:15:34,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:34,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [165279574] [2022-01-31 21:15:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:34,822 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:34,822 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:34,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:34,826 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:34,838 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:34,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:34,968 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:34,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [165279574] [2022-01-31 21:15:34,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [165279574] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:34,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:34,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:15:34,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782035497] [2022-01-31 21:15:34,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:34,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:15:34,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:34,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:15:34,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:15:34,969 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-01-31 21:15:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:35,753 INFO L93 Difference]: Finished difference Result 232 states and 294 transitions. [2022-01-31 21:15:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:15:35,754 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-01-31 21:15:35,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:35,755 INFO L225 Difference]: With dead ends: 232 [2022-01-31 21:15:35,755 INFO L226 Difference]: Without dead ends: 211 [2022-01-31 21:15:35,756 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-01-31 21:15:35,756 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-01-31 21:15:35,756 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-01-31 21:15:35,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-31 21:15:35,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 140. [2022-01-31 21:15:35,874 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-01-31 21:15:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 184 transitions. [2022-01-31 21:15:35,874 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 184 transitions. Word has length 37 [2022-01-31 21:15:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:35,874 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 184 transitions. [2022-01-31 21:15:35,875 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-01-31 21:15:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 184 transitions. [2022-01-31 21:15:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 21:15:35,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:35,875 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-01-31 21:15:35,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 21:15:35,875 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:35,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2005031169, now seen corresponding path program 21 times [2022-01-31 21:15:35,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:35,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1964711110] [2022-01-31 21:15:35,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:35,905 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:35,905 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:35,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:35,908 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:35,921 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:36,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:36,185 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:36,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1964711110] [2022-01-31 21:15:36,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1964711110] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:36,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:36,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:15:36,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369113775] [2022-01-31 21:15:36,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:36,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:15:36,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:36,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:15:36,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:15:36,186 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-01-31 21:15:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:38,321 INFO L93 Difference]: Finished difference Result 439 states and 567 transitions. [2022-01-31 21:15:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 21:15:38,321 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-01-31 21:15:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:38,322 INFO L225 Difference]: With dead ends: 439 [2022-01-31 21:15:38,322 INFO L226 Difference]: Without dead ends: 310 [2022-01-31 21:15:38,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=447, Invalid=3335, Unknown=0, NotChecked=0, Total=3782 [2022-01-31 21:15:38,324 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:38,324 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.7s Time] [2022-01-31 21:15:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-01-31 21:15:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 139. [2022-01-31 21:15:38,443 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-01-31 21:15:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 179 transitions. [2022-01-31 21:15:38,444 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 179 transitions. Word has length 37 [2022-01-31 21:15:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:38,444 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 179 transitions. [2022-01-31 21:15:38,444 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-01-31 21:15:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 179 transitions. [2022-01-31 21:15:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 21:15:38,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:38,445 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-01-31 21:15:38,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 21:15:38,445 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -39042254, now seen corresponding path program 9 times [2022-01-31 21:15:38,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:38,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [709906554] [2022-01-31 21:15:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:38,487 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:38,487 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:38,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:38,490 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:38,500 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:38,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:38,838 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:38,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [709906554] [2022-01-31 21:15:38,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [709906554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:38,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:38,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:15:38,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063411158] [2022-01-31 21:15:38,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:38,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:15:38,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:38,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:15:38,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:15:38,839 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-01-31 21:15:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:40,609 INFO L93 Difference]: Finished difference Result 329 states and 484 transitions. [2022-01-31 21:15:40,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:15:40,610 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-01-31 21:15:40,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:40,611 INFO L225 Difference]: With dead ends: 329 [2022-01-31 21:15:40,611 INFO L226 Difference]: Without dead ends: 308 [2022-01-31 21:15:40,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=360, Invalid=1200, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 21:15:40,611 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 181 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:40,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 68 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:15:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-01-31 21:15:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 153. [2022-01-31 21:15:40,746 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-01-31 21:15:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 199 transitions. [2022-01-31 21:15:40,746 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 199 transitions. Word has length 38 [2022-01-31 21:15:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:40,747 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 199 transitions. [2022-01-31 21:15:40,747 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-01-31 21:15:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 199 transitions. [2022-01-31 21:15:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 21:15:40,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:40,747 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-01-31 21:15:40,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 21:15:40,747 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash 479003230, now seen corresponding path program 10 times [2022-01-31 21:15:40,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:40,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [224479506] [2022-01-31 21:15:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:40,771 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:40,772 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:40,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:40,775 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:40,785 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:40,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:41,158 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:41,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [224479506] [2022-01-31 21:15:41,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [224479506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:41,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:41,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:15:41,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179675748] [2022-01-31 21:15:41,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:41,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:15:41,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:41,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:15:41,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:15:41,159 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-01-31 21:15:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:43,258 INFO L93 Difference]: Finished difference Result 348 states and 509 transitions. [2022-01-31 21:15:43,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 21:15:43,259 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-01-31 21:15:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:43,260 INFO L225 Difference]: With dead ends: 348 [2022-01-31 21:15:43,260 INFO L226 Difference]: Without dead ends: 327 [2022-01-31 21:15:43,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 21:15:43,261 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 283 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:43,261 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.1s Time] [2022-01-31 21:15:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-01-31 21:15:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 166. [2022-01-31 21:15:43,416 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-01-31 21:15:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 217 transitions. [2022-01-31 21:15:43,416 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 217 transitions. Word has length 39 [2022-01-31 21:15:43,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:43,416 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 217 transitions. [2022-01-31 21:15:43,416 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-01-31 21:15:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 217 transitions. [2022-01-31 21:15:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 21:15:43,417 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:43,417 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-01-31 21:15:43,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 21:15:43,417 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash -266855244, now seen corresponding path program 22 times [2022-01-31 21:15:43,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:43,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1794664044] [2022-01-31 21:15:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:43,458 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:43,458 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:43,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:43,464 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:15:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:43,507 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-01-31 21:15:43,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:16:09,914 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:09,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1794664044] [2022-01-31 21:16:09,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1794664044] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:09,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:09,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 21:16:09,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191096859] [2022-01-31 21:16:09,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:09,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 21:16:09,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:09,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 21:16:09,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:16:09,916 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-01-31 21:16:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:12,508 INFO L93 Difference]: Finished difference Result 187 states and 248 transitions. [2022-01-31 21:16:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:16:12,508 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-01-31 21:16:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:12,509 INFO L225 Difference]: With dead ends: 187 [2022-01-31 21:16:12,509 INFO L226 Difference]: Without dead ends: 182 [2022-01-31 21:16:12,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=249, Invalid=1310, Unknown=1, NotChecked=0, Total=1560 [2022-01-31 21:16:12,510 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.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:12,510 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.2s Time] [2022-01-31 21:16:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-01-31 21:16:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2022-01-31 21:16:12,674 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-01-31 21:16:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 214 transitions. [2022-01-31 21:16:12,675 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 214 transitions. Word has length 40 [2022-01-31 21:16:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:12,675 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 214 transitions. [2022-01-31 21:16:12,675 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-01-31 21:16:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2022-01-31 21:16:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 21:16:12,676 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:12,676 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-01-31 21:16:12,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 21:16:12,676 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash -355872300, now seen corresponding path program 11 times [2022-01-31 21:16:12,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:12,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1075382168] [2022-01-31 21:16:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:12,700 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:12,701 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:12,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:12,704 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:12,720 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:16:13,189 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:13,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1075382168] [2022-01-31 21:16:13,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1075382168] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:13,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:13,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:16:13,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079789901] [2022-01-31 21:16:13,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:13,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:16:13,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:16:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:16:13,190 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-01-31 21:16:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:17,725 INFO L93 Difference]: Finished difference Result 598 states and 755 transitions. [2022-01-31 21:16:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-31 21:16:17,731 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-01-31 21:16:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:17,733 INFO L225 Difference]: With dead ends: 598 [2022-01-31 21:16:17,733 INFO L226 Difference]: Without dead ends: 458 [2022-01-31 21:16:17,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1904 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=687, Invalid=5955, Unknown=0, NotChecked=0, Total=6642 [2022-01-31 21:16:17,734 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-01-31 21:16:17,734 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-01-31 21:16:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-01-31 21:16:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 172. [2022-01-31 21:16:17,909 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-01-31 21:16:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 218 transitions. [2022-01-31 21:16:17,910 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 218 transitions. Word has length 40 [2022-01-31 21:16:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:17,910 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 218 transitions. [2022-01-31 21:16:17,910 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-01-31 21:16:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 218 transitions. [2022-01-31 21:16:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:16:17,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:17,911 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-01-31 21:16:17,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 21:16:17,911 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:17,911 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 23 times [2022-01-31 21:16:17,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:17,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1195183775] [2022-01-31 21:16:17,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:17,952 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:17,953 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:17,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:17,955 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:17,980 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-01-31 21:16:18,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:18,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-01-31 21:16:27,251 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 (forall ((v_it_43 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_43) c_main_~n~0) 4294967296)) (not (<= (+ 5 v_it_43) c_main_~y~0)) (not (<= 1 v_it_43)))) (= (+ c_main_~x~0 c_main_~y~0) c_main_~n~0) (< 0 (mod c_main_~n~0 4294967296)) (< 4 c_main_~y~0))) (< 0 (mod (+ c_main_~x~0 1) 4294967296)) (< 0 (mod (+ 3 c_main_~x~0) 4294967296)) (< 0 (mod .cse0 4294967296)) (< 0 (mod (+ 2 c_main_~x~0) 4294967296)))) is different from false [2022-01-31 21:16:45,021 WARN L228 SmtUtils]: Spent 8.86s 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-01-31 21:16:45,022 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:45,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1195183775] [2022-01-31 21:16:45,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1195183775] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:45,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:45,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:16:45,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789801376] [2022-01-31 21:16:45,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:45,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:16:45,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:45,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:16:45,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=623, Unknown=5, NotChecked=50, Total=756 [2022-01-31 21:16:45,023 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-01-31 21:17:20,490 WARN L228 SmtUtils]: Spent 8.90s on a formula simplification. DAG size of input: 61 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:17:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:34,515 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2022-01-31 21:17:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 21:17:34,515 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-01-31 21:17:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:34,516 INFO L225 Difference]: With dead ends: 189 [2022-01-31 21:17:34,516 INFO L226 Difference]: Without dead ends: 184 [2022-01-31 21:17:34,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 75.7s TimeCoverageRelationStatistics Valid=177, Invalid=1882, Unknown=15, NotChecked=88, Total=2162 [2022-01-31 21:17:34,517 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:34,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 107 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 445 Invalid, 0 Unknown, 142 Unchecked, 0.4s Time] [2022-01-31 21:17:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-01-31 21:17:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2022-01-31 21:17:34,698 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-01-31 21:17:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 218 transitions. [2022-01-31 21:17:34,698 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 218 transitions. Word has length 41 [2022-01-31 21:17:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:34,698 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 218 transitions. [2022-01-31 21:17:34,698 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-01-31 21:17:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 218 transitions. [2022-01-31 21:17:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:17:34,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:34,699 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-01-31 21:17:34,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 21:17:34,699 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:34,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:34,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1435666111, now seen corresponding path program 12 times [2022-01-31 21:17:34,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:34,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1508804200] [2022-01-31 21:17:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:34,743 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:34,743 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:34,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:34,746 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-01-31 21:17:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:34,757 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-01-31 21:17:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:17:35,333 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:35,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1508804200] [2022-01-31 21:17:35,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1508804200] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:35,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:35,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:17:35,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805853344] [2022-01-31 21:17:35,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:35,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:17:35,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:35,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:17:35,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:17:35,334 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-01-31 21:17:38,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:38,259 INFO L93 Difference]: Finished difference Result 396 states and 575 transitions. [2022-01-31 21:17:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:17:38,260 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-01-31 21:17:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:38,261 INFO L225 Difference]: With dead ends: 396 [2022-01-31 21:17:38,261 INFO L226 Difference]: Without dead ends: 374 [2022-01-31 21:17:38,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=483, Invalid=1679, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 21:17:38,262 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 214 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:38,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 83 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 21:17:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-01-31 21:17:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 186. [2022-01-31 21:17:38,468 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-01-31 21:17:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 238 transitions. [2022-01-31 21:17:38,469 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 238 transitions. Word has length 41 [2022-01-31 21:17:38,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:38,469 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 238 transitions. [2022-01-31 21:17:38,469 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-01-31 21:17:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 238 transitions. [2022-01-31 21:17:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:17:38,469 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:38,470 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-01-31 21:17:38,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 21:17:38,470 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash 410232754, now seen corresponding path program 24 times [2022-01-31 21:17:38,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:38,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1098598575] [2022-01-31 21:17:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:38,512 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:38,513 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:38,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:38,516 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-01-31 21:17:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:38,531 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-01-31 21:17:38,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:17:38,754 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:38,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1098598575] [2022-01-31 21:17:38,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1098598575] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:38,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:38,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:17:38,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218588993] [2022-01-31 21:17:38,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:38,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:17:38,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:38,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:17:38,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:17:38,755 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-01-31 21:17:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:40,789 INFO L93 Difference]: Finished difference Result 325 states and 401 transitions. [2022-01-31 21:17:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 21:17:40,789 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-01-31 21:17:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:40,790 INFO L225 Difference]: With dead ends: 325 [2022-01-31 21:17:40,790 INFO L226 Difference]: Without dead ends: 294 [2022-01-31 21:17:40,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=357, Invalid=1713, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 21:17:40,791 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:40,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 75 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:17:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-01-31 21:17:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 174. [2022-01-31 21:17:41,001 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-01-31 21:17:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 224 transitions. [2022-01-31 21:17:41,001 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 224 transitions. Word has length 42 [2022-01-31 21:17:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:41,002 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 224 transitions. [2022-01-31 21:17:41,002 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-01-31 21:17:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 224 transitions. [2022-01-31 21:17:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:17:41,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:41,002 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-01-31 21:17:41,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 21:17:41,002 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1049677711, now seen corresponding path program 13 times [2022-01-31 21:17:41,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:41,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1561201882] [2022-01-31 21:17:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:41,045 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:41,045 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:41,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:41,048 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-01-31 21:17:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:41,059 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-01-31 21:17:41,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:17:41,721 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:41,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1561201882] [2022-01-31 21:17:41,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1561201882] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:41,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:41,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:17:41,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337792435] [2022-01-31 21:17:41,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:41,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:17:41,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:41,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:17:41,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:17:41,722 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-01-31 21:17:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:45,147 INFO L93 Difference]: Finished difference Result 404 states and 587 transitions. [2022-01-31 21:17:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 21:17:45,147 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-01-31 21:17:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:45,149 INFO L225 Difference]: With dead ends: 404 [2022-01-31 21:17:45,149 INFO L226 Difference]: Without dead ends: 381 [2022-01-31 21:17:45,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 21:17:45,149 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 282 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:45,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 85 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:17:45,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-01-31 21:17:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 187. [2022-01-31 21:17:45,384 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-01-31 21:17:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 242 transitions. [2022-01-31 21:17:45,384 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 242 transitions. Word has length 42 [2022-01-31 21:17:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:45,384 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 242 transitions. [2022-01-31 21:17:45,385 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-01-31 21:17:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 242 transitions. [2022-01-31 21:17:45,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 21:17:45,385 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:45,385 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-01-31 21:17:45,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 21:17:45,385 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:45,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash -774755905, now seen corresponding path program 14 times [2022-01-31 21:17:45,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:45,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291976372] [2022-01-31 21:17:45,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:45,420 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:45,420 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:45,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:45,423 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-01-31 21:17:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:45,443 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-01-31 21:17:45,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:45,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-01-31 21:18:07,154 WARN L228 SmtUtils]: Spent 7.42s 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-01-31 21:18:23,382 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:23,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291976372] [2022-01-31 21:18:23,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [291976372] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:23,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:23,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:18:23,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127735624] [2022-01-31 21:18:23,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:23,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:18:23,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:23,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:18:23,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=614, Unknown=2, NotChecked=0, Total=756 [2022-01-31 21:18:23,384 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-01-31 21:18:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:24,296 INFO L93 Difference]: Finished difference Result 236 states and 316 transitions. [2022-01-31 21:18:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 21:18:24,296 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-01-31 21:18:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:24,297 INFO L225 Difference]: With dead ends: 236 [2022-01-31 21:18:24,297 INFO L226 Difference]: Without dead ends: 231 [2022-01-31 21:18:24,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=403, Invalid=2145, Unknown=2, NotChecked=0, Total=2550 [2022-01-31 21:18:24,298 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:24,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 54 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 321 Invalid, 0 Unknown, 10 Unchecked, 0.3s Time] [2022-01-31 21:18:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-01-31 21:18:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 211. [2022-01-31 21:18:24,570 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-01-31 21:18:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 275 transitions. [2022-01-31 21:18:24,570 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 275 transitions. Word has length 43 [2022-01-31 21:18:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:24,571 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 275 transitions. [2022-01-31 21:18:24,571 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-01-31 21:18:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 275 transitions. [2022-01-31 21:18:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:18:24,571 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:24,571 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-01-31 21:18:24,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 21:18:24,571 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash 919531266, now seen corresponding path program 25 times [2022-01-31 21:18:24,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:24,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1975134007] [2022-01-31 21:18:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:24,839 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:24,839 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:24,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:24,842 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-01-31 21:18:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:24,866 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-01-31 21:18:25,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:18:25,428 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:25,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1975134007] [2022-01-31 21:18:25,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1975134007] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:25,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:25,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:18:25,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923894550] [2022-01-31 21:18:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:25,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:18:25,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:25,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:18:25,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:18:25,430 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-01-31 21:18:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:28,294 INFO L93 Difference]: Finished difference Result 432 states and 529 transitions. [2022-01-31 21:18:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 21:18:28,294 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-01-31 21:18:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:28,295 INFO L225 Difference]: With dead ends: 432 [2022-01-31 21:18:28,295 INFO L226 Difference]: Without dead ends: 414 [2022-01-31 21:18:28,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=264, Invalid=1716, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 21:18:28,296 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:28,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 57 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 21:18:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-01-31 21:18:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 211. [2022-01-31 21:18:28,571 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-01-31 21:18:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 274 transitions. [2022-01-31 21:18:28,572 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 274 transitions. Word has length 44 [2022-01-31 21:18:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:28,572 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 274 transitions. [2022-01-31 21:18:28,572 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-01-31 21:18:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 274 transitions. [2022-01-31 21:18:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:18:28,573 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:28,573 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-01-31 21:18:28,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 21:18:28,573 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:28,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:28,573 INFO L85 PathProgramCache]: Analyzing trace with hash -107841918, now seen corresponding path program 15 times [2022-01-31 21:18:28,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:28,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [460189853] [2022-01-31 21:18:28,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:28,604 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:28,604 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:28,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:28,607 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-01-31 21:18:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:28,626 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-01-31 21:18:28,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:18:29,011 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:29,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [460189853] [2022-01-31 21:18:29,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [460189853] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:29,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:29,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:18:29,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862024221] [2022-01-31 21:18:29,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:29,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:18:29,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:29,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:18:29,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:18:29,012 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-01-31 21:18:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:35,123 INFO L93 Difference]: Finished difference Result 483 states and 598 transitions. [2022-01-31 21:18:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-31 21:18:35,123 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-01-31 21:18:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:35,124 INFO L225 Difference]: With dead ends: 483 [2022-01-31 21:18:35,124 INFO L226 Difference]: Without dead ends: 477 [2022-01-31 21:18:35,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1734 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=790, Invalid=5530, Unknown=0, NotChecked=0, Total=6320 [2022-01-31 21:18:35,125 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 110 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:35,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 84 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-31 21:18:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-01-31 21:18:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 233. [2022-01-31 21:18:35,409 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-01-31 21:18:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 307 transitions. [2022-01-31 21:18:35,410 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 307 transitions. Word has length 44 [2022-01-31 21:18:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:35,410 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 307 transitions. [2022-01-31 21:18:35,410 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-01-31 21:18:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 307 transitions. [2022-01-31 21:18:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:18:35,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:35,410 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-01-31 21:18:35,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 21:18:35,411 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:35,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1336668930, now seen corresponding path program 26 times [2022-01-31 21:18:35,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:35,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131712876] [2022-01-31 21:18:35,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:35,438 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:35,439 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:35,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:35,442 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-01-31 21:18:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:35,454 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-01-31 21:18:35,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:18:36,286 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:36,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131712876] [2022-01-31 21:18:36,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [131712876] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:36,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:36,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 21:18:36,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46873712] [2022-01-31 21:18:36,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:36,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 21:18:36,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:36,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 21:18:36,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:18:36,288 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-01-31 21:18:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:40,121 INFO L93 Difference]: Finished difference Result 550 states and 821 transitions. [2022-01-31 21:18:40,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 21:18:40,122 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-01-31 21:18:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:40,123 INFO L225 Difference]: With dead ends: 550 [2022-01-31 21:18:40,123 INFO L226 Difference]: Without dead ends: 527 [2022-01-31 21:18:40,123 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-01-31 21:18:40,124 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 283 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:40,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 85 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-31 21:18:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-01-31 21:18:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 250. [2022-01-31 21:18:40,448 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-01-31 21:18:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 331 transitions. [2022-01-31 21:18:40,449 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 331 transitions. Word has length 44 [2022-01-31 21:18:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:40,449 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 331 transitions. [2022-01-31 21:18:40,449 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-01-31 21:18:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 331 transitions. [2022-01-31 21:18:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 21:18:40,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:40,450 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-01-31 21:18:40,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 21:18:40,450 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:40,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash 986362945, now seen corresponding path program 27 times [2022-01-31 21:18:40,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:40,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1224376152] [2022-01-31 21:18:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:40,489 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:40,489 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:40,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:40,492 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-01-31 21:18:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:40,528 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-01-31 21:18:40,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:18:41,080 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:41,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1224376152] [2022-01-31 21:18:41,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1224376152] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:41,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:41,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:18:41,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731523169] [2022-01-31 21:18:41,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:41,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:18:41,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:41,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:18:41,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:18:41,081 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-01-31 21:18:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:51,175 INFO L93 Difference]: Finished difference Result 1045 states and 1295 transitions. [2022-01-31 21:18:51,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-01-31 21:18:51,175 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-01-31 21:18:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:51,177 INFO L225 Difference]: With dead ends: 1045 [2022-01-31 21:18:51,177 INFO L226 Difference]: Without dead ends: 823 [2022-01-31 21:18:51,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3139 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=982, Invalid=9320, Unknown=0, NotChecked=0, Total=10302 [2022-01-31 21:18:51,178 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:51,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 147 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-01-31 21:18:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-01-31 21:18:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 257. [2022-01-31 21:18:51,524 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-01-31 21:18:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 334 transitions. [2022-01-31 21:18:51,524 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 334 transitions. Word has length 45 [2022-01-31 21:18:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:51,524 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 334 transitions. [2022-01-31 21:18:51,525 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-01-31 21:18:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 334 transitions. [2022-01-31 21:18:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:18:51,525 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:51,525 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-01-31 21:18:51,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 21:18:51,525 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 284721058, now seen corresponding path program 28 times [2022-01-31 21:18:51,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:51,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1925833836] [2022-01-31 21:18:51,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:51,560 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:51,560 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:51,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:51,563 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-01-31 21:18:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:51,601 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-01-31 21:18:52,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:19:53,007 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:53,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1925833836] [2022-01-31 21:19:53,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1925833836] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:53,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:53,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-31 21:19:53,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812643534] [2022-01-31 21:19:53,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:53,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 21:19:53,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:53,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 21:19:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=821, Unknown=12, NotChecked=0, Total=930 [2022-01-31 21:19:53,008 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-01-31 21:19:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:59,224 INFO L93 Difference]: Finished difference Result 276 states and 352 transitions. [2022-01-31 21:19:59,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 21:19:59,224 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-01-31 21:19:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:59,225 INFO L225 Difference]: With dead ends: 276 [2022-01-31 21:19:59,225 INFO L226 Difference]: Without dead ends: 242 [2022-01-31 21:19:59,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 66.5s TimeCoverageRelationStatistics Valid=197, Invalid=2339, Unknown=14, NotChecked=0, Total=2550 [2022-01-31 21:19:59,225 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:59,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 113 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 537 Invalid, 0 Unknown, 36 Unchecked, 0.4s Time] [2022-01-31 21:19:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-01-31 21:19:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-01-31 21:19:59,554 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-01-31 21:19:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 317 transitions. [2022-01-31 21:19:59,555 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 317 transitions. Word has length 46 [2022-01-31 21:19:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:59,555 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 317 transitions. [2022-01-31 21:19:59,555 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-01-31 21:19:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 317 transitions. [2022-01-31 21:19:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:19:59,555 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:59,555 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-01-31 21:19:59,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 21:19:59,555 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:59,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2044791261, now seen corresponding path program 29 times [2022-01-31 21:19:59,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:59,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156462902] [2022-01-31 21:19:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:59,584 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:19:59,584 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:59,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:59,587 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-01-31 21:19:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:59,601 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-01-31 21:19:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:20:00,672 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:00,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156462902] [2022-01-31 21:20:00,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1156462902] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:00,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:00,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:20:00,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082265572] [2022-01-31 21:20:00,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:00,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:20:00,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:00,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:20:00,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:20:00,673 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-01-31 21:20:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:07,349 INFO L93 Difference]: Finished difference Result 594 states and 895 transitions. [2022-01-31 21:20:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 21:20:07,349 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-01-31 21:20:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:07,351 INFO L225 Difference]: With dead ends: 594 [2022-01-31 21:20:07,351 INFO L226 Difference]: Without dead ends: 571 [2022-01-31 21:20:07,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=651, Invalid=2429, Unknown=0, NotChecked=0, Total=3080 [2022-01-31 21:20:07,352 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 268 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:07,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 92 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 21:20:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-01-31 21:20:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 260. [2022-01-31 21:20:07,723 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-01-31 21:20:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 343 transitions. [2022-01-31 21:20:07,723 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 343 transitions. Word has length 46 [2022-01-31 21:20:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:07,723 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 343 transitions. [2022-01-31 21:20:07,723 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-01-31 21:20:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 343 transitions. [2022-01-31 21:20:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:20:07,724 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:07,724 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-01-31 21:20:07,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 21:20:07,724 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:07,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash -15117393, now seen corresponding path program 30 times [2022-01-31 21:20:07,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:07,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2140171] [2022-01-31 21:20:07,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:07,781 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:20:07,781 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:07,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:07,784 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-01-31 21:20:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:07,806 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-01-31 21:20:07,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:20:08,466 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:08,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2140171] [2022-01-31 21:20:08,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2140171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:08,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:08,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:20:08,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005866173] [2022-01-31 21:20:08,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:08,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:20:08,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:08,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:20:08,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:20:08,467 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-01-31 21:20:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:11,545 INFO L93 Difference]: Finished difference Result 546 states and 666 transitions. [2022-01-31 21:20:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 21:20:11,545 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-01-31 21:20:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:11,546 INFO L225 Difference]: With dead ends: 546 [2022-01-31 21:20:11,546 INFO L226 Difference]: Without dead ends: 519 [2022-01-31 21:20:11,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 21:20:11,547 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:11,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 64 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:20:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-01-31 21:20:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 243. [2022-01-31 21:20:11,883 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-01-31 21:20:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 316 transitions. [2022-01-31 21:20:11,884 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 316 transitions. Word has length 47 [2022-01-31 21:20:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:11,884 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 316 transitions. [2022-01-31 21:20:11,884 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-01-31 21:20:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 316 transitions. [2022-01-31 21:20:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:20:11,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:11,884 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-01-31 21:20:11,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 21:20:11,884 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:11,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1502985036, now seen corresponding path program 31 times [2022-01-31 21:20:11,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:11,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1681050492] [2022-01-31 21:20:11,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:11,913 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:20:11,913 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:11,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:11,916 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-01-31 21:20:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:11,942 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-01-31 21:20:12,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:20:40,080 WARN L838 $PredicateComparison]: unable to prove that (and (< 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)) (or (= (+ (- 6) c_main_~y~0) 0) (and (< 6 c_main_~y~0) (< 0 (mod (+ c_main_~x~0 c_main_~y~0) 4294967296)) (forall ((v_it_55 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_55) c_main_~x~0 c_main_~y~0) 4294967296)) (not (<= 1 v_it_55)) (not (<= (+ 7 v_it_55) c_main_~y~0))))))) is different from false [2022-01-31 21:21:03,664 WARN L228 SmtUtils]: Spent 11.13s 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-01-31 21:21:03,666 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:21:03,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1681050492] [2022-01-31 21:21:03,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1681050492] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:21:03,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:21:03,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-01-31 21:21:03,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413677074] [2022-01-31 21:21:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:21:03,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 21:21:03,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:21:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 21:21:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=765, Unknown=3, NotChecked=58, Total=992 [2022-01-31 21:21:03,667 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-01-31 21:21:24,510 WARN L228 SmtUtils]: Spent 17.69s on a formula simplification. DAG size of input: 63 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:22:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:01,479 INFO L93 Difference]: Finished difference Result 266 states and 353 transitions. [2022-01-31 21:22:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 21:22:01,479 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-01-31 21:22:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:01,480 INFO L225 Difference]: With dead ends: 266 [2022-01-31 21:22:01,480 INFO L226 Difference]: Without dead ends: 261 [2022-01-31 21:22:01,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 108.6s TimeCoverageRelationStatistics Valid=506, Invalid=2800, Unknown=4, NotChecked=112, Total=3422 [2022-01-31 21:22:01,481 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:01,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 79 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 372 Invalid, 0 Unknown, 142 Unchecked, 0.3s Time] [2022-01-31 21:22:01,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-01-31 21:22:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 247. [2022-01-31 21:22:01,853 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-01-31 21:22:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 318 transitions. [2022-01-31 21:22:01,853 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 318 transitions. Word has length 48 [2022-01-31 21:22:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:01,854 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 318 transitions. [2022-01-31 21:22:01,854 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-01-31 21:22:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 318 transitions. [2022-01-31 21:22:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:22:01,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:01,854 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-01-31 21:22:01,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 21:22:01,854 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash 755437972, now seen corresponding path program 16 times [2022-01-31 21:22:01,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:01,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1089135584] [2022-01-31 21:22:01,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:01,882 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:01,882 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:01,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:01,885 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-01-31 21:22:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:01,910 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-01-31 21:22:02,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:02,676 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:02,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1089135584] [2022-01-31 21:22:02,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1089135584] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:02,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:02,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:22:02,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844953307] [2022-01-31 21:22:02,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:02,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:22:02,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:02,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:22:02,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:22:02,678 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-01-31 21:22:06,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:22:16,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:16,087 INFO L93 Difference]: Finished difference Result 611 states and 742 transitions. [2022-01-31 21:22:16,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-31 21:22:16,087 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-01-31 21:22:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:16,089 INFO L225 Difference]: With dead ends: 611 [2022-01-31 21:22:16,089 INFO L226 Difference]: Without dead ends: 605 [2022-01-31 21:22:16,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2507 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1032, Invalid=7710, Unknown=0, NotChecked=0, Total=8742 [2022-01-31 21:22:16,090 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 102 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:16,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 94 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-01-31 21:22:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-01-31 21:22:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 270. [2022-01-31 21:22:16,486 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-01-31 21:22:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 353 transitions. [2022-01-31 21:22:16,487 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 353 transitions. Word has length 48 [2022-01-31 21:22:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:16,487 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 353 transitions. [2022-01-31 21:22:16,487 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-01-31 21:22:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 353 transitions. [2022-01-31 21:22:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:22:16,488 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:16,488 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-01-31 21:22:16,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-31 21:22:16,488 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:16,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:16,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1247890577, now seen corresponding path program 32 times [2022-01-31 21:22:16,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:16,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330347312] [2022-01-31 21:22:16,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:16,530 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:16,531 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:16,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:16,534 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-01-31 21:22:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:16,557 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-01-31 21:22:16,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:17,159 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:17,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1330347312] [2022-01-31 21:22:17,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1330347312] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:17,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:17,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 21:22:17,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56105391] [2022-01-31 21:22:17,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:17,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 21:22:17,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:17,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 21:22:17,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:22:17,160 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-01-31 21:22:20,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:20,541 INFO L93 Difference]: Finished difference Result 558 states and 678 transitions. [2022-01-31 21:22:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 21:22:20,542 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-01-31 21:22:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:20,543 INFO L225 Difference]: With dead ends: 558 [2022-01-31 21:22:20,543 INFO L226 Difference]: Without dead ends: 530 [2022-01-31 21:22:20,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=386, Invalid=1870, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 21:22:20,544 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 47 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:20,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 64 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 21:22:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-01-31 21:22:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 253. [2022-01-31 21:22:20,900 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-01-31 21:22:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 326 transitions. [2022-01-31 21:22:20,901 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 326 transitions. Word has length 49 [2022-01-31 21:22:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:20,901 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 326 transitions. [2022-01-31 21:22:20,901 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-01-31 21:22:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 326 transitions. [2022-01-31 21:22:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:22:20,902 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:20,902 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-01-31 21:22:20,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-31 21:22:20,902 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:20,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:20,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1978235759, now seen corresponding path program 33 times [2022-01-31 21:22:20,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:20,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [615909661] [2022-01-31 21:22:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:20,929 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:20,929 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:20,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:20,932 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-01-31 21:22:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:20,964 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-01-31 21:22:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:21,698 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:21,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [615909661] [2022-01-31 21:22:21,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [615909661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:21,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:21,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:22:21,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087393850] [2022-01-31 21:22:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:21,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:22:21,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:21,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:22:21,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:22:21,699 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-01-31 21:22:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:32,004 INFO L93 Difference]: Finished difference Result 625 states and 764 transitions. [2022-01-31 21:22:32,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-01-31 21:22:32,005 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-01-31 21:22:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:32,006 INFO L225 Difference]: With dead ends: 625 [2022-01-31 21:22:32,006 INFO L226 Difference]: Without dead ends: 619 [2022-01-31 21:22:32,007 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-01-31 21:22:32,007 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 106 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:32,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 91 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-01-31 21:22:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-01-31 21:22:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 280. [2022-01-31 21:22:32,411 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-01-31 21:22:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 363 transitions. [2022-01-31 21:22:32,411 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 363 transitions. Word has length 49 [2022-01-31 21:22:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:32,412 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 363 transitions. [2022-01-31 21:22:32,412 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-01-31 21:22:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 363 transitions. [2022-01-31 21:22:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:22:32,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:32,412 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-01-31 21:22:32,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-31 21:22:32,413 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:32,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:32,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1773069292, now seen corresponding path program 34 times [2022-01-31 21:22:32,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:32,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [684973614] [2022-01-31 21:22:32,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:32,439 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:32,439 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:32,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:32,442 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-01-31 21:22:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:32,470 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-01-31 21:22:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:32,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-01-31 21:22:33,461 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:33,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [684973614] [2022-01-31 21:22:33,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [684973614] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:33,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:33,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 21:22:33,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983550708] [2022-01-31 21:22:33,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:33,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 21:22:33,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:33,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 21:22:33,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:22:33,462 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-01-31 21:22:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:52,656 INFO L93 Difference]: Finished difference Result 1250 states and 1525 transitions. [2022-01-31 21:22:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-01-31 21:22:52,656 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-01-31 21:22:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:52,659 INFO L225 Difference]: With dead ends: 1250 [2022-01-31 21:22:52,659 INFO L226 Difference]: Without dead ends: 1001 [2022-01-31 21:22:52,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4902 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1353, Invalid=13899, Unknown=0, NotChecked=0, Total=15252 [2022-01-31 21:22:52,670 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 127 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:52,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 137 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-01-31 21:22:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-01-31 21:22:53,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 287. [2022-01-31 21:22:53,094 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-01-31 21:22:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 365 transitions. [2022-01-31 21:22:53,094 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 365 transitions. Word has length 50 [2022-01-31 21:22:53,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:53,095 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 365 transitions. [2022-01-31 21:22:53,095 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-01-31 21:22:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 365 transitions. [2022-01-31 21:22:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:22:53,100 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:53,100 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-01-31 21:22:53,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 21:22:53,100 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:53,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:53,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1540323473, now seen corresponding path program 35 times [2022-01-31 21:22:53,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:53,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1062150414] [2022-01-31 21:22:53,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:53,129 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:53,130 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:53,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:53,133 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-01-31 21:22:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:53,176 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-01-31 21:22:54,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:23:49,229 WARN L228 SmtUtils]: Spent 5.64s 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-01-31 21:24:35,326 WARN L228 SmtUtils]: Spent 13.79s 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-01-31 21:25:07,754 WARN L228 SmtUtils]: Spent 11.33s 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-01-31 21:25:07,755 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:25:07,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1062150414] [2022-01-31 21:25:07,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1062150414] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:25:07,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:25:07,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 21:25:07,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248791443] [2022-01-31 21:25:07,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:25:07,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 21:25:07,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:25:07,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 21:25:07,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=998, Unknown=15, NotChecked=0, Total=1122 [2022-01-31 21:25:07,756 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-01-31 21:25:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:13,597 INFO L93 Difference]: Finished difference Result 654 states and 784 transitions. [2022-01-31 21:25:13,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 21:25:13,597 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-01-31 21:25:13,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:13,599 INFO L225 Difference]: With dead ends: 654 [2022-01-31 21:25:13,599 INFO L226 Difference]: Without dead ends: 599 [2022-01-31 21:25:13,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 137.1s TimeCoverageRelationStatistics Valid=221, Invalid=2844, Unknown=15, NotChecked=0, Total=3080 [2022-01-31 21:25:13,599 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:13,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 142 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 991 Invalid, 0 Unknown, 51 Unchecked, 1.5s Time] [2022-01-31 21:25:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-31 21:25:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 291. [2022-01-31 21:25:14,165 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-01-31 21:25:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 357 transitions. [2022-01-31 21:25:14,166 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 357 transitions. Word has length 51 [2022-01-31 21:25:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:14,166 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 357 transitions. [2022-01-31 21:25:14,166 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-01-31 21:25:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 357 transitions. [2022-01-31 21:25:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:25:14,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:14,168 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-01-31 21:25:14,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-31 21:25:14,168 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:14,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2100347007, now seen corresponding path program 36 times [2022-01-31 21:25:14,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:14,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [492414743] [2022-01-31 21:25:14,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:14,202 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:14,202 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:25:14,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:14,205 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-01-31 21:25:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:14,233 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-01-31 21:25:14,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:25:15,897 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:25:15,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [492414743] [2022-01-31 21:25:15,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [492414743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:25:15,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:25:15,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 21:25:15,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655362838] [2022-01-31 21:25:15,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:25:15,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 21:25:15,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:25:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 21:25:15,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:25:15,898 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-01-31 21:25:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:36,311 INFO L93 Difference]: Finished difference Result 926 states and 1083 transitions. [2022-01-31 21:25:36,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-31 21:25:36,312 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-01-31 21:25:36,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:36,313 INFO L225 Difference]: With dead ends: 926 [2022-01-31 21:25:36,313 INFO L226 Difference]: Without dead ends: 669 [2022-01-31 21:25:36,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2369 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=887, Invalid=8233, Unknown=0, NotChecked=0, Total=9120 [2022-01-31 21:25:36,314 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 78 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:36,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 140 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-01-31 21:25:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-01-31 21:25:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 300. [2022-01-31 21:25:36,881 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-01-31 21:25:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 361 transitions. [2022-01-31 21:25:36,882 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 361 transitions. Word has length 53 [2022-01-31 21:25:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:36,882 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 361 transitions. [2022-01-31 21:25:36,882 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-01-31 21:25:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 361 transitions. [2022-01-31 21:25:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:25:36,883 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:36,883 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-01-31 21:25:36,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-31 21:25:36,883 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:36,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1945484158, now seen corresponding path program 37 times [2022-01-31 21:25:36,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:36,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [311410516] [2022-01-31 21:25:36,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:36,921 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:36,921 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:25:36,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:36,927 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-01-31 21:25:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:36,976 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-01-31 21:25:37,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:25:43,205 WARN L228 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:25:51,342 WARN L228 SmtUtils]: Spent 7.17s 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-01-31 21:26:20,271 WARN L228 SmtUtils]: Spent 6.61s 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-01-31 21:26:51,053 WARN L228 SmtUtils]: Spent 18.63s 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-01-31 21:27:15,877 WARN L228 SmtUtils]: Spent 8.11s 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-01-31 21:27:46,248 WARN L228 SmtUtils]: Spent 11.82s 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-01-31 21:27:46,249 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:27:46,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [311410516] [2022-01-31 21:27:46,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [311410516] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:27:46,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:27:46,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-31 21:27:46,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020031504] [2022-01-31 21:27:46,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:27:46,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 21:27:46,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:27:46,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 21:27:46,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=970, Unknown=8, NotChecked=0, Total=1122 [2022-01-31 21:27:46,250 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-01-31 21:28:10,990 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 c_main_~x~0))) (and (= |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 (+ 5 c_main_~x~0) 4294967296)) (< 0 (mod (+ 6 c_main_~x~0) 4294967296)) (< 0 (mod (+ 4 c_main_~x~0) 4294967296)) (or (and (= 0 (+ c_main_~y~0 (- 8))) (= .cse0 c_main_~n~0)) (and (< .cse0 c_main_~n~0) (= (+ 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 (<= (+ 9 v_it_62 c_main_~x~0) c_main_~n~0)) (not (<= 1 v_it_62)) (< 0 (mod (+ (* 4294967295 v_it_62) c_main_~n~0) 4294967296)))))) (< 0 (mod (+ 2 c_main_~x~0) 4294967296)) (< 0 (mod .cse0 4294967296)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< 0 (mod (+ 7 c_main_~x~0) 4294967296)))) is different from false