/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-de62.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:16:47,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:16:47,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:16:47,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:16:47,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:16:47,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:16:47,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:16:47,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:16:47,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:16:47,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:16:47,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:16:47,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:16:47,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:16:47,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:16:47,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:16:47,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:16:47,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:16:47,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:16:47,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:16:47,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:16:47,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:16:47,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:16:47,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:16:47,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:16:47,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:16:47,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:16:47,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:16:47,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:16:47,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:16:47,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:16:47,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:16:47,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:16:47,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:16:47,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:16:47,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:16:47,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:16:47,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:16:47,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:16:47,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:16:47,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:16:47,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:16:47,454 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:16:47,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:16:47,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:16:47,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:16:47,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:16:47,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:16:47,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:16:47,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:16:47,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:16:47,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:16:47,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:16:47,461 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:16:47,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:16:47,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:16:47,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:16:47,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:16:47,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:16:47,462 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:16:47,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:16:47,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:16:47,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:16:47,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:16:47,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:16:47,463 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:16:47,463 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:16:47,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:16:47,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:16:47,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:16:47,635 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:16:47,636 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:16:47,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-01-31 21:16:47,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac6fcfa78/f46b5320c954430194f721942db6dff6/FLAG175706646 [2022-01-31 21:16:48,038 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:16:48,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-01-31 21:16:48,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac6fcfa78/f46b5320c954430194f721942db6dff6/FLAG175706646 [2022-01-31 21:16:48,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac6fcfa78/f46b5320c954430194f721942db6dff6 [2022-01-31 21:16:48,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:16:48,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:16:48,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:16:48,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:16:48,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:16:48,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:16:48" (1/1) ... [2022-01-31 21:16:48,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae8af48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:48, skipping insertion in model container [2022-01-31 21:16:48,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:16:48" (1/1) ... [2022-01-31 21:16:48,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:16:48,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:16:48,165 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-de62.c[368,381] [2022-01-31 21:16:48,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:16:48,188 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:16:48,201 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-de62.c[368,381] [2022-01-31 21:16:48,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:16:48,217 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:16:48,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:48 WrapperNode [2022-01-31 21:16:48,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:16:48,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:16:48,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:16:48,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:16:48,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:48" (1/1) ... [2022-01-31 21:16:48,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:48" (1/1) ... [2022-01-31 21:16:48,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:48" (1/1) ... [2022-01-31 21:16:48,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:48" (1/1) ... [2022-01-31 21:16:48,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:48" (1/1) ... [2022-01-31 21:16:48,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:48" (1/1) ... [2022-01-31 21:16:48,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:48" (1/1) ... [2022-01-31 21:16:48,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:16:48,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:16:48,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:16:48,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:16:48,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:48" (1/1) ... [2022-01-31 21:16:48,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:16:48,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:16:48,276 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:16:48,304 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:16:48,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:16:48,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:16:48,319 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:16:48,319 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 21:16:48,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:16:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:16:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:16:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:16:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:16:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 21:16:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 21:16:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:16:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:16:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:16:48,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:16:48,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:16:48,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:16:48,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:16:48,371 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:16:48,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:16:48,451 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:16:48,455 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:16:48,455 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-31 21:16:48,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:16:48 BoogieIcfgContainer [2022-01-31 21:16:48,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:16:48,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:16:48,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:16:48,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:16:48,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:16:48" (1/3) ... [2022-01-31 21:16:48,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1577f689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:16:48, skipping insertion in model container [2022-01-31 21:16:48,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:48" (2/3) ... [2022-01-31 21:16:48,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1577f689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:16:48, skipping insertion in model container [2022-01-31 21:16:48,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:16:48" (3/3) ... [2022-01-31 21:16:48,476 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de62.c [2022-01-31 21:16:48,480 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:16:48,480 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:16:48,519 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:16:48,531 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:16:48,531 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:16:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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:16:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:16:48,562 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:48,562 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:16:48,562 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-01-31 21:16:48,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:48,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1053739895] [2022-01-31 21:16:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:48,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:48,613 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:16:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:48,737 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:48,738 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:48,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1053739895] [2022-01-31 21:16:48,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1053739895] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:48,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:48,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 21:16:48,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565204796] [2022-01-31 21:16:48,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:48,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 21:16:48,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:48,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 21:16:48,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 21:16:48,795 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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.333333333333333) internal successors, (13), 2 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:16:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:48,821 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-01-31 21:16:48,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 21:16:48,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:16:48,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:48,826 INFO L225 Difference]: With dead ends: 43 [2022-01-31 21:16:48,827 INFO L226 Difference]: Without dead ends: 18 [2022-01-31 21:16:48,828 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:16:48,831 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 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:16:48,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-31 21:16:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-31 21:16:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:16:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-01-31 21:16:48,852 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-01-31 21:16:48,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:48,853 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-01-31 21:16:48,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:16:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-01-31 21:16:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:16:48,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:48,854 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:16:48,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:16:48,854 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:48,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-01-31 21:16:48,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:48,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [727672637] [2022-01-31 21:16:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:48,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:48,857 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:16:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:48,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:16:48,988 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:48,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [727672637] [2022-01-31 21:16:48,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [727672637] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:48,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:48,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:16:48,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656169748] [2022-01-31 21:16:48,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:48,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:16:48,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:48,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:16:48,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:16:48,991 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:16:49,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:49,093 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-01-31 21:16:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:16:49,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:16:49,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:49,094 INFO L225 Difference]: With dead ends: 34 [2022-01-31 21:16:49,094 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 21:16:49,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:16:49,096 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:49,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:49,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 21:16:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-31 21:16:49,103 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:16:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-01-31 21:16:49,103 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 17 [2022-01-31 21:16:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:49,104 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-01-31 21:16:49,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:16:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-01-31 21:16:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:16:49,104 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:49,104 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:16:49,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:16:49,105 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:49,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1181238037, now seen corresponding path program 1 times [2022-01-31 21:16:49,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:49,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [829202360] [2022-01-31 21:16:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:49,445 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:49,446 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:49,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:49,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:49,498 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:49,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:16:49,685 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:49,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [829202360] [2022-01-31 21:16:49,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [829202360] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:49,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:49,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:16:49,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319173074] [2022-01-31 21:16:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:49,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:16:49,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:49,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:16:49,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:16:49,687 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.0) 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:16:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:49,790 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-01-31 21:16:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:16:49,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) 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:16:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:49,794 INFO L225 Difference]: With dead ends: 31 [2022-01-31 21:16:49,794 INFO L226 Difference]: Without dead ends: 24 [2022-01-31 21:16:49,794 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:16:49,797 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:49,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-31 21:16:49,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-31 21:16:49,802 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:16:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-01-31 21:16:49,802 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 18 [2022-01-31 21:16:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:49,802 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-01-31 21:16:49,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) 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:16:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-01-31 21:16:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:16:49,803 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:49,803 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:16:49,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:16:49,803 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1710900860, now seen corresponding path program 1 times [2022-01-31 21:16:49,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:49,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2025916714] [2022-01-31 21:16:49,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:49,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:16:49,839 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:49,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:49,846 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:49,868 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:49,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:49,938 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:50,003 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:50,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2025916714] [2022-01-31 21:16:50,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2025916714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:50,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:50,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:16:50,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483866956] [2022-01-31 21:16:50,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:50,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:16:50,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:50,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:16:50,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:16:50,005 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.0) 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:16:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:50,078 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-01-31 21:16:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:16:50,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) 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:16:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:50,080 INFO L225 Difference]: With dead ends: 34 [2022-01-31 21:16:50,080 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 21:16:50,081 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:16:50,087 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:50,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 35 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 21:16:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 21:16:50,098 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:16:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-01-31 21:16:50,101 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 18 [2022-01-31 21:16:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:50,101 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-01-31 21:16:50,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) 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:16:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-01-31 21:16:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 21:16:50,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:50,103 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:16:50,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:16:50,103 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1066409433, now seen corresponding path program 1 times [2022-01-31 21:16:50,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:50,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [450691668] [2022-01-31 21:16:50,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:50,169 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:50,170 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:50,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:50,175 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:50,211 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:50,265 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:50,277 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:50,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [450691668] [2022-01-31 21:16:50,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [450691668] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:50,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:50,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:16:50,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996171025] [2022-01-31 21:16:50,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:50,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:16:50,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:50,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:16:50,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:16:50,279 INFO L87 Difference]: Start difference. First operand 25 states and 33 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:16:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:50,337 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-01-31 21:16:50,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:16:50,338 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:16:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:50,338 INFO L225 Difference]: With dead ends: 44 [2022-01-31 21:16:50,338 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 21:16:50,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:16:50,339 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:50,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 21:16:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 21:16:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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:16:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-01-31 21:16:50,343 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2022-01-31 21:16:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:50,344 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-01-31 21:16:50,344 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:16:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-01-31 21:16:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:16:50,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:50,344 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:16:50,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:16:50,345 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:50,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1300031754, now seen corresponding path program 1 times [2022-01-31 21:16:50,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:50,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [405156723] [2022-01-31 21:16:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:50,379 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:50,379 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:50,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:50,385 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:16:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:50,394 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:16:50,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:50,421 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:50,443 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:50,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [405156723] [2022-01-31 21:16:50,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [405156723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:50,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:50,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:16:50,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463257378] [2022-01-31 21:16:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:50,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:16:50,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:50,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:16:50,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:16:50,445 INFO L87 Difference]: Start difference. First operand 26 states and 34 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:16:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:50,507 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-01-31 21:16:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:16:50,507 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:16:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:50,507 INFO L225 Difference]: With dead ends: 34 [2022-01-31 21:16:50,507 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 21:16:50,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 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:16:50,508 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:50,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 30 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 21:16:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-01-31 21:16:50,511 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:16:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-01-31 21:16:50,512 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 20 [2022-01-31 21:16:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:50,512 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-01-31 21:16:50,512 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:16:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-01-31 21:16:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:16:50,512 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:50,512 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:16:50,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:16:50,513 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:50,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash 552879990, now seen corresponding path program 1 times [2022-01-31 21:16:50,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:50,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1004200707] [2022-01-31 21:16:50,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:50,548 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:50,548 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:50,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:50,553 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:16:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:50,557 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:16:50,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:50,571 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:50,611 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:50,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1004200707] [2022-01-31 21:16:50,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1004200707] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:50,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:50,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:16:50,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99257937] [2022-01-31 21:16:50,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:50,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:16:50,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:50,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:16:50,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:16:50,612 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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:16:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:50,673 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-01-31 21:16:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:16:50,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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:16:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:50,674 INFO L225 Difference]: With dead ends: 33 [2022-01-31 21:16:50,674 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 21:16:50,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:16:50,674 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:50,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 28 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 21:16:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 21:16:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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:16:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-01-31 21:16:50,678 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 20 [2022-01-31 21:16:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:50,679 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-01-31 21:16:50,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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:16:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-01-31 21:16:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:16:50,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:50,679 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:16:50,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:16:50,679 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1955708389, now seen corresponding path program 1 times [2022-01-31 21:16:50,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:50,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [248390680] [2022-01-31 21:16:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:50,727 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:50,727 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:50,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:50,732 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:16:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:50,736 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:16:50,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:50,749 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:50,764 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:50,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [248390680] [2022-01-31 21:16:50,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [248390680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:50,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:50,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:16:50,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015281413] [2022-01-31 21:16:50,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:50,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:16:50,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:50,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:16:50,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:16:50,765 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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:16:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:50,822 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-01-31 21:16:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:16:50,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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:16:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:50,823 INFO L225 Difference]: With dead ends: 40 [2022-01-31 21:16:50,823 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 21:16:50,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:16:50,824 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:50,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 29 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 21:16:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-31 21:16:50,828 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:16:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-01-31 21:16:50,828 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2022-01-31 21:16:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:50,828 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-01-31 21:16:50,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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:16:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-01-31 21:16:50,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 21:16:50,829 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:50,829 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:16:50,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:16:50,829 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:50,829 INFO L85 PathProgramCache]: Analyzing trace with hash 30273528, now seen corresponding path program 1 times [2022-01-31 21:16:50,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:50,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592824402] [2022-01-31 21:16:50,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:50,862 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:50,862 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:50,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:50,866 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:16:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:50,872 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:16:50,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:50,898 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:50,907 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:50,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592824402] [2022-01-31 21:16:50,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1592824402] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:50,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:50,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:16:50,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672458433] [2022-01-31 21:16:50,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:50,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:16:50,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:50,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:16:50,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:16:50,909 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:16:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:50,974 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-01-31 21:16:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:16:50,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:16:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:50,975 INFO L225 Difference]: With dead ends: 37 [2022-01-31 21:16:50,975 INFO L226 Difference]: Without dead ends: 27 [2022-01-31 21:16:50,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:16:50,975 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:50,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 35 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-31 21:16:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-31 21:16:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:16:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-01-31 21:16:50,979 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 21 [2022-01-31 21:16:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:50,979 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-01-31 21:16:50,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:16:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-01-31 21:16:50,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 21:16:50,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:50,980 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:16:50,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:16:50,980 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:50,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:50,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1232820840, now seen corresponding path program 1 times [2022-01-31 21:16:50,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:50,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1010414004] [2022-01-31 21:16:50,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:51,008 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:51,008 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:51,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:51,012 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:16:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:51,022 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:16:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:51,044 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:51,053 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:51,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1010414004] [2022-01-31 21:16:51,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1010414004] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:51,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:51,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:16:51,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862205059] [2022-01-31 21:16:51,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:51,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:16:51,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:51,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:16:51,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:16:51,055 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:16:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:51,159 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-01-31 21:16:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:16:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:16:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:51,161 INFO L225 Difference]: With dead ends: 55 [2022-01-31 21:16:51,161 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 21:16:51,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 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:16:51,162 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:51,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 37 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 21:16:51,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2022-01-31 21:16:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:16:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-01-31 21:16:51,178 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2022-01-31 21:16:51,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:51,178 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-01-31 21:16:51,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:16:51,179 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-01-31 21:16:51,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 21:16:51,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:51,182 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, 1] [2022-01-31 21:16:51,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:16:51,182 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:51,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:51,182 INFO L85 PathProgramCache]: Analyzing trace with hash -29884763, now seen corresponding path program 1 times [2022-01-31 21:16:51,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:51,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059887068] [2022-01-31 21:16:51,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:51,219 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:51,221 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:51,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:51,227 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:16:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:51,243 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:51,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:51,266 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:51,277 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:51,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059887068] [2022-01-31 21:16:51,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2059887068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:51,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:51,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:16:51,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905517259] [2022-01-31 21:16:51,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:51,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:16:51,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:51,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:16:51,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:16:51,278 INFO L87 Difference]: Start difference. First operand 32 states and 43 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:16:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:51,365 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-01-31 21:16:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:16:51,365 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:16:51,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:51,366 INFO L225 Difference]: With dead ends: 46 [2022-01-31 21:16:51,366 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 21:16:51,366 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:16:51,366 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:51,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 21:16:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-01-31 21:16:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:16:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2022-01-31 21:16:51,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 22 [2022-01-31 21:16:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:51,374 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2022-01-31 21:16:51,374 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:16:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-01-31 21:16:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 21:16:51,374 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:51,374 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, 1] [2022-01-31 21:16:51,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:16:51,374 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:51,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1372943636, now seen corresponding path program 1 times [2022-01-31 21:16:51,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:51,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1075932506] [2022-01-31 21:16:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:51,408 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:51,408 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:51,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:51,411 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:16:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:51,421 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:16:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:51,513 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:51,945 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:51,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1075932506] [2022-01-31 21:16:51,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1075932506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:51,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:51,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:16:51,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634366292] [2022-01-31 21:16:51,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:51,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:16:51,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:51,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:16:51,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:16:51,946 INFO L87 Difference]: Start difference. First operand 38 states and 53 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:16:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:52,106 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-01-31 21:16:52,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:16:52,107 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 22 [2022-01-31 21:16:52,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:52,107 INFO L225 Difference]: With dead ends: 51 [2022-01-31 21:16:52,107 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 21:16:52,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:16:52,108 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:52,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 40 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 78 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-01-31 21:16:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 21:16:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2022-01-31 21:16:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call 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:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2022-01-31 21:16:52,117 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 22 [2022-01-31 21:16:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:52,117 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2022-01-31 21:16:52,117 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:16:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2022-01-31 21:16:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:16:52,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:52,117 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, 1, 1] [2022-01-31 21:16:52,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:16:52,117 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:52,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 1 times [2022-01-31 21:16:52,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:52,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1656184361] [2022-01-31 21:16:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:52,381 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:52,381 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:52,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:52,385 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:16:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:52,393 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:52,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:52,432 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:52,447 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:52,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1656184361] [2022-01-31 21:16:52,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1656184361] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:52,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:52,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:16:52,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114074939] [2022-01-31 21:16:52,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:52,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:16:52,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:52,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:16:52,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:16:52,448 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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:16:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:52,570 INFO L93 Difference]: Finished difference Result 81 states and 117 transitions. [2022-01-31 21:16:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:16:52,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 21:16:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:52,571 INFO L225 Difference]: With dead ends: 81 [2022-01-31 21:16:52,571 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 21:16:52,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:16:52,572 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 48 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:52,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 41 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 21:16:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-01-31 21:16:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call 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:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2022-01-31 21:16:52,583 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 23 [2022-01-31 21:16:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:52,584 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2022-01-31 21:16:52,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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:16:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2022-01-31 21:16:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:16:52,584 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:52,584 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, 1] [2022-01-31 21:16:52,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:16:52,584 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1894791784, now seen corresponding path program 2 times [2022-01-31 21:16:52,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:52,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [438587507] [2022-01-31 21:16:52,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:52,617 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:52,617 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:52,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:52,620 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:16:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:52,631 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:16:52,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:52,728 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:53,020 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:53,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [438587507] [2022-01-31 21:16:53,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [438587507] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:53,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:53,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:16:53,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158606150] [2022-01-31 21:16:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:53,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:16:53,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:53,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:16:53,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:16:53,022 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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:17:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:00,270 INFO L93 Difference]: Finished difference Result 94 states and 139 transitions. [2022-01-31 21:17:00,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:17:00,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 21:17:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:00,271 INFO L225 Difference]: With dead ends: 94 [2022-01-31 21:17:00,271 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 21:17:00,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=101, Invalid=277, Unknown=2, NotChecked=0, Total=380 [2022-01-31 21:17:00,272 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 47 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:00,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 54 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 85 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-01-31 21:17:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 21:17:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2022-01-31 21:17:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 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:17:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2022-01-31 21:17:00,284 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 23 [2022-01-31 21:17:00,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:00,284 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2022-01-31 21:17:00,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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:17:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2022-01-31 21:17:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:17:00,285 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:00,285 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:00,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:17:00,285 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:00,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1015896408, now seen corresponding path program 2 times [2022-01-31 21:17:00,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:00,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [322802353] [2022-01-31 21:17:00,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:00,319 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:00,319 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:00,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:00,322 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:17:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:00,330 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:17:00,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:00,367 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:00,382 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:00,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [322802353] [2022-01-31 21:17:00,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [322802353] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:00,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:00,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:17:00,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922691394] [2022-01-31 21:17:00,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:00,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:17:00,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:00,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:17:00,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:17:00,383 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:00,604 INFO L93 Difference]: Finished difference Result 136 states and 202 transitions. [2022-01-31 21:17:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:17:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 21:17:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:00,605 INFO L225 Difference]: With dead ends: 136 [2022-01-31 21:17:00,605 INFO L226 Difference]: Without dead ends: 114 [2022-01-31 21:17:00,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:17:00,606 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:00,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 46 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:17:00,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-31 21:17:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 76. [2022-01-31 21:17:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 71 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 107 transitions. [2022-01-31 21:17:00,625 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 107 transitions. Word has length 23 [2022-01-31 21:17:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:00,625 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 107 transitions. [2022-01-31 21:17:00,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 107 transitions. [2022-01-31 21:17:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 21:17:00,626 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:00,626 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, 1, 1] [2022-01-31 21:17:00,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:17:00,627 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:00,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:00,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1809241787, now seen corresponding path program 2 times [2022-01-31 21:17:00,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:00,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1741736860] [2022-01-31 21:17:00,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:00,672 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:00,672 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:00,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:00,675 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:17:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:00,692 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:17:00,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:00,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:17:00,731 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:00,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1741736860] [2022-01-31 21:17:00,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1741736860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:00,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:00,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:17:00,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304016018] [2022-01-31 21:17:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:00,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:17:00,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:00,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:17:00,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:17:00,732 INFO L87 Difference]: Start difference. First operand 76 states and 107 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:17:00,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:00,825 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-01-31 21:17:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:17:00,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-01-31 21:17:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:00,827 INFO L225 Difference]: With dead ends: 93 [2022-01-31 21:17:00,827 INFO L226 Difference]: Without dead ends: 76 [2022-01-31 21:17:00,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 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:17:00,828 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:00,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 35 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:17:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-01-31 21:17:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-01-31 21:17:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call 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:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2022-01-31 21:17:00,848 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 24 [2022-01-31 21:17:00,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:00,849 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2022-01-31 21:17:00,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:17:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2022-01-31 21:17:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 21:17:00,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:00,849 INFO L514 BasicCegarLoop]: trace histogram [2, 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:17:00,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:17:00,849 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:00,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1372842806, now seen corresponding path program 2 times [2022-01-31 21:17:00,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:00,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2072716410] [2022-01-31 21:17:00,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:00,884 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:00,884 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:00,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:00,889 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:17:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:00,898 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:17:00,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:00,938 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:00,952 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:00,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2072716410] [2022-01-31 21:17:00,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2072716410] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:00,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:00,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:17:00,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170274250] [2022-01-31 21:17:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:00,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:17:00,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:00,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:17:00,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:17:00,953 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:01,101 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2022-01-31 21:17:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:17:01,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-01-31 21:17:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:01,102 INFO L225 Difference]: With dead ends: 86 [2022-01-31 21:17:01,102 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 21:17:01,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:17:01,102 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:01,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 45 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:17:01,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 21:17:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-01-31 21:17:01,112 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:17:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2022-01-31 21:17:01,124 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 24 [2022-01-31 21:17:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:01,124 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-01-31 21:17:01,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-01-31 21:17:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 21:17:01,125 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:01,125 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, 1, 1] [2022-01-31 21:17:01,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:17:01,125 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:01,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 801149717, now seen corresponding path program 3 times [2022-01-31 21:17:01,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:01,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [974902691] [2022-01-31 21:17:01,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:01,173 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:01,173 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:01,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:01,176 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:17:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:01,186 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:17:01,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:01,228 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:01,261 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:01,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [974902691] [2022-01-31 21:17:01,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [974902691] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:01,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:01,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:17:01,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4499498] [2022-01-31 21:17:01,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:01,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:17:01,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:01,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:17:01,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:17:01,262 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:17:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:01,544 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-01-31 21:17:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:17:01,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:17:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:01,545 INFO L225 Difference]: With dead ends: 81 [2022-01-31 21:17:01,545 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 21:17:01,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:17:01,548 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:01,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 45 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:17:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 21:17:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2022-01-31 21:17:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call 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:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2022-01-31 21:17:01,567 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 26 [2022-01-31 21:17:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:01,568 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-01-31 21:17:01,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:17:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2022-01-31 21:17:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 21:17:01,569 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:01,569 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, 1] [2022-01-31 21:17:01,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:17:01,569 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1041168377, now seen corresponding path program 3 times [2022-01-31 21:17:01,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:01,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1677097134] [2022-01-31 21:17:01,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:01,609 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:01,609 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:01,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:01,614 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:17:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:01,634 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:17:01,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:17:01,688 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:01,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1677097134] [2022-01-31 21:17:01,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1677097134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:01,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:01,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:17:01,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616490694] [2022-01-31 21:17:01,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:01,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:17:01,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:01,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:17:01,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:17:01,689 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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:17:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:01,985 INFO L93 Difference]: Finished difference Result 96 states and 132 transitions. [2022-01-31 21:17:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:17:01,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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 27 [2022-01-31 21:17:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:01,986 INFO L225 Difference]: With dead ends: 96 [2022-01-31 21:17:01,986 INFO L226 Difference]: Without dead ends: 91 [2022-01-31 21:17:01,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:17:01,987 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 66 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:01,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 41 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:17:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-31 21:17:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2022-01-31 21:17:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 67 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2022-01-31 21:17:02,002 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 27 [2022-01-31 21:17:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:02,002 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-01-31 21:17:02,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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:17:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2022-01-31 21:17:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 21:17:02,003 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:02,003 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, 1] [2022-01-31 21:17:02,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:17:02,003 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:02,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1280397098, now seen corresponding path program 4 times [2022-01-31 21:17:02,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:02,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1279767491] [2022-01-31 21:17:02,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:02,061 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:02,062 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:02,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:02,065 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:17:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:02,090 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:02,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:02,141 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:02,162 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:02,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1279767491] [2022-01-31 21:17:02,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1279767491] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:02,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:02,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:17:02,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360466268] [2022-01-31 21:17:02,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:02,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:17:02,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:02,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:17:02,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:17:02,164 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:17:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:02,520 INFO L93 Difference]: Finished difference Result 126 states and 184 transitions. [2022-01-31 21:17:02,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:17:02,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 27 [2022-01-31 21:17:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:02,521 INFO L225 Difference]: With dead ends: 126 [2022-01-31 21:17:02,521 INFO L226 Difference]: Without dead ends: 113 [2022-01-31 21:17:02,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:17:02,522 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 74 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:02,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 48 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:17:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-31 21:17:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2022-01-31 21:17:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2022-01-31 21:17:02,544 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 27 [2022-01-31 21:17:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:02,545 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2022-01-31 21:17:02,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:17:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2022-01-31 21:17:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 21:17:02,545 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:02,545 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, 1, 1] [2022-01-31 21:17:02,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:17:02,545 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:02,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:02,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2049023563, now seen corresponding path program 3 times [2022-01-31 21:17:02,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:02,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1304357176] [2022-01-31 21:17:02,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:02,587 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:02,602 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:02,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:02,605 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:17:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:02,621 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:02,675 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:02,697 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:02,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1304357176] [2022-01-31 21:17:02,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1304357176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:02,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:02,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:17:02,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587906217] [2022-01-31 21:17:02,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:02,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:17:02,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:17:02,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:17:02,699 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 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:17:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:02,987 INFO L93 Difference]: Finished difference Result 125 states and 171 transitions. [2022-01-31 21:17:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:17:02,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 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:17:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:02,988 INFO L225 Difference]: With dead ends: 125 [2022-01-31 21:17:02,988 INFO L226 Difference]: Without dead ends: 120 [2022-01-31 21:17:02,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:17:02,989 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 51 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:02,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 47 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:17:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-01-31 21:17:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2022-01-31 21:17:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call 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:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2022-01-31 21:17:03,012 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 28 [2022-01-31 21:17:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:03,012 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2022-01-31 21:17:03,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 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:17:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2022-01-31 21:17:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 21:17:03,012 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:03,012 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, 1, 1] [2022-01-31 21:17:03,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:17:03,012 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:03,013 INFO L85 PathProgramCache]: Analyzing trace with hash 836656981, now seen corresponding path program 4 times [2022-01-31 21:17:03,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:03,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573232898] [2022-01-31 21:17:03,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:03,063 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:03,063 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:03,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:03,066 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:17:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:03,075 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:17:03,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:03,118 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:03,151 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:03,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1573232898] [2022-01-31 21:17:03,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1573232898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:03,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:03,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:17:03,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819072463] [2022-01-31 21:17:03,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:03,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:17:03,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:03,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:17:03,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:17:03,152 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:17:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:03,435 INFO L93 Difference]: Finished difference Result 240 states and 352 transitions. [2022-01-31 21:17:03,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:17:03,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:17:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:03,436 INFO L225 Difference]: With dead ends: 240 [2022-01-31 21:17:03,436 INFO L226 Difference]: Without dead ends: 202 [2022-01-31 21:17:03,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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:17:03,438 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:03,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 48 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:17:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-01-31 21:17:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 113. [2022-01-31 21:17:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call 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:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 156 transitions. [2022-01-31 21:17:03,499 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 156 transitions. Word has length 28 [2022-01-31 21:17:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:03,499 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 156 transitions. [2022-01-31 21:17:03,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:17:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 156 transitions. [2022-01-31 21:17:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:17:03,499 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:03,499 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:03,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 21:17:03,500 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:03,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 5 times [2022-01-31 21:17:03,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:03,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1448645832] [2022-01-31 21:17:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:03,545 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:03,545 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:03,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:03,548 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:17:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:03,557 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:17:03,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:03,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:17:03,654 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:03,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1448645832] [2022-01-31 21:17:03,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1448645832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:03,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:03,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:17:03,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593010712] [2022-01-31 21:17:03,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:03,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:17:03,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:03,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:17:03,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:17:03,655 INFO L87 Difference]: Start difference. First operand 113 states and 156 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 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:17:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:03,902 INFO L93 Difference]: Finished difference Result 169 states and 238 transitions. [2022-01-31 21:17:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:17:03,903 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 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 29 [2022-01-31 21:17:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:03,903 INFO L225 Difference]: With dead ends: 169 [2022-01-31 21:17:03,904 INFO L226 Difference]: Without dead ends: 164 [2022-01-31 21:17:03,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:17:03,904 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 72 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:03,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 54 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:17:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-01-31 21:17:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 119. [2022-01-31 21:17:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 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:17:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2022-01-31 21:17:03,935 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 29 [2022-01-31 21:17:03,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:03,935 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2022-01-31 21:17:03,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 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:17:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2022-01-31 21:17:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:17:03,935 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:03,935 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, 1, 1] [2022-01-31 21:17:03,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 21:17:03,936 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:03,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1591798503, now seen corresponding path program 6 times [2022-01-31 21:17:03,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:03,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2077490912] [2022-01-31 21:17:03,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:03,971 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:03,971 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:03,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:03,974 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:17:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:03,984 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:17:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:04,042 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:04,072 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:04,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2077490912] [2022-01-31 21:17:04,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2077490912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:04,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:04,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:17:04,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861135875] [2022-01-31 21:17:04,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:04,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:17:04,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:04,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:17:04,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:17:04,073 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:04,439 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2022-01-31 21:17:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:17:04,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:04,440 INFO L225 Difference]: With dead ends: 141 [2022-01-31 21:17:04,440 INFO L226 Difference]: Without dead ends: 118 [2022-01-31 21:17:04,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:17:04,441 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:04,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:17:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-31 21:17:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2022-01-31 21:17:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call 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:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2022-01-31 21:17:04,469 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 154 transitions. Word has length 29 [2022-01-31 21:17:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:04,469 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 154 transitions. [2022-01-31 21:17:04,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 154 transitions. [2022-01-31 21:17:04,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:17:04,470 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:04,470 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, 1] [2022-01-31 21:17:04,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 21:17:04,470 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:04,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:04,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1563256359, now seen corresponding path program 4 times [2022-01-31 21:17:04,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:04,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [201125507] [2022-01-31 21:17:04,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:04,510 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:04,511 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:04,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:04,513 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:17:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:04,522 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:17:04,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:17:04,595 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:04,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [201125507] [2022-01-31 21:17:04,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [201125507] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:04,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:04,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:17:04,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267743580] [2022-01-31 21:17:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:04,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:17:04,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:17:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:17:04,596 INFO L87 Difference]: Start difference. First operand 110 states and 154 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:17:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:05,044 INFO L93 Difference]: Finished difference Result 229 states and 333 transitions. [2022-01-31 21:17:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:17:05,044 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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 29 [2022-01-31 21:17:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:05,045 INFO L225 Difference]: With dead ends: 229 [2022-01-31 21:17:05,045 INFO L226 Difference]: Without dead ends: 157 [2022-01-31 21:17:05,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:17:05,046 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:05,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 51 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:17:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-01-31 21:17:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 132. [2022-01-31 21:17:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 127 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call 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:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 186 transitions. [2022-01-31 21:17:05,099 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 186 transitions. Word has length 29 [2022-01-31 21:17:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:05,099 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 186 transitions. [2022-01-31 21:17:05,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:17:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 186 transitions. [2022-01-31 21:17:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:17:05,099 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:05,099 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, 1, 1] [2022-01-31 21:17:05,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 21:17:05,099 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:05,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1709448743, now seen corresponding path program 7 times [2022-01-31 21:17:05,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:05,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1348840828] [2022-01-31 21:17:05,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:05,128 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:05,128 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:05,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:05,132 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:17:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:05,151 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:17:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:05,205 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:05,239 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:05,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1348840828] [2022-01-31 21:17:05,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1348840828] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:05,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:05,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:17:05,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764972229] [2022-01-31 21:17:05,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:05,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:17:05,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:05,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:17:05,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:17:05,240 INFO L87 Difference]: Start difference. First operand 132 states and 186 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:05,653 INFO L93 Difference]: Finished difference Result 314 states and 456 transitions. [2022-01-31 21:17:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:17:05,653 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:05,655 INFO L225 Difference]: With dead ends: 314 [2022-01-31 21:17:05,655 INFO L226 Difference]: Without dead ends: 264 [2022-01-31 21:17:05,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 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:17:05,655 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 119 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:05,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 46 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:17:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-01-31 21:17:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 158. [2022-01-31 21:17:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.3986928104575163) internal successors, (214), 153 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:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 218 transitions. [2022-01-31 21:17:05,739 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 218 transitions. Word has length 29 [2022-01-31 21:17:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:05,739 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 218 transitions. [2022-01-31 21:17:05,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 218 transitions. [2022-01-31 21:17:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:17:05,740 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:05,740 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, 1, 1] [2022-01-31 21:17:05,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 21:17:05,741 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:05,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1181811755, now seen corresponding path program 8 times [2022-01-31 21:17:05,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:05,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905493002] [2022-01-31 21:17:05,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:05,793 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:05,793 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:05,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:05,796 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:17:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:05,808 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:05,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:05,851 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:05,872 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:05,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905493002] [2022-01-31 21:17:05,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1905493002] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:05,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:05,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:17:05,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981486438] [2022-01-31 21:17:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:05,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:17:05,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:05,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:17:05,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:17:05,873 INFO L87 Difference]: Start difference. First operand 158 states and 218 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:17:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:06,342 INFO L93 Difference]: Finished difference Result 331 states and 467 transitions. [2022-01-31 21:17:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:17:06,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 30 [2022-01-31 21:17:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:06,346 INFO L225 Difference]: With dead ends: 331 [2022-01-31 21:17:06,346 INFO L226 Difference]: Without dead ends: 231 [2022-01-31 21:17:06,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:17:06,358 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 94 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:06,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 60 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:17:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-01-31 21:17:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 194. [2022-01-31 21:17:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 189 states have (on average 1.380952380952381) internal successors, (261), 189 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call 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:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 265 transitions. [2022-01-31 21:17:06,437 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 265 transitions. Word has length 30 [2022-01-31 21:17:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:06,437 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 265 transitions. [2022-01-31 21:17:06,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:17:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 265 transitions. [2022-01-31 21:17:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:17:06,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:06,438 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:06,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 21:17:06,438 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:06,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:06,438 INFO L85 PathProgramCache]: Analyzing trace with hash 965652437, now seen corresponding path program 9 times [2022-01-31 21:17:06,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:06,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [784330093] [2022-01-31 21:17:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:06,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:17:06,487 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:06,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:06,490 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:17:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:06,499 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:17:06,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:06,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:17:06,595 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:06,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [784330093] [2022-01-31 21:17:06,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [784330093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:06,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:06,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:17:06,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331924741] [2022-01-31 21:17:06,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:06,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:17:06,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:06,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:17:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:17:06,596 INFO L87 Difference]: Start difference. First operand 194 states and 265 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 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:17:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:07,165 INFO L93 Difference]: Finished difference Result 432 states and 611 transitions. [2022-01-31 21:17:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:17:07,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 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:17:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:07,167 INFO L225 Difference]: With dead ends: 432 [2022-01-31 21:17:07,167 INFO L226 Difference]: Without dead ends: 376 [2022-01-31 21:17:07,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:17:07,167 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 105 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:07,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 77 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:17:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-01-31 21:17:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 228. [2022-01-31 21:17:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 223 states have (on average 1.3542600896860986) internal successors, (302), 223 states have internal predecessors, (302), 3 states have call successors, (3), 3 states have call 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:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 306 transitions. [2022-01-31 21:17:07,234 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 306 transitions. Word has length 30 [2022-01-31 21:17:07,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:07,235 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 306 transitions. [2022-01-31 21:17:07,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 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:17:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 306 transitions. [2022-01-31 21:17:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:17:07,235 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:07,235 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:07,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 21:17:07,235 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:07,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:07,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2005556903, now seen corresponding path program 10 times [2022-01-31 21:17:07,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:07,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [675093308] [2022-01-31 21:17:07,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:07,260 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:07,260 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:07,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:07,263 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:17:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:07,272 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:07,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:07,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:17:07,378 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:07,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [675093308] [2022-01-31 21:17:07,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [675093308] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:07,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:07,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:17:07,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121864063] [2022-01-31 21:17:07,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:07,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:17:07,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:07,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:17:07,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:17:07,379 INFO L87 Difference]: Start difference. First operand 228 states and 306 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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:17:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:08,117 INFO L93 Difference]: Finished difference Result 482 states and 678 transitions. [2022-01-31 21:17:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:17:08,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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:17:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:08,118 INFO L225 Difference]: With dead ends: 482 [2022-01-31 21:17:08,118 INFO L226 Difference]: Without dead ends: 426 [2022-01-31 21:17:08,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:17:08,119 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 135 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:08,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 73 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:17:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-01-31 21:17:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 247. [2022-01-31 21:17:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.3553719008264462) internal successors, (328), 242 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call 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:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 332 transitions. [2022-01-31 21:17:08,210 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 332 transitions. Word has length 31 [2022-01-31 21:17:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:08,210 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 332 transitions. [2022-01-31 21:17:08,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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:17:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 332 transitions. [2022-01-31 21:17:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 21:17:08,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:08,213 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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:17:08,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 21:17:08,213 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:08,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:08,214 INFO L85 PathProgramCache]: Analyzing trace with hash -745886635, now seen corresponding path program 11 times [2022-01-31 21:17:08,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:08,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2078241061] [2022-01-31 21:17:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:08,241 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:08,242 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:08,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:08,244 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:17:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:08,262 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:17:08,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:08,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:17:08,373 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:08,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2078241061] [2022-01-31 21:17:08,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2078241061] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:08,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:08,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:17:08,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541442921] [2022-01-31 21:17:08,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:08,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:17:08,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:08,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:17:08,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:17:08,374 INFO L87 Difference]: Start difference. First operand 247 states and 332 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:08,800 INFO L93 Difference]: Finished difference Result 280 states and 371 transitions. [2022-01-31 21:17:08,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:17:08,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 32 [2022-01-31 21:17:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:08,801 INFO L225 Difference]: With dead ends: 280 [2022-01-31 21:17:08,801 INFO L226 Difference]: Without dead ends: 198 [2022-01-31 21:17:08,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:17:08,802 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 41 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:08,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 60 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:17:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-01-31 21:17:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 179. [2022-01-31 21:17:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call 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:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 244 transitions. [2022-01-31 21:17:08,871 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 244 transitions. Word has length 32 [2022-01-31 21:17:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:08,871 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 244 transitions. [2022-01-31 21:17:08,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 244 transitions. [2022-01-31 21:17:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 21:17:08,873 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:08,873 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, 1, 1] [2022-01-31 21:17:08,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 21:17:08,873 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:08,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1004124090, now seen corresponding path program 12 times [2022-01-31 21:17:08,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:08,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1356482889] [2022-01-31 21:17:08,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:08,909 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:08,909 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:08,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:08,915 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:17:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:08,938 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:17:08,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:08,994 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:09,039 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:09,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1356482889] [2022-01-31 21:17:09,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1356482889] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:09,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:09,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:17:09,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341509000] [2022-01-31 21:17:09,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:09,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:17:09,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:09,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:17:09,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:17:09,040 INFO L87 Difference]: Start difference. First operand 179 states and 244 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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:17:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:09,488 INFO L93 Difference]: Finished difference Result 263 states and 353 transitions. [2022-01-31 21:17:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:17:09,488 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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 33 [2022-01-31 21:17:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:09,489 INFO L225 Difference]: With dead ends: 263 [2022-01-31 21:17:09,489 INFO L226 Difference]: Without dead ends: 248 [2022-01-31 21:17:09,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:17:09,500 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 58 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:09,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 41 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:17:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-01-31 21:17:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 215. [2022-01-31 21:17:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.3428571428571427) internal successors, (282), 210 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call 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:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 286 transitions. [2022-01-31 21:17:09,589 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 286 transitions. Word has length 33 [2022-01-31 21:17:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:09,589 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 286 transitions. [2022-01-31 21:17:09,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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:17:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 286 transitions. [2022-01-31 21:17:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:17:09,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:09,590 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:09,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 21:17:09,590 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 13 times [2022-01-31 21:17:09,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:09,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2132180661] [2022-01-31 21:17:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:09,628 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:09,628 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:09,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:09,632 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:17:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:09,644 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:17:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:09,704 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:09,755 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:09,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2132180661] [2022-01-31 21:17:09,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2132180661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:09,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:09,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:17:09,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217040029] [2022-01-31 21:17:09,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:09,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:17:09,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:09,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:17:09,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:17:09,756 INFO L87 Difference]: Start difference. First operand 215 states and 286 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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:17:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:10,232 INFO L93 Difference]: Finished difference Result 300 states and 407 transitions. [2022-01-31 21:17:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:17:10,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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 35 [2022-01-31 21:17:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:10,234 INFO L225 Difference]: With dead ends: 300 [2022-01-31 21:17:10,234 INFO L226 Difference]: Without dead ends: 291 [2022-01-31 21:17:10,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:17:10,234 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 82 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:10,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:17:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-01-31 21:17:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 224. [2022-01-31 21:17:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 219 states have (on average 1.356164383561644) internal successors, (297), 219 states have internal predecessors, (297), 3 states have call successors, (3), 3 states have call 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:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 301 transitions. [2022-01-31 21:17:10,325 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 301 transitions. Word has length 35 [2022-01-31 21:17:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:10,325 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 301 transitions. [2022-01-31 21:17:10,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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:17:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 301 transitions. [2022-01-31 21:17:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:17:10,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:10,326 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, 1, 1] [2022-01-31 21:17:10,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 21:17:10,326 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1894435528, now seen corresponding path program 14 times [2022-01-31 21:17:10,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:10,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1469030130] [2022-01-31 21:17:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:10,361 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:10,362 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:10,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:10,365 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:17:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:10,392 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:17:10,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:10,498 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:10,560 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1469030130] [2022-01-31 21:17:10,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1469030130] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:10,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:10,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:17:10,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417955815] [2022-01-31 21:17:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:10,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:17:10,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:10,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:17:10,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:17:10,561 INFO L87 Difference]: Start difference. First operand 224 states and 301 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 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:17:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:11,551 INFO L93 Difference]: Finished difference Result 284 states and 377 transitions. [2022-01-31 21:17:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 21:17:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 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:17:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:11,552 INFO L225 Difference]: With dead ends: 284 [2022-01-31 21:17:11,552 INFO L226 Difference]: Without dead ends: 196 [2022-01-31 21:17:11,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=1328, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 21:17:11,552 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:11,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 74 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:17:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-01-31 21:17:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 167. [2022-01-31 21:17:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.3641975308641976) internal successors, (221), 162 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call 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:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2022-01-31 21:17:11,618 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 35 [2022-01-31 21:17:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:11,618 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2022-01-31 21:17:11,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 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:17:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2022-01-31 21:17:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:17:11,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:11,618 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, 1, 1] [2022-01-31 21:17:11,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 21:17:11,619 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:11,619 INFO L85 PathProgramCache]: Analyzing trace with hash -831754262, now seen corresponding path program 15 times [2022-01-31 21:17:11,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:11,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2066384156] [2022-01-31 21:17:11,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:11,661 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:11,661 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:11,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:11,665 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:17:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:11,684 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:17:11,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:11,775 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:11,879 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:11,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2066384156] [2022-01-31 21:17:11,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2066384156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:11,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:11,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:17:11,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772969851] [2022-01-31 21:17:11,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:11,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:17:11,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:11,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:17:11,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:17:11,880 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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:17:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:12,896 INFO L93 Difference]: Finished difference Result 217 states and 286 transitions. [2022-01-31 21:17:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:17:12,896 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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 35 [2022-01-31 21:17:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:12,897 INFO L225 Difference]: With dead ends: 217 [2022-01-31 21:17:12,897 INFO L226 Difference]: Without dead ends: 192 [2022-01-31 21:17:12,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=1296, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 21:17:12,897 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 58 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:12,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 75 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:17:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-01-31 21:17:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 153. [2022-01-31 21:17:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.3783783783783783) internal successors, (204), 148 states have internal predecessors, (204), 3 states have call successors, (3), 3 states have call 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:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 208 transitions. [2022-01-31 21:17:12,960 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 208 transitions. Word has length 35 [2022-01-31 21:17:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:12,960 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 208 transitions. [2022-01-31 21:17:12,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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:17:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 208 transitions. [2022-01-31 21:17:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:17:12,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:12,961 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:12,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 21:17:12,961 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash 368928490, now seen corresponding path program 5 times [2022-01-31 21:17:12,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:12,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706510587] [2022-01-31 21:17:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:13,032 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:13,033 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:13,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:13,036 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:17:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:13,047 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:17:13,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:17:13,266 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:13,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706510587] [2022-01-31 21:17:13,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [706510587] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:13,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:13,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:17:13,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174635347] [2022-01-31 21:17:13,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:13,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:17:13,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:13,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:17:13,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:17:13,268 INFO L87 Difference]: Start difference. First operand 153 states and 208 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:14,710 INFO L93 Difference]: Finished difference Result 202 states and 272 transitions. [2022-01-31 21:17:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 21:17:14,712 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-01-31 21:17:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:14,712 INFO L225 Difference]: With dead ends: 202 [2022-01-31 21:17:14,712 INFO L226 Difference]: Without dead ends: 179 [2022-01-31 21:17:14,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=2471, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 21:17:14,713 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 90 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:14,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 83 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:17:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-01-31 21:17:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2022-01-31 21:17:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.380281690140845) internal successors, (196), 142 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call 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:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 200 transitions. [2022-01-31 21:17:14,786 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 200 transitions. Word has length 35 [2022-01-31 21:17:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:14,787 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 200 transitions. [2022-01-31 21:17:14,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 200 transitions. [2022-01-31 21:17:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:17:14,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:14,797 INFO L514 BasicCegarLoop]: trace histogram [7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:14,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 21:17:14,797 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:14,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash 237906376, now seen corresponding path program 6 times [2022-01-31 21:17:14,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:14,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1800336793] [2022-01-31 21:17:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:14,842 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:14,843 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:14,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:14,845 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:17:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:14,855 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:14,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:14,946 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:15,077 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:15,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1800336793] [2022-01-31 21:17:15,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1800336793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:15,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:15,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:17:15,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469357296] [2022-01-31 21:17:15,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:15,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:17:15,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:15,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:17:15,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:17:15,078 INFO L87 Difference]: Start difference. First operand 147 states and 200 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:17:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:16,387 INFO L93 Difference]: Finished difference Result 428 states and 628 transitions. [2022-01-31 21:17:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:17:16,388 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 35 [2022-01-31 21:17:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:16,389 INFO L225 Difference]: With dead ends: 428 [2022-01-31 21:17:16,389 INFO L226 Difference]: Without dead ends: 380 [2022-01-31 21:17:16,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 21:17:16,390 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 187 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:16,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 89 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:17:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-01-31 21:17:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 158. [2022-01-31 21:17:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.3856209150326797) internal successors, (212), 153 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call 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:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 216 transitions. [2022-01-31 21:17:16,465 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 216 transitions. Word has length 35 [2022-01-31 21:17:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:16,465 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 216 transitions. [2022-01-31 21:17:16,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:17:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 216 transitions. [2022-01-31 21:17:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:17:16,466 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:16,466 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:16,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 21:17:16,466 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2040976357, now seen corresponding path program 16 times [2022-01-31 21:17:16,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:16,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1048172980] [2022-01-31 21:17:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:16,522 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:16,522 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:16,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:16,525 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:17:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:16,542 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:17:16,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:16,584 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:16,624 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:16,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1048172980] [2022-01-31 21:17:16,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1048172980] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:16,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:16,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:17:16,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878279095] [2022-01-31 21:17:16,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:16,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:17:16,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:16,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:17:16,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:17:16,625 INFO L87 Difference]: Start difference. First operand 158 states and 216 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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:17:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:17,035 INFO L93 Difference]: Finished difference Result 198 states and 261 transitions. [2022-01-31 21:17:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:17:17,035 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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:17:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:17,036 INFO L225 Difference]: With dead ends: 198 [2022-01-31 21:17:17,036 INFO L226 Difference]: Without dead ends: 171 [2022-01-31 21:17:17,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:17:17,037 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 46 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:17,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 47 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:17:17,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-01-31 21:17:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2022-01-31 21:17:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.416058394160584) internal successors, (194), 137 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 198 transitions. [2022-01-31 21:17:17,100 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 198 transitions. Word has length 36 [2022-01-31 21:17:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:17,100 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 198 transitions. [2022-01-31 21:17:17,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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:17:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2022-01-31 21:17:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:17:17,101 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:17,101 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:17,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 21:17:17,101 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:17,101 INFO L85 PathProgramCache]: Analyzing trace with hash 254868036, now seen corresponding path program 17 times [2022-01-31 21:17:17,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:17,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1710777275] [2022-01-31 21:17:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:17,132 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:17,132 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:17,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:17,135 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:17:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:17,155 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:17:17,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:17:17,460 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:17,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1710777275] [2022-01-31 21:17:17,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1710777275] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:17,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:17,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:17:17,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998202555] [2022-01-31 21:17:17,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:17,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:17:17,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:17,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:17:17,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:17:17,462 INFO L87 Difference]: Start difference. First operand 142 states and 198 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:18,928 INFO L93 Difference]: Finished difference Result 219 states and 301 transitions. [2022-01-31 21:17:18,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 21:17:18,928 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-01-31 21:17:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:18,929 INFO L225 Difference]: With dead ends: 219 [2022-01-31 21:17:18,929 INFO L226 Difference]: Without dead ends: 202 [2022-01-31 21:17:18,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1830, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 21:17:18,930 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 55 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:18,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 74 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:17:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-01-31 21:17:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 157. [2022-01-31 21:17:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.375) internal successors, (209), 152 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call 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:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 213 transitions. [2022-01-31 21:17:19,017 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 213 transitions. Word has length 36 [2022-01-31 21:17:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:19,017 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 213 transitions. [2022-01-31 21:17:19,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 213 transitions. [2022-01-31 21:17:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:17:19,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:19,018 INFO L514 BasicCegarLoop]: trace histogram [8, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:19,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 21:17:19,018 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1429571964, now seen corresponding path program 7 times [2022-01-31 21:17:19,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:19,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [725390955] [2022-01-31 21:17:19,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:21,066 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:21,066 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:21,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:21,069 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:21,080 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:21,187 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:21,322 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:21,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [725390955] [2022-01-31 21:17:21,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [725390955] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:21,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:21,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:17:21,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597258667] [2022-01-31 21:17:21,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:21,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:17:21,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:21,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:17:21,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:17:21,323 INFO L87 Difference]: Start difference. First operand 157 states and 213 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:23,011 INFO L93 Difference]: Finished difference Result 469 states and 675 transitions. [2022-01-31 21:17:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:17:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-01-31 21:17:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:23,013 INFO L225 Difference]: With dead ends: 469 [2022-01-31 21:17:23,013 INFO L226 Difference]: Without dead ends: 406 [2022-01-31 21:17:23,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:17:23,014 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 210 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:23,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 67 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:17:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-01-31 21:17:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 166. [2022-01-31 21:17:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call 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:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2022-01-31 21:17:23,106 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 36 [2022-01-31 21:17:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:23,106 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2022-01-31 21:17:23,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2022-01-31 21:17:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 21:17:23,107 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:23,107 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, 1] [2022-01-31 21:17:23,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 21:17:23,107 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:23,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1529476664, now seen corresponding path program 8 times [2022-01-31 21:17:23,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:23,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1157102127] [2022-01-31 21:17:23,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:23,154 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:23,154 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:23,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:23,157 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:17:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:23,174 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:17:23,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:23,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:17:23,420 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:23,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1157102127] [2022-01-31 21:17:23,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1157102127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:23,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:23,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:17:23,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708051111] [2022-01-31 21:17:23,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:23,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:17:23,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:23,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:17:23,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:17:23,421 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:17:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:24,509 INFO L93 Difference]: Finished difference Result 305 states and 419 transitions. [2022-01-31 21:17:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 21:17:24,509 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:17:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:24,510 INFO L225 Difference]: With dead ends: 305 [2022-01-31 21:17:24,510 INFO L226 Difference]: Without dead ends: 288 [2022-01-31 21:17:24,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=399, Invalid=1857, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 21:17:24,511 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 72 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:24,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 53 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:17:24,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-01-31 21:17:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 194. [2022-01-31 21:17:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 189 states have (on average 1.380952380952381) internal successors, (261), 189 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call 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:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 265 transitions. [2022-01-31 21:17:24,619 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 265 transitions. Word has length 37 [2022-01-31 21:17:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:24,619 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 265 transitions. [2022-01-31 21:17:24,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:17:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 265 transitions. [2022-01-31 21:17:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 21:17:24,620 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:24,620 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, 1, 1] [2022-01-31 21:17:24,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 21:17:24,621 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:24,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1410664363, now seen corresponding path program 18 times [2022-01-31 21:17:24,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:24,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [412444777] [2022-01-31 21:17:24,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:24,669 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:24,669 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:24,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:24,674 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:17:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:24,716 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:24,895 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:52,097 WARN L228 SmtUtils]: Spent 5.14s 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:17:52,099 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:52,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [412444777] [2022-01-31 21:17:52,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [412444777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:52,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:52,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:17:52,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614789637] [2022-01-31 21:17:52,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:52,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:17:52,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:52,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:17:52,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=336, Unknown=5, NotChecked=0, Total=420 [2022-01-31 21:17:52,100 INFO L87 Difference]: Start difference. First operand 194 states and 265 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:52,743 INFO L93 Difference]: Finished difference Result 255 states and 332 transitions. [2022-01-31 21:17:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:17:52,743 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-01-31 21:17:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:52,744 INFO L225 Difference]: With dead ends: 255 [2022-01-31 21:17:52,744 INFO L226 Difference]: Without dead ends: 250 [2022-01-31 21:17:52,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=164, Invalid=887, Unknown=5, NotChecked=0, Total=1056 [2022-01-31 21:17:52,744 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:52,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 73 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 294 Invalid, 0 Unknown, 107 Unchecked, 0.2s Time] [2022-01-31 21:17:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-01-31 21:17:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 190. [2022-01-31 21:17:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.3675675675675676) internal successors, (253), 185 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call 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:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 257 transitions. [2022-01-31 21:17:52,860 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 257 transitions. Word has length 38 [2022-01-31 21:17:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:52,860 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 257 transitions. [2022-01-31 21:17:52,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 257 transitions. [2022-01-31 21:17:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 21:17:52,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:52,860 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, 1] [2022-01-31 21:17:52,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 21:17:52,860 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:52,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash 899157845, now seen corresponding path program 9 times [2022-01-31 21:17:52,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:52,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1757761556] [2022-01-31 21:17:52,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:52,898 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:52,898 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:52,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:52,902 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:17:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:52,915 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:17:53,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:53,072 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:53,189 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:53,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1757761556] [2022-01-31 21:17:53,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1757761556] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:53,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:53,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:17:53,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403934921] [2022-01-31 21:17:53,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:53,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:17:53,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:53,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:17:53,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:17:53,190 INFO L87 Difference]: Start difference. First operand 190 states and 257 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:55,207 INFO L93 Difference]: Finished difference Result 455 states and 601 transitions. [2022-01-31 21:17:55,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-31 21:17:55,208 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 38 [2022-01-31 21:17:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:55,209 INFO L225 Difference]: With dead ends: 455 [2022-01-31 21:17:55,209 INFO L226 Difference]: Without dead ends: 292 [2022-01-31 21:17:55,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=459, Invalid=3573, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 21:17:55,210 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 109 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:55,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 91 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:17:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-01-31 21:17:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 194. [2022-01-31 21:17:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 189 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call 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:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 259 transitions. [2022-01-31 21:17:55,333 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 259 transitions. Word has length 38 [2022-01-31 21:17:55,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:55,333 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 259 transitions. [2022-01-31 21:17:55,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 259 transitions. [2022-01-31 21:17:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 21:17:55,336 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:55,336 INFO L514 BasicCegarLoop]: trace histogram [9, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:55,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 21:17:55,336 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:55,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash -164755688, now seen corresponding path program 10 times [2022-01-31 21:17:55,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:55,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [185120631] [2022-01-31 21:17:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:55,386 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:55,386 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:55,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:55,390 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:17:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:55,403 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:17:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:17:55,783 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:55,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [185120631] [2022-01-31 21:17:55,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [185120631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:55,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:55,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:17:55,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133510403] [2022-01-31 21:17:55,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:55,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:17:55,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:17:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:17:55,784 INFO L87 Difference]: Start difference. First operand 194 states and 259 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:58,051 INFO L93 Difference]: Finished difference Result 628 states and 901 transitions. [2022-01-31 21:17:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:17:58,052 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 39 [2022-01-31 21:17:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:58,061 INFO L225 Difference]: With dead ends: 628 [2022-01-31 21:17:58,061 INFO L226 Difference]: Without dead ends: 564 [2022-01-31 21:17:58,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=360, Invalid=1200, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 21:17:58,069 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 243 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:58,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 83 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:17:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-01-31 21:17:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 206. [2022-01-31 21:17:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 201 states have (on average 1.3532338308457712) internal successors, (272), 201 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call 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:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 276 transitions. [2022-01-31 21:17:58,239 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 276 transitions. Word has length 39 [2022-01-31 21:17:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:58,239 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 276 transitions. [2022-01-31 21:17:58,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 276 transitions. [2022-01-31 21:17:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 21:17:58,239 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:58,240 INFO L514 BasicCegarLoop]: trace histogram [10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:58,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 21:17:58,240 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash 106842550, now seen corresponding path program 11 times [2022-01-31 21:17:58,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:58,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1417914181] [2022-01-31 21:17:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:58,284 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:58,284 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:58,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:58,287 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:17:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:58,296 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:17:58,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:58,455 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:58,703 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:58,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1417914181] [2022-01-31 21:17:58,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1417914181] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:58,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:58,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:17:58,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124266437] [2022-01-31 21:17:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:58,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:17:58,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:58,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:17:58,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:17:58,704 INFO L87 Difference]: Start difference. First operand 206 states and 276 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 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:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:01,491 INFO L93 Difference]: Finished difference Result 655 states and 939 transitions. [2022-01-31 21:18:01,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 21:18:01,491 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 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:18:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:01,493 INFO L225 Difference]: With dead ends: 655 [2022-01-31 21:18:01,493 INFO L226 Difference]: Without dead ends: 591 [2022-01-31 21:18:01,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 21:18:01,494 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 348 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:01,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 79 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 21:18:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-01-31 21:18:01,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 217. [2022-01-31 21:18:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 212 states have (on average 1.3537735849056605) internal successors, (287), 212 states have internal predecessors, (287), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:18:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 291 transitions. [2022-01-31 21:18:01,644 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 291 transitions. Word has length 40 [2022-01-31 21:18:01,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:01,644 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 291 transitions. [2022-01-31 21:18:01,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 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:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 291 transitions. [2022-01-31 21:18:01,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:18:01,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:01,645 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:01,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 21:18:01,645 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:01,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:01,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1046867033, now seen corresponding path program 19 times [2022-01-31 21:18:01,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:01,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1984027669] [2022-01-31 21:18:01,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:01,686 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:01,687 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:01,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:01,690 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:18:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:01,712 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:01,796 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:01,895 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:01,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1984027669] [2022-01-31 21:18:01,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1984027669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:01,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:01,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:18:01,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853910316] [2022-01-31 21:18:01,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:01,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:18:01,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:01,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:18:01,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:18:01,896 INFO L87 Difference]: Start difference. First operand 217 states and 291 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:18:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:02,884 INFO L93 Difference]: Finished difference Result 363 states and 485 transitions. [2022-01-31 21:18:02,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:18:02,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-01-31 21:18:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:02,885 INFO L225 Difference]: With dead ends: 363 [2022-01-31 21:18:02,886 INFO L226 Difference]: Without dead ends: 353 [2022-01-31 21:18:02,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:18:02,886 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 112 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:02,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 55 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:18:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-01-31 21:18:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 227. [2022-01-31 21:18:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 222 states have (on average 1.364864864864865) internal successors, (303), 222 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:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 307 transitions. [2022-01-31 21:18:03,054 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 307 transitions. Word has length 41 [2022-01-31 21:18:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:03,054 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 307 transitions. [2022-01-31 21:18:03,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:18:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2022-01-31 21:18:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:18:03,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:03,055 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, 1] [2022-01-31 21:18:03,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 21:18:03,055 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:03,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:03,055 INFO L85 PathProgramCache]: Analyzing trace with hash 831225272, now seen corresponding path program 12 times [2022-01-31 21:18:03,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:03,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2013574458] [2022-01-31 21:18:03,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:03,083 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:03,083 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:03,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:03,087 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:18:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:03,126 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:18:03,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:03,253 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:03,377 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:03,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2013574458] [2022-01-31 21:18:03,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2013574458] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:03,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:03,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:18:03,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406444074] [2022-01-31 21:18:03,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:03,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:18:03,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:18:03,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:18:03,378 INFO L87 Difference]: Start difference. First operand 227 states and 307 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 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:18:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:05,795 INFO L93 Difference]: Finished difference Result 464 states and 616 transitions. [2022-01-31 21:18:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-31 21:18:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 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 41 [2022-01-31 21:18:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:05,796 INFO L225 Difference]: With dead ends: 464 [2022-01-31 21:18:05,796 INFO L226 Difference]: Without dead ends: 448 [2022-01-31 21:18:05,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=687, Invalid=3603, Unknown=0, NotChecked=0, Total=4290 [2022-01-31 21:18:05,797 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 108 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:05,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 51 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:18:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-01-31 21:18:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 258. [2022-01-31 21:18:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 253 states have (on average 1.3715415019762847) internal successors, (347), 253 states have internal predecessors, (347), 3 states have call successors, (3), 3 states have call 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:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 351 transitions. [2022-01-31 21:18:06,002 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 351 transitions. Word has length 41 [2022-01-31 21:18:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:06,002 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 351 transitions. [2022-01-31 21:18:06,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 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:18:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 351 transitions. [2022-01-31 21:18:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:18:06,003 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:06,003 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:06,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 21:18:06,003 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:06,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1383374916, now seen corresponding path program 20 times [2022-01-31 21:18:06,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:06,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1313136751] [2022-01-31 21:18:06,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:06,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:18:06,030 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:06,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:06,033 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:18:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:06,049 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:18:06,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:06,100 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:06,175 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:06,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1313136751] [2022-01-31 21:18:06,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1313136751] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:06,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:06,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:18:06,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480148778] [2022-01-31 21:18:06,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:06,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:18:06,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:06,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:18:06,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:18:06,176 INFO L87 Difference]: Start difference. First operand 258 states and 351 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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:18:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:07,221 INFO L93 Difference]: Finished difference Result 426 states and 539 transitions. [2022-01-31 21:18:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:18:07,221 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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 42 [2022-01-31 21:18:07,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:07,222 INFO L225 Difference]: With dead ends: 426 [2022-01-31 21:18:07,222 INFO L226 Difference]: Without dead ends: 388 [2022-01-31 21:18:07,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:18:07,223 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:07,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 51 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:18:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-01-31 21:18:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 263. [2022-01-31 21:18:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.3527131782945736) internal successors, (349), 258 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:18:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 353 transitions. [2022-01-31 21:18:07,449 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 353 transitions. Word has length 42 [2022-01-31 21:18:07,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:07,449 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 353 transitions. [2022-01-31 21:18:07,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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:18:07,449 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 353 transitions. [2022-01-31 21:18:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:18:07,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:07,450 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, 1] [2022-01-31 21:18:07,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 21:18:07,450 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:07,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:07,450 INFO L85 PathProgramCache]: Analyzing trace with hash 29751636, now seen corresponding path program 5 times [2022-01-31 21:18:07,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:07,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1127125646] [2022-01-31 21:18:07,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:07,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:18:07,487 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:07,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:07,490 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:18:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:07,502 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_46.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:07,636 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,786 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:07,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1127125646] [2022-01-31 21:18:07,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1127125646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:07,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:07,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:18:07,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535812628] [2022-01-31 21:18:07,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:07,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:18:07,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:07,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:18:07,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:18:07,787 INFO L87 Difference]: Start difference. First operand 263 states and 353 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 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:18:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:11,620 INFO L93 Difference]: Finished difference Result 753 states and 980 transitions. [2022-01-31 21:18:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-31 21:18:11,620 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 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:18:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:11,622 INFO L225 Difference]: With dead ends: 753 [2022-01-31 21:18:11,622 INFO L226 Difference]: Without dead ends: 748 [2022-01-31 21:18:11,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2176 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1116, Invalid=5046, Unknown=0, NotChecked=0, Total=6162 [2022-01-31 21:18:11,625 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 337 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:11,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 50 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 21:18:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-01-31 21:18:11,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 336. [2022-01-31 21:18:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 331 states have (on average 1.3413897280966767) internal successors, (444), 331 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call 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:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 448 transitions. [2022-01-31 21:18:11,930 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 448 transitions. Word has length 42 [2022-01-31 21:18:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:11,930 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 448 transitions. [2022-01-31 21:18:11,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 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:18:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 448 transitions. [2022-01-31 21:18:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:18:11,931 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:11,931 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, 1, 1] [2022-01-31 21:18:11,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 21:18:11,931 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash 924637287, now seen corresponding path program 13 times [2022-01-31 21:18:11,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:11,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [953735143] [2022-01-31 21:18:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:11,979 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:11,979 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:11,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:11,982 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:18:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:11,996 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_47.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:12,167 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:12,390 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:12,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [953735143] [2022-01-31 21:18:12,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [953735143] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:12,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:12,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:18:12,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523104944] [2022-01-31 21:18:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:12,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:18:12,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:12,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:18:12,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:18:12,391 INFO L87 Difference]: Start difference. First operand 336 states and 448 transitions. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:16,380 INFO L93 Difference]: Finished difference Result 834 states and 1087 transitions. [2022-01-31 21:18:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-31 21:18:16,381 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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 42 [2022-01-31 21:18:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:16,382 INFO L225 Difference]: With dead ends: 834 [2022-01-31 21:18:16,382 INFO L226 Difference]: Without dead ends: 523 [2022-01-31 21:18:16,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1898 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=687, Invalid=5955, Unknown=0, NotChecked=0, Total=6642 [2022-01-31 21:18:16,384 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 145 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:16,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 98 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 21:18:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-01-31 21:18:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 362. [2022-01-31 21:18:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.3109243697478992) internal successors, (468), 357 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call 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:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 472 transitions. [2022-01-31 21:18:16,718 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 472 transitions. Word has length 42 [2022-01-31 21:18:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:16,718 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 472 transitions. [2022-01-31 21:18:16,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 472 transitions. [2022-01-31 21:18:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 21:18:16,719 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:16,719 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, 1, 1] [2022-01-31 21:18:16,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 21:18:16,720 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1110505976, now seen corresponding path program 14 times [2022-01-31 21:18:16,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:16,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [83700907] [2022-01-31 21:18:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:16,755 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:16,755 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:16,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:16,758 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:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:16,769 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_48.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:16,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:16,922 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:17,354 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:17,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [83700907] [2022-01-31 21:18:17,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [83700907] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:17,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:17,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:18:17,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786591371] [2022-01-31 21:18:17,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:17,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:18:17,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:18:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:18:17,355 INFO L87 Difference]: Start difference. First operand 362 states and 472 transitions. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:22,284 INFO L93 Difference]: Finished difference Result 1068 states and 1505 transitions. [2022-01-31 21:18:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:18:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:22,286 INFO L225 Difference]: With dead ends: 1068 [2022-01-31 21:18:22,286 INFO L226 Difference]: Without dead ends: 932 [2022-01-31 21:18:22,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=483, Invalid=1679, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 21:18:22,287 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 339 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:22,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 82 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:18:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-01-31 21:18:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 376. [2022-01-31 21:18:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 371 states have (on average 1.3153638814016173) internal successors, (488), 371 states have internal predecessors, (488), 3 states have call successors, (3), 3 states have call 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:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 492 transitions. [2022-01-31 21:18:22,641 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 492 transitions. Word has length 43 [2022-01-31 21:18:22,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:22,641 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 492 transitions. [2022-01-31 21:18:22,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 492 transitions. [2022-01-31 21:18:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:18:22,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:22,642 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, 1, 1] [2022-01-31 21:18:22,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 21:18:22,642 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:22,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1648751236, now seen corresponding path program 15 times [2022-01-31 21:18:22,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:22,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543491029] [2022-01-31 21:18:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:22,669 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:22,669 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:22,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:22,672 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:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:22,683 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:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:18:23,259 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:23,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [543491029] [2022-01-31 21:18:23,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [543491029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:23,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:23,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:18:23,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823599849] [2022-01-31 21:18:23,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:23,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:18:23,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:23,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:18:23,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:18:23,261 INFO L87 Difference]: Start difference. First operand 376 states and 492 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:27,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:27,569 INFO L93 Difference]: Finished difference Result 1102 states and 1553 transitions. [2022-01-31 21:18:27,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 21:18:27,569 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:27,572 INFO L225 Difference]: With dead ends: 1102 [2022-01-31 21:18:27,572 INFO L226 Difference]: Without dead ends: 966 [2022-01-31 21:18:27,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 21:18:27,572 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 269 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:27,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 108 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:18:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-01-31 21:18:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 389. [2022-01-31 21:18:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.3177083333333333) internal successors, (506), 384 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call 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:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 510 transitions. [2022-01-31 21:18:27,952 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 510 transitions. Word has length 44 [2022-01-31 21:18:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:27,952 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 510 transitions. [2022-01-31 21:18:27,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 510 transitions. [2022-01-31 21:18:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 21:18:27,953 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:27,953 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, 1, 1] [2022-01-31 21:18:27,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 21:18:27,953 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:27,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash -865152440, now seen corresponding path program 16 times [2022-01-31 21:18:27,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:27,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1301619537] [2022-01-31 21:18:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:28,253 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,253 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:28,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:28,256 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:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:28,272 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:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:28,418 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:28,627 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:28,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1301619537] [2022-01-31 21:18:28,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1301619537] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:28,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:28,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:18:28,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750894920] [2022-01-31 21:18:28,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:28,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:18:28,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:28,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:18:28,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:18:28,628 INFO L87 Difference]: Start difference. First operand 389 states and 510 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:34,510 INFO L93 Difference]: Finished difference Result 759 states and 996 transitions. [2022-01-31 21:18:34,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-31 21:18:34,511 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:34,513 INFO L225 Difference]: With dead ends: 759 [2022-01-31 21:18:34,513 INFO L226 Difference]: Without dead ends: 738 [2022-01-31 21:18:34,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2230 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1061, Invalid=6079, Unknown=0, NotChecked=0, Total=7140 [2022-01-31 21:18:34,515 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 104 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:34,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 72 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-01-31 21:18:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-01-31 21:18:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 438. [2022-01-31 21:18:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.3233256351039262) internal successors, (573), 433 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call 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:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 577 transitions. [2022-01-31 21:18:34,966 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 577 transitions. Word has length 45 [2022-01-31 21:18:34,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:34,967 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 577 transitions. [2022-01-31 21:18:34,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 577 transitions. [2022-01-31 21:18:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:18:34,967 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:34,968 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, 1, 1] [2022-01-31 21:18:34,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 21:18:34,968 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:34,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:34,968 INFO L85 PathProgramCache]: Analyzing trace with hash -762277995, now seen corresponding path program 21 times [2022-01-31 21:18:34,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:34,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1954641427] [2022-01-31 21:18:34,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:35,039 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,040 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:35,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:35,043 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:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:35,076 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_51.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:35,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:35,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:18:35,604 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:35,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1954641427] [2022-01-31 21:18:35,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1954641427] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:35,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:35,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:18:35,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471254192] [2022-01-31 21:18:35,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:35,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:18:35,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:35,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:18:35,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:18:35,606 INFO L87 Difference]: Start difference. First operand 438 states and 577 transitions. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:38,949 INFO L93 Difference]: Finished difference Result 739 states and 908 transitions. [2022-01-31 21:18:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 21:18:38,950 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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 46 [2022-01-31 21:18:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:38,952 INFO L225 Difference]: With dead ends: 739 [2022-01-31 21:18:38,952 INFO L226 Difference]: Without dead ends: 715 [2022-01-31 21:18:38,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=293, Invalid=1963, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 21:18:38,953 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:38,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 87 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 21:18:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-01-31 21:18:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 438. [2022-01-31 21:18:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.3210161662817552) internal successors, (572), 433 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call 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:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 576 transitions. [2022-01-31 21:18:39,409 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 576 transitions. Word has length 46 [2022-01-31 21:18:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:39,409 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 576 transitions. [2022-01-31 21:18:39,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 576 transitions. [2022-01-31 21:18:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:18:39,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:39,410 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, 1] [2022-01-31 21:18:39,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 21:18:39,410 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:39,411 INFO L85 PathProgramCache]: Analyzing trace with hash -225429739, now seen corresponding path program 17 times [2022-01-31 21:18:39,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:39,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1812204784] [2022-01-31 21:18:39,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:39,485 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:39,486 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:39,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:39,489 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:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:39,506 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_52.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:39,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:39,710 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:40,128 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:40,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1812204784] [2022-01-31 21:18:40,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1812204784] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:40,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:40,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:18:40,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005672698] [2022-01-31 21:18:40,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:40,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:18:40,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:40,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:18:40,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:18:40,129 INFO L87 Difference]: Start difference. First operand 438 states and 576 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 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:18:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:49,804 INFO L93 Difference]: Finished difference Result 1178 states and 1498 transitions. [2022-01-31 21:18:49,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-01-31 21:18:49,804 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 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:18:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:49,806 INFO L225 Difference]: With dead ends: 1178 [2022-01-31 21:18:49,806 INFO L226 Difference]: Without dead ends: 775 [2022-01-31 21:18:49,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3820 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1107, Invalid=10883, Unknown=0, NotChecked=0, Total=11990 [2022-01-31 21:18:49,820 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 165 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 2206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:49,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 117 Invalid, 2206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-01-31 21:18:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-01-31 21:18:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 467. [2022-01-31 21:18:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 462 states have (on average 1.2965367965367964) internal successors, (599), 462 states have internal predecessors, (599), 3 states have call successors, (3), 3 states have call 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:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 603 transitions. [2022-01-31 21:18:50,350 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 603 transitions. Word has length 46 [2022-01-31 21:18:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:50,350 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 603 transitions. [2022-01-31 21:18:50,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 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:18:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 603 transitions. [2022-01-31 21:18:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:18:50,351 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:50,351 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:50,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 21:18:50,351 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1284526650, now seen corresponding path program 22 times [2022-01-31 21:18:50,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:50,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1368505185] [2022-01-31 21:18:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:50,383 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:50,384 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:50,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:50,387 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:18:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:50,402 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:18:50,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:18:50,691 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:50,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1368505185] [2022-01-31 21:18:50,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1368505185] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:50,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:50,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:18:50,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279904967] [2022-01-31 21:18:50,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:50,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:18:50,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:50,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:18:50,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:18:50,692 INFO L87 Difference]: Start difference. First operand 467 states and 603 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 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:18:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:52,779 INFO L93 Difference]: Finished difference Result 779 states and 999 transitions. [2022-01-31 21:18:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:18:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 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 47 [2022-01-31 21:18:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:52,781 INFO L225 Difference]: With dead ends: 779 [2022-01-31 21:18:52,782 INFO L226 Difference]: Without dead ends: 768 [2022-01-31 21:18:52,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:18:52,788 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 146 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:52,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 53 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:18:52,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-01-31 21:18:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 486. [2022-01-31 21:18:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 481 states have (on average 1.3014553014553014) internal successors, (626), 481 states have internal predecessors, (626), 3 states have call successors, (3), 3 states have call 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:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 630 transitions. [2022-01-31 21:18:53,319 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 630 transitions. Word has length 47 [2022-01-31 21:18:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:53,319 INFO L470 AbstractCegarLoop]: Abstraction has 486 states and 630 transitions. [2022-01-31 21:18:53,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 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:18:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 630 transitions. [2022-01-31 21:18:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:18:53,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:53,327 INFO L514 BasicCegarLoop]: trace histogram [13, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:53,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 21:18:53,327 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:53,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:53,327 INFO L85 PathProgramCache]: Analyzing trace with hash 98816088, now seen corresponding path program 23 times [2022-01-31 21:18:53,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:53,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985572544] [2022-01-31 21:18:53,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:53,354 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:53,355 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:53,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:53,357 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:18:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:53,369 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:18:53,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:18:54,446 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:54,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1985572544] [2022-01-31 21:18:54,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1985572544] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:54,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:54,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:18:54,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256703605] [2022-01-31 21:18:54,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:54,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:18:54,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:54,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:18:54,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:18:54,447 INFO L87 Difference]: Start difference. First operand 486 states and 630 transitions. Second operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 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:19:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:02,109 INFO L93 Difference]: Finished difference Result 1472 states and 2074 transitions. [2022-01-31 21:19:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 21:19:02,109 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 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 47 [2022-01-31 21:19:02,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:02,112 INFO L225 Difference]: With dead ends: 1472 [2022-01-31 21:19:02,112 INFO L226 Difference]: Without dead ends: 1294 [2022-01-31 21:19:02,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=624, Invalid=2238, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 21:19:02,113 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 375 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:02,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 134 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-31 21:19:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-01-31 21:19:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 502. [2022-01-31 21:19:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 497 states have (on average 1.3058350100603622) internal successors, (649), 497 states have internal predecessors, (649), 3 states have call successors, (3), 3 states have call 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:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 653 transitions. [2022-01-31 21:19:02,719 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 653 transitions. Word has length 47 [2022-01-31 21:19:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:02,720 INFO L470 AbstractCegarLoop]: Abstraction has 502 states and 653 transitions. [2022-01-31 21:19:02,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 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:19:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 653 transitions. [2022-01-31 21:19:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:19:02,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:02,725 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:19:02,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 21:19:02,725 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:02,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:02,725 INFO L85 PathProgramCache]: Analyzing trace with hash -951155067, now seen corresponding path program 24 times [2022-01-31 21:19:02,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:02,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [130391306] [2022-01-31 21:19:02,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:02,855 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:02,856 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:02,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:02,859 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:19:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:02,905 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_55.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:02,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:02,970 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:03,116 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:03,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [130391306] [2022-01-31 21:19:03,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [130391306] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:03,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:03,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:19:03,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623295667] [2022-01-31 21:19:03,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:03,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:19:03,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:03,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:19:03,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:19:03,117 INFO L87 Difference]: Start difference. First operand 502 states and 653 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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:19:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:05,781 INFO L93 Difference]: Finished difference Result 778 states and 965 transitions. [2022-01-31 21:19:05,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 21:19:05,781 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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 48 [2022-01-31 21:19:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:05,783 INFO L225 Difference]: With dead ends: 778 [2022-01-31 21:19:05,783 INFO L226 Difference]: Without dead ends: 730 [2022-01-31 21:19:05,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=357, Invalid=1713, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 21:19:05,783 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 48 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:05,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 72 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:19:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2022-01-31 21:19:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 496. [2022-01-31 21:19:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 491 states have (on average 1.3034623217922607) internal successors, (640), 491 states have internal predecessors, (640), 3 states have call successors, (3), 3 states have call 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:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 644 transitions. [2022-01-31 21:19:06,378 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 644 transitions. Word has length 48 [2022-01-31 21:19:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:06,379 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 644 transitions. [2022-01-31 21:19:06,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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:19:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 644 transitions. [2022-01-31 21:19:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:19:06,379 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:06,380 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, 1, 1] [2022-01-31 21:19:06,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 21:19:06,380 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:06,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash -356064970, now seen corresponding path program 25 times [2022-01-31 21:19:06,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:06,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2107074898] [2022-01-31 21:19:06,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:06,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:19:06,440 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:06,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:06,443 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:19:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:06,462 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:19:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:19:07,460 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:07,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2107074898] [2022-01-31 21:19:07,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2107074898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:07,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:07,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:19:07,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18255083] [2022-01-31 21:19:07,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:07,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:19:07,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:07,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:19:07,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:19:07,461 INFO L87 Difference]: Start difference. First operand 496 states and 644 transitions. Second operand has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 25 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:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:15,307 INFO L93 Difference]: Finished difference Result 1514 states and 2126 transitions. [2022-01-31 21:19:15,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 21:19:15,308 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 25 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 48 [2022-01-31 21:19:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:15,311 INFO L225 Difference]: With dead ends: 1514 [2022-01-31 21:19:15,311 INFO L226 Difference]: Without dead ends: 1323 [2022-01-31 21:19:15,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=651, Invalid=2429, Unknown=0, NotChecked=0, Total=3080 [2022-01-31 21:19:15,312 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 367 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 2206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:15,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 107 Invalid, 2206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-31 21:19:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-01-31 21:19:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 511. [2022-01-31 21:19:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 506 states have (on average 1.3063241106719368) internal successors, (661), 506 states have internal predecessors, (661), 3 states have call successors, (3), 3 states have call 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:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 665 transitions. [2022-01-31 21:19:15,929 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 665 transitions. Word has length 48 [2022-01-31 21:19:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:15,929 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 665 transitions. [2022-01-31 21:19:15,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 25 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:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 665 transitions. [2022-01-31 21:19:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:19:15,930 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:15,930 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, 1, 1] [2022-01-31 21:19:15,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-31 21:19:15,930 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:15,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1453251912, now seen corresponding path program 26 times [2022-01-31 21:19:15,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:15,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [698039724] [2022-01-31 21:19:15,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:15,955 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:15,956 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:15,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:15,959 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:19:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:15,986 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:19:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:16,175 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:16,638 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:16,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [698039724] [2022-01-31 21:19:16,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [698039724] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:16,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:16,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:19:16,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231731011] [2022-01-31 21:19:16,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:16,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:19:16,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:16,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:19:16,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:19:16,639 INFO L87 Difference]: Start difference. First operand 511 states and 665 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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:19:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:20,455 INFO L93 Difference]: Finished difference Result 847 states and 1040 transitions. [2022-01-31 21:19:20,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:19:20,455 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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 49 [2022-01-31 21:19:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:20,457 INFO L225 Difference]: With dead ends: 847 [2022-01-31 21:19:20,457 INFO L226 Difference]: Without dead ends: 753 [2022-01-31 21:19:20,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=403, Invalid=1853, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 21:19:20,458 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:20,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 50 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 21:19:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-01-31 21:19:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 461. [2022-01-31 21:19:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 456 states have (on average 1.3004385964912282) internal successors, (593), 456 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call 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:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 597 transitions. [2022-01-31 21:19:21,040 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 597 transitions. Word has length 49 [2022-01-31 21:19:21,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:21,040 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 597 transitions. [2022-01-31 21:19:21,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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:19:21,040 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 597 transitions. [2022-01-31 21:19:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:19:21,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:21,055 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, 1] [2022-01-31 21:19:21,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-31 21:19:21,055 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:21,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash -227583304, now seen corresponding path program 18 times [2022-01-31 21:19:21,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:21,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908548255] [2022-01-31 21:19:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:21,092 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:21,092 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:21,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:21,102 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:19:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:21,161 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:19:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:21,441 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:22,150 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:22,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908548255] [2022-01-31 21:19:22,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [908548255] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:22,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:22,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-31 21:19:22,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570203819] [2022-01-31 21:19:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:22,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 21:19:22,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:22,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 21:19:22,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:19:22,151 INFO L87 Difference]: Start difference. First operand 461 states and 597 transitions. Second operand has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 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:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:48,176 INFO L93 Difference]: Finished difference Result 944 states and 1205 transitions. [2022-01-31 21:19:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-01-31 21:19:48,176 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 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 49 [2022-01-31 21:19:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:48,179 INFO L225 Difference]: With dead ends: 944 [2022-01-31 21:19:48,179 INFO L226 Difference]: Without dead ends: 920 [2022-01-31 21:19:48,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6119 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=1777, Invalid=16853, Unknown=2, NotChecked=0, Total=18632 [2022-01-31 21:19:48,180 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 97 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:48,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 104 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-01-31 21:19:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-01-31 21:19:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 514. [2022-01-31 21:19:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 509 states have (on average 1.306483300589391) internal successors, (665), 509 states have internal predecessors, (665), 3 states have call successors, (3), 3 states have call 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:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 669 transitions. [2022-01-31 21:19:48,861 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 669 transitions. Word has length 49 [2022-01-31 21:19:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:48,861 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 669 transitions. [2022-01-31 21:19:48,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 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:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 669 transitions. [2022-01-31 21:19:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:19:48,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:48,862 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, 1] [2022-01-31 21:19:48,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-31 21:19:48,862 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash -801586393, now seen corresponding path program 19 times [2022-01-31 21:19:48,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:48,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [202522800] [2022-01-31 21:19:48,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:48,912 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:48,913 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:48,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:48,916 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:19:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:48,941 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:19:49,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:49,049 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:49,487 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:49,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [202522800] [2022-01-31 21:19:49,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [202522800] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:49,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:49,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:19:49,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273951421] [2022-01-31 21:19:49,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:49,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:19:49,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:49,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:19:49,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:19:49,488 INFO L87 Difference]: Start difference. First operand 514 states and 669 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 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:20:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:02,161 INFO L93 Difference]: Finished difference Result 1034 states and 1278 transitions. [2022-01-31 21:20:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-31 21:20:02,162 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 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 50 [2022-01-31 21:20:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:02,164 INFO L225 Difference]: With dead ends: 1034 [2022-01-31 21:20:02,164 INFO L226 Difference]: Without dead ends: 1011 [2022-01-31 21:20:02,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2682 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1054, Invalid=8066, Unknown=0, NotChecked=0, Total=9120 [2022-01-31 21:20:02,177 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 117 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:02,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-01-31 21:20:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-01-31 21:20:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 545. [2022-01-31 21:20:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 540 states have (on average 1.3240740740740742) internal successors, (715), 540 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call 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:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 719 transitions. [2022-01-31 21:20:02,892 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 719 transitions. Word has length 50 [2022-01-31 21:20:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:02,893 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 719 transitions. [2022-01-31 21:20:02,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 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:20:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 719 transitions. [2022-01-31 21:20:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:20:02,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:02,893 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, 1, 1] [2022-01-31 21:20:02,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 21:20:02,894 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:02,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:02,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2142860360, now seen corresponding path program 27 times [2022-01-31 21:20:02,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:02,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435806193] [2022-01-31 21:20:02,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:02,918 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:02,919 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:02,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:02,922 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:20:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:02,946 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_60.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:03,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:03,135 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:03,686 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:03,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435806193] [2022-01-31 21:20:03,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1435806193] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:03,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:03,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 21:20:03,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966485324] [2022-01-31 21:20:03,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:03,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 21:20:03,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:03,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 21:20:03,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:20:03,687 INFO L87 Difference]: Start difference. First operand 545 states and 719 transitions. Second operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 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,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:07,765 INFO L93 Difference]: Finished difference Result 995 states and 1209 transitions. [2022-01-31 21:20:07,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 21:20:07,767 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 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 51 [2022-01-31 21:20:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:07,769 INFO L225 Difference]: With dead ends: 995 [2022-01-31 21:20:07,769 INFO L226 Difference]: Without dead ends: 892 [2022-01-31 21:20:07,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=417, Invalid=2033, Unknown=0, NotChecked=0, Total=2450 [2022-01-31 21:20:07,770 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 72 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:07,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 66 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 21:20:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-01-31 21:20:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 498. [2022-01-31 21:20:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 493 states have (on average 1.3184584178498986) internal successors, (650), 493 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call 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:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 654 transitions. [2022-01-31 21:20:08,421 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 654 transitions. Word has length 51 [2022-01-31 21:20:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:08,421 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 654 transitions. [2022-01-31 21:20:08,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 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:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 654 transitions. [2022-01-31 21:20:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:20:08,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:08,422 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, 1] [2022-01-31 21:20:08,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-31 21:20:08,422 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:08,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:08,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1415812968, now seen corresponding path program 20 times [2022-01-31 21:20:08,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:08,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [65258836] [2022-01-31 21:20:08,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:08,468 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:08,468 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:08,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:08,472 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:20:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:08,494 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:20:08,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:08,744 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:09,485 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:09,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [65258836] [2022-01-31 21:20:09,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [65258836] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:09,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:09,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 21:20:09,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042191026] [2022-01-31 21:20:09,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:09,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 21:20:09,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:09,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 21:20:09,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:20:09,487 INFO L87 Difference]: Start difference. First operand 498 states and 654 transitions. Second operand has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:28,870 INFO L93 Difference]: Finished difference Result 1411 states and 1780 transitions. [2022-01-31 21:20:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-01-31 21:20:28,870 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-01-31 21:20:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:28,874 INFO L225 Difference]: With dead ends: 1411 [2022-01-31 21:20:28,874 INFO L226 Difference]: Without dead ends: 952 [2022-01-31 21:20:28,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5947 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1515, Invalid=16307, Unknown=0, NotChecked=0, Total=17822 [2022-01-31 21:20:28,876 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 167 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:28,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 131 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-01-31 21:20:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-01-31 21:20:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 490. [2022-01-31 21:20:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.3175257731958763) internal successors, (639), 485 states have internal predecessors, (639), 3 states have call successors, (3), 3 states have call 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:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 643 transitions. [2022-01-31 21:20:29,543 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 643 transitions. Word has length 51 [2022-01-31 21:20:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:29,543 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 643 transitions. [2022-01-31 21:20:29,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 643 transitions. [2022-01-31 21:20:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:20:29,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:29,544 INFO L514 BasicCegarLoop]: trace histogram [15, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:20:29,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-31 21:20:29,544 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:29,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash 606738005, now seen corresponding path program 21 times [2022-01-31 21:20:29,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:29,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2055903734] [2022-01-31 21:20:29,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:29,576 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:29,577 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:29,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:29,580 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:20:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:29,601 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_62.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:29,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:29,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:20:31,138 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:31,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2055903734] [2022-01-31 21:20:31,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2055903734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:31,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:31,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 21:20:31,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824913430] [2022-01-31 21:20:31,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:31,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 21:20:31,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:31,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 21:20:31,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:20:31,140 INFO L87 Difference]: Start difference. First operand 490 states and 643 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:20:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:43,211 INFO L93 Difference]: Finished difference Result 1732 states and 2454 transitions. [2022-01-31 21:20:43,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-31 21:20:43,211 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 52 [2022-01-31 21:20:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:43,215 INFO L225 Difference]: With dead ends: 1732 [2022-01-31 21:20:43,215 INFO L226 Difference]: Without dead ends: 1560 [2022-01-31 21:20:43,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=783, Invalid=2877, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 21:20:43,216 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 557 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:43,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 118 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-01-31 21:20:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2022-01-31 21:20:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 508. [2022-01-31 21:20:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 503 states have (on average 1.320079522862823) internal successors, (664), 503 states have internal predecessors, (664), 3 states have call successors, (3), 3 states have call 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:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 668 transitions. [2022-01-31 21:20:43,931 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 668 transitions. Word has length 52 [2022-01-31 21:20:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:43,932 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 668 transitions. [2022-01-31 21:20:43,932 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:20:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 668 transitions. [2022-01-31 21:20:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:20:43,932 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:43,932 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:20:43,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-31 21:20:43,932 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:43,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash -43081415, now seen corresponding path program 28 times [2022-01-31 21:20:43,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:43,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1359929497] [2022-01-31 21:20:43,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:44,008 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:44,008 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:44,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:44,011 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_63.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:44,032 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_63.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:44,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:44,143 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:44,450 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:44,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1359929497] [2022-01-31 21:20:44,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1359929497] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:44,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:44,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:20:44,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710030926] [2022-01-31 21:20:44,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:44,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:20:44,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:44,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:20:44,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:20:44,451 INFO L87 Difference]: Start difference. First operand 508 states and 668 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:47,935 INFO L93 Difference]: Finished difference Result 957 states and 1226 transitions. [2022-01-31 21:20:47,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:20:47,935 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-01-31 21:20:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:47,937 INFO L225 Difference]: With dead ends: 957 [2022-01-31 21:20:47,937 INFO L226 Difference]: Without dead ends: 916 [2022-01-31 21:20:47,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 21:20:47,938 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 154 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:47,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 56 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:20:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2022-01-31 21:20:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 511. [2022-01-31 21:20:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 506 states have (on average 1.3300395256916997) internal successors, (673), 506 states have internal predecessors, (673), 3 states have call successors, (3), 3 states have call 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:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 677 transitions. [2022-01-31 21:20:48,694 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 677 transitions. Word has length 53 [2022-01-31 21:20:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:48,694 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 677 transitions. [2022-01-31 21:20:48,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 677 transitions. [2022-01-31 21:20:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:20:48,694 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:48,695 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:20:48,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-31 21:20:48,695 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:48,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1030959415, now seen corresponding path program 6 times [2022-01-31 21:20:48,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:48,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1528900152] [2022-01-31 21:20:48,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:48,737 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:48,737 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:48,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:48,740 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_64.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:48,791 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_64.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:49,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:49,026 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:49,876 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:49,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1528900152] [2022-01-31 21:20:49,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1528900152] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:49,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:49,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-01-31 21:20:49,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389309225] [2022-01-31 21:20:49,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:49,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 21:20:49,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 21:20:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:20:49,877 INFO L87 Difference]: Start difference. First operand 511 states and 677 transitions. Second operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:21:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:21:07,136 INFO L93 Difference]: Finished difference Result 1108 states and 1408 transitions. [2022-01-31 21:21:07,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-01-31 21:21:07,137 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:21:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:21:07,139 INFO L225 Difference]: With dead ends: 1108 [2022-01-31 21:21:07,139 INFO L226 Difference]: Without dead ends: 1081 [2022-01-31 21:21:07,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4582 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1809, Invalid=11997, Unknown=0, NotChecked=0, Total=13806 [2022-01-31 21:21:07,140 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 129 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:21:07,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 75 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-01-31 21:21:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-01-31 21:21:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 585. [2022-01-31 21:21:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 580 states have (on average 1.2879310344827586) internal successors, (747), 580 states have internal predecessors, (747), 3 states have call successors, (3), 3 states have call 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:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 751 transitions. [2022-01-31 21:21:08,088 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 751 transitions. Word has length 53 [2022-01-31 21:21:08,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:21:08,088 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 751 transitions. [2022-01-31 21:21:08,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:21:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 751 transitions. [2022-01-31 21:21:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:21:08,088 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:21:08,089 INFO L514 BasicCegarLoop]: trace histogram [16, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:21:08,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-31 21:21:08,089 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:21:08,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:21:08,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1868062311, now seen corresponding path program 22 times [2022-01-31 21:21:08,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:21:08,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [210530459] [2022-01-31 21:21:08,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:21:08,122 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:21:08,122 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:21:08,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:21:08,125 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_65.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:21:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:21:08,143 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_65.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:21:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:21:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:21:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:21:09,990 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:21:09,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [210530459] [2022-01-31 21:21:09,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [210530459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:21:09,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:21:09,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-31 21:21:09,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576219663] [2022-01-31 21:21:09,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:21:09,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 21:21:09,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:21:09,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 21:21:09,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:21:09,991 INFO L87 Difference]: Start difference. First operand 585 states and 751 transitions. Second operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:21:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:21:22,317 INFO L93 Difference]: Finished difference Result 1927 states and 2669 transitions. [2022-01-31 21:21:22,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 21:21:22,317 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-01-31 21:21:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:21:22,341 INFO L225 Difference]: With dead ends: 1927 [2022-01-31 21:21:22,341 INFO L226 Difference]: Without dead ends: 1656 [2022-01-31 21:21:22,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=813, Invalid=3093, Unknown=0, NotChecked=0, Total=3906 [2022-01-31 21:21:22,347 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 426 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2649 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 2649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:21:22,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 126 Invalid, 3073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 2649 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-01-31 21:21:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-01-31 21:21:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 602. [2022-01-31 21:21:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 597 states have (on average 1.289782244556114) internal successors, (770), 597 states have internal predecessors, (770), 3 states have call successors, (3), 3 states have call 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:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 774 transitions. [2022-01-31 21:21:23,355 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 774 transitions. Word has length 53 [2022-01-31 21:21:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:21:23,355 INFO L470 AbstractCegarLoop]: Abstraction has 602 states and 774 transitions. [2022-01-31 21:21:23,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:21:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 774 transitions. [2022-01-31 21:21:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 21:21:23,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:21:23,356 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, 1] [2022-01-31 21:21:23,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-01-31 21:21:23,356 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:21:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:21:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash -184078635, now seen corresponding path program 23 times [2022-01-31 21:21:23,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:21:23,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [762190016] [2022-01-31 21:21:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:21:23,417 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:21:23,417 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:21:23,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:21:23,420 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_66.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:21:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:21:23,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_66.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:21:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:21:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:21:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:21:25,389 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:21:25,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [762190016] [2022-01-31 21:21:25,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [762190016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:21:25,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:21:25,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 21:21:25,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359815970] [2022-01-31 21:21:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:21:25,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 21:21:25,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:21:25,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 21:21:25,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:21:25,390 INFO L87 Difference]: Start difference. First operand 602 states and 774 transitions. Second operand has 31 states, 31 states have (on average 1.3548387096774193) 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:22:04,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:04,604 INFO L93 Difference]: Finished difference Result 1718 states and 2127 transitions. [2022-01-31 21:22:04,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-01-31 21:22:04,605 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.3548387096774193) 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 54 [2022-01-31 21:22:04,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:04,607 INFO L225 Difference]: With dead ends: 1718 [2022-01-31 21:22:04,607 INFO L226 Difference]: Without dead ends: 1168 [2022-01-31 21:22:04,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8669 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=2002, Invalid=23120, Unknown=0, NotChecked=0, Total=25122 [2022-01-31 21:22:04,608 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 170 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 3071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:04,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 151 Invalid, 3071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2022-01-31 21:22:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-01-31 21:22:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 593. [2022-01-31 21:22:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 588 states have (on average 1.2755102040816326) internal successors, (750), 588 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call 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:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 754 transitions. [2022-01-31 21:22:05,620 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 754 transitions. Word has length 54 [2022-01-31 21:22:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:05,620 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 754 transitions. [2022-01-31 21:22:05,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.3548387096774193) 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:22:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 754 transitions. [2022-01-31 21:22:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:22:05,621 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:05,621 INFO L514 BasicCegarLoop]: trace histogram [17, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:05,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-01-31 21:22:05,621 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:05,621 INFO L85 PathProgramCache]: Analyzing trace with hash -190363496, now seen corresponding path program 24 times [2022-01-31 21:22:05,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:05,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491681496] [2022-01-31 21:22:05,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:05,657 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:05,657 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:05,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:05,660 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_67.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:22:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:05,679 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_67.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:22:06,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:06,042 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:08,884 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:08,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491681496] [2022-01-31 21:22:08,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1491681496] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:08,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:08,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 21:22:08,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713346176] [2022-01-31 21:22:08,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:08,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 21:22:08,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 21:22:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=671, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:22:08,885 INFO L87 Difference]: Start difference. First operand 593 states and 754 transitions. Second operand has 31 states, 31 states have (on average 1.3548387096774193) 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:22:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:24,438 INFO L93 Difference]: Finished difference Result 2058 states and 2873 transitions. [2022-01-31 21:22:24,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 21:22:24,438 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.3548387096774193) 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 55 [2022-01-31 21:22:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:24,442 INFO L225 Difference]: With dead ends: 2058 [2022-01-31 21:22:24,442 INFO L226 Difference]: Without dead ends: 1806 [2022-01-31 21:22:24,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=960, Invalid=3596, Unknown=0, NotChecked=0, Total=4556 [2022-01-31 21:22:24,443 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 519 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 3202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:24,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [519 Valid, 122 Invalid, 3202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 2686 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-01-31 21:22:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-01-31 21:22:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 611. [2022-01-31 21:22:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 606 states have (on average 1.278877887788779) internal successors, (775), 606 states have internal predecessors, (775), 3 states have call successors, (3), 3 states have call 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:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 779 transitions. [2022-01-31 21:22:25,483 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 779 transitions. Word has length 55 [2022-01-31 21:22:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:25,483 INFO L470 AbstractCegarLoop]: Abstraction has 611 states and 779 transitions. [2022-01-31 21:22:25,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.3548387096774193) 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:22:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 779 transitions. [2022-01-31 21:22:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:22:25,484 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:25,484 INFO L514 BasicCegarLoop]: trace histogram [18, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:25,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-01-31 21:22:25,484 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash -808405066, now seen corresponding path program 25 times [2022-01-31 21:22:25,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:25,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1076977101] [2022-01-31 21:22:25,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:25,527 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:25,527 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:25,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:25,530 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_68.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:22:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:25,550 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_68.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:22:25,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:25,866 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:28,334 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:28,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1076977101] [2022-01-31 21:22:28,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1076977101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:28,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:28,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 21:22:28,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371965258] [2022-01-31 21:22:28,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:28,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 21:22:28,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:28,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 21:22:28,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=722, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:22:28,336 INFO L87 Difference]: Start difference. First operand 611 states and 779 transitions. Second operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:46,727 INFO L93 Difference]: Finished difference Result 2101 states and 2933 transitions. [2022-01-31 21:22:46,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 21:22:46,728 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-01-31 21:22:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:46,730 INFO L225 Difference]: With dead ends: 2101 [2022-01-31 21:22:46,730 INFO L226 Difference]: Without dead ends: 1849 [2022-01-31 21:22:46,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=993, Invalid=3837, Unknown=0, NotChecked=0, Total=4830 [2022-01-31 21:22:46,731 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 461 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3316 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 3316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:46,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 138 Invalid, 3777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 3316 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-01-31 21:22:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2022-01-31 21:22:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 628. [2022-01-31 21:22:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 623 states have (on average 1.2808988764044944) internal successors, (798), 623 states have internal predecessors, (798), 3 states have call successors, (3), 3 states have call 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:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 802 transitions. [2022-01-31 21:22:47,852 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 802 transitions. Word has length 56 [2022-01-31 21:22:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:47,852 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 802 transitions. [2022-01-31 21:22:47,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 802 transitions. [2022-01-31 21:22:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 21:22:47,853 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:47,853 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:47,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-01-31 21:22:47,853 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:47,853 INFO L85 PathProgramCache]: Analyzing trace with hash 315217848, now seen corresponding path program 26 times [2022-01-31 21:22:47,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:47,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913946233] [2022-01-31 21:22:47,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:47,900 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:47,901 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:47,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:47,904 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_69.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:22:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:47,935 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_69.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:22:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:49,287 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:49,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913946233] [2022-01-31 21:22:49,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1913946233] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:49,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:49,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 21:22:49,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249295112] [2022-01-31 21:22:49,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:49,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 21:22:49,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 21:22:49,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:22:49,289 INFO L87 Difference]: Start difference. First operand 628 states and 802 transitions. Second operand has 32 states, 32 states have (on average 1.375) internal successors, (44), 31 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:27,737 INFO L93 Difference]: Finished difference Result 1530 states and 1896 transitions. [2022-01-31 21:23:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-01-31 21:23:27,737 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.375) internal successors, (44), 31 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-01-31 21:23:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:27,739 INFO L225 Difference]: With dead ends: 1530 [2022-01-31 21:23:27,739 INFO L226 Difference]: Without dead ends: 1508 [2022-01-31 21:23:27,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7237 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=2520, Invalid=18072, Unknown=0, NotChecked=0, Total=20592 [2022-01-31 21:23:27,740 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 192 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:27,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 51 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 18.9s Time] [2022-01-31 21:23:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-01-31 21:23:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 679. [2022-01-31 21:23:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 674 states have (on average 1.2908011869436202) internal successors, (870), 674 states have internal predecessors, (870), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 874 transitions. [2022-01-31 21:23:29,021 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 874 transitions. Word has length 57 [2022-01-31 21:23:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:29,021 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 874 transitions. [2022-01-31 21:23:29,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.375) internal successors, (44), 31 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 874 transitions. [2022-01-31 21:23:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:23:29,022 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:29,022 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:29,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-01-31 21:23:29,022 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:29,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash -303599690, now seen corresponding path program 7 times [2022-01-31 21:23:29,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:29,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1956428482] [2022-01-31 21:23:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:29,062 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:29,062 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:23:29,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:29,065 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_70.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:23:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:29,096 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_70.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:23:29,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:29,324 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:30,961 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:30,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1956428482] [2022-01-31 21:23:30,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1956428482] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:30,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:30,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-31 21:23:30,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074401448] [2022-01-31 21:23:30,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:30,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 21:23:30,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:30,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 21:23:30,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:23:30,962 INFO L87 Difference]: Start difference. First operand 679 states and 874 transitions. Second operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:35,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:23:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:43,282 INFO L93 Difference]: Finished difference Result 1448 states and 1711 transitions. [2022-01-31 21:23:43,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 21:23:43,282 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-01-31 21:23:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:43,284 INFO L225 Difference]: With dead ends: 1448 [2022-01-31 21:23:43,284 INFO L226 Difference]: Without dead ends: 1333 [2022-01-31 21:23:43,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=683, Invalid=3477, Unknown=0, NotChecked=0, Total=4160 [2022-01-31 21:23:43,285 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 72 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:43,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 85 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-01-31 21:23:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2022-01-31 21:23:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 642. [2022-01-31 21:23:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 637 states have (on average 1.2762951334379906) internal successors, (813), 637 states have internal predecessors, (813), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 817 transitions. [2022-01-31 21:23:44,503 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 817 transitions. Word has length 58 [2022-01-31 21:23:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:44,503 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 817 transitions. [2022-01-31 21:23:44,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 817 transitions. [2022-01-31 21:23:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:23:44,504 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:44,504 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:44,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-01-31 21:23:44,504 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1471734297, now seen corresponding path program 27 times [2022-01-31 21:23:44,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:44,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1154236664] [2022-01-31 21:23:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:44,533 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:44,533 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:23:44,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:44,537 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_71.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:23:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:44,588 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_71.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:23:45,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:45,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:23:48,084 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:48,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1154236664] [2022-01-31 21:23:48,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1154236664] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:48,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:48,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-31 21:23:48,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65538948] [2022-01-31 21:23:48,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:48,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 21:23:48,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 21:23:48,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 21:23:48,086 INFO L87 Difference]: Start difference. First operand 642 states and 817 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 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:24:30,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:24:42,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:24:48,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:24:53,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:25:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:55,499 INFO L93 Difference]: Finished difference Result 2277 states and 2827 transitions. [2022-01-31 21:25:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-01-31 21:25:55,500 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-01-31 21:25:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:55,502 INFO L225 Difference]: With dead ends: 2277 [2022-01-31 21:25:55,502 INFO L226 Difference]: Without dead ends: 1681 [2022-01-31 21:25:55,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16811 ImplicationChecksByTransitivity, 72.0s TimeCoverageRelationStatistics Valid=3204, Invalid=41526, Unknown=2, NotChecked=0, Total=44732 [2022-01-31 21:25:55,504 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 287 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 3846 mSolverCounterSat, 662 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 4510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 3846 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:55,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 161 Invalid, 4510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [662 Valid, 3846 Invalid, 2 Unknown, 0 Unchecked, 54.3s Time] [2022-01-31 21:25:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2022-01-31 21:25:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 868. [2022-01-31 21:25:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 863 states have (on average 1.2375434530706837) internal successors, (1068), 863 states have internal predecessors, (1068), 3 states have call successors, (3), 3 states have call 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:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1072 transitions. [2022-01-31 21:25:57,091 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1072 transitions. Word has length 58 [2022-01-31 21:25:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:57,091 INFO L470 AbstractCegarLoop]: Abstraction has 868 states and 1072 transitions. [2022-01-31 21:25:57,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 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:25:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1072 transitions. [2022-01-31 21:25:57,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 21:25:57,092 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:57,092 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:25:57,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-01-31 21:25:57,092 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:57,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1136706394, now seen corresponding path program 29 times [2022-01-31 21:25:57,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:57,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042272300] [2022-01-31 21:25:57,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:57,139 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:57,140 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:25:57,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:57,143 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_72.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:25:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:57,176 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_72.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:25:57,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:57,308 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:57,826 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:25:57,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042272300] [2022-01-31 21:25:57,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1042272300] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:25:57,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:25:57,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:25:57,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506642311] [2022-01-31 21:25:57,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:25:57,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:25:57,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:25:57,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:25:57,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:25:57,827 INFO L87 Difference]: Start difference. First operand 868 states and 1072 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:26:04,982 INFO L93 Difference]: Finished difference Result 1528 states and 1891 transitions. [2022-01-31 21:26:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:26:04,982 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-01-31 21:26:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:26:04,984 INFO L225 Difference]: With dead ends: 1528 [2022-01-31 21:26:04,985 INFO L226 Difference]: Without dead ends: 1482 [2022-01-31 21:26:04,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=338, Invalid=994, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 21:26:04,985 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 176 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:26:04,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 69 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 21:26:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2022-01-31 21:26:06,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 860. [2022-01-31 21:26:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 855 states have (on average 1.246783625730994) internal successors, (1066), 855 states have internal predecessors, (1066), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1070 transitions. [2022-01-31 21:26:06,635 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1070 transitions. Word has length 59 [2022-01-31 21:26:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:26:06,635 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 1070 transitions. [2022-01-31 21:26:06,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1070 transitions. [2022-01-31 21:26:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 21:26:06,636 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:26:06,637 INFO L514 BasicCegarLoop]: trace histogram [19, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:26:06,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-01-31 21:26:06,637 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:26:06,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:26:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1987991205, now seen corresponding path program 28 times [2022-01-31 21:26:06,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:26:06,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1621730985] [2022-01-31 21:26:06,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:26:06,676 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:26:06,676 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:26:06,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:26:06,679 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_73.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:26:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:06,704 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_73.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:26:07,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:26:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:26:13,927 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:26:13,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1621730985] [2022-01-31 21:26:13,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1621730985] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:26:13,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:26:13,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-01-31 21:26:13,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691151517] [2022-01-31 21:26:13,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:26:13,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 21:26:13,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:26:13,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 21:26:13,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=846, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:26:13,928 INFO L87 Difference]: Start difference. First operand 860 states and 1070 transitions. Second operand has 35 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 34 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:26:45,648 INFO L93 Difference]: Finished difference Result 2970 states and 4069 transitions. [2022-01-31 21:26:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 21:26:45,649 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 34 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-01-31 21:26:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:26:45,652 INFO L225 Difference]: With dead ends: 2970 [2022-01-31 21:26:45,652 INFO L226 Difference]: Without dead ends: 2656 [2022-01-31 21:26:45,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=1290, Invalid=4716, Unknown=0, NotChecked=0, Total=6006 [2022-01-31 21:26:45,653 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 527 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3492 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 3995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:26:45,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 141 Invalid, 3995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3492 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-01-31 21:26:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2022-01-31 21:26:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 894. [2022-01-31 21:26:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 889 states have (on average 1.249718785151856) internal successors, (1111), 889 states have internal predecessors, (1111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1115 transitions. [2022-01-31 21:26:47,345 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1115 transitions. Word has length 60 [2022-01-31 21:26:47,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:26:47,345 INFO L470 AbstractCegarLoop]: Abstraction has 894 states and 1115 transitions. [2022-01-31 21:26:47,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 34 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1115 transitions. [2022-01-31 21:26:47,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 21:26:47,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:26:47,346 INFO L514 BasicCegarLoop]: trace histogram [20, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:26:47,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-01-31 21:26:47,359 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:26:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:26:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash -550689273, now seen corresponding path program 29 times [2022-01-31 21:26:47,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:26:47,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [324098767] [2022-01-31 21:26:47,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:26:47,388 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:26:47,388 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:26:47,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:26:47,391 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_74.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:26:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:47,420 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_74.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:26:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:26:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:26:55,479 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:26:55,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [324098767] [2022-01-31 21:26:55,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [324098767] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:26:55,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:26:55,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-31 21:26:55,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156063938] [2022-01-31 21:26:55,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:26:55,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 21:26:55,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:26:55,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 21:26:55,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=903, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 21:26:55,481 INFO L87 Difference]: Start difference. First operand 894 states and 1115 transitions. Second operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:27:28,252 INFO L93 Difference]: Finished difference Result 3030 states and 4144 transitions. [2022-01-31 21:27:28,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 21:27:28,253 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-01-31 21:27:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:27:28,270 INFO L225 Difference]: With dead ends: 3030 [2022-01-31 21:27:28,270 INFO L226 Difference]: Without dead ends: 2716 [2022-01-31 21:27:28,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=1329, Invalid=4991, Unknown=0, NotChecked=0, Total=6320 [2022-01-31 21:27:28,271 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 546 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:27:28,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [546 Valid, 157 Invalid, 4486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2022-01-31 21:27:28,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2022-01-31 21:27:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 924. [2022-01-31 21:27:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 919 states have (on average 1.249183895538629) internal successors, (1148), 919 states have internal predecessors, (1148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1152 transitions. [2022-01-31 21:27:30,035 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1152 transitions. Word has length 61 [2022-01-31 21:27:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:27:30,035 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 1152 transitions. [2022-01-31 21:27:30,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1152 transitions. [2022-01-31 21:27:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 21:27:30,037 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:27:30,037 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:27:30,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-01-31 21:27:30,037 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:27:30,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:27:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash 794560549, now seen corresponding path program 30 times [2022-01-31 21:27:30,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:27:30,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [11393553] [2022-01-31 21:27:30,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:27:30,064 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:27:30,064 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:27:30,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:27:30,073 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_75.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:27:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:27:30,114 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_75.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:27:30,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:27:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:27:30,450 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:27:35,415 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:27:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [11393553] [2022-01-31 21:27:35,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [11393553] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:27:35,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:27:35,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-31 21:27:35,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600135077] [2022-01-31 21:27:35,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:27:35,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 21:27:35,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:27:35,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 21:27:35,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=981, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 21:27:35,416 INFO L87 Difference]: Start difference. First operand 924 states and 1152 transitions. Second operand has 36 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 35 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:43,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:27:53,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:28:34,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:28:57,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:29:38,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:30:00,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:30:35,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:30:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:30:38,681 INFO L93 Difference]: Finished difference Result 4157 states and 5401 transitions. [2022-01-31 21:30:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 307 states. [2022-01-31 21:30:38,682 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 35 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-01-31 21:30:38,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:30:38,687 INFO L225 Difference]: With dead ends: 4157 [2022-01-31 21:30:38,688 INFO L226 Difference]: Without dead ends: 4127 [2022-01-31 21:30:38,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50193 ImplicationChecksByTransitivity, 113.1s TimeCoverageRelationStatistics Valid=16070, Invalid=99190, Unknown=0, NotChecked=0, Total=115260 [2022-01-31 21:30:38,692 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 712 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 1383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1383 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:30:38,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 68 Invalid, 3417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1383 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 63.0s Time] [2022-01-31 21:30:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2022-01-31 21:30:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 1013. [2022-01-31 21:30:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1008 states have (on average 1.3700396825396826) internal successors, (1381), 1008 states have internal predecessors, (1381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:30:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1385 transitions. [2022-01-31 21:30:40,619 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1385 transitions. Word has length 62 [2022-01-31 21:30:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:30:40,620 INFO L470 AbstractCegarLoop]: Abstraction has 1013 states and 1385 transitions. [2022-01-31 21:30:40,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 35 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:30:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1385 transitions. [2022-01-31 21:30:40,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 21:30:40,621 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:30:40,621 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:30:40,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-01-31 21:30:40,621 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:30:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:30:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2097578348, now seen corresponding path program 8 times [2022-01-31 21:30:40,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:30:40,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [687416921] [2022-01-31 21:30:40,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:30:40,650 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:30:40,650 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:30:40,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:30:40,653 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_76.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:30:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:30:40,710 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_76.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:30:41,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:30:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:30:41,212 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:30:45,946 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:30:45,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [687416921] [2022-01-31 21:30:45,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [687416921] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:30:45,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:30:45,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-31 21:30:45,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730267173] [2022-01-31 21:30:45,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:30:45,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-31 21:30:45,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:30:45,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-31 21:30:45,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1039, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 21:30:45,947 INFO L87 Difference]: Start difference. First operand 1013 states and 1385 transitions. Second operand has 37 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:30:51,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:30:55,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []