/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-de42.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 01:48:54,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 01:48:54,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 01:48:54,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 01:48:54,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 01:48:54,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 01:48:54,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 01:48:54,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 01:48:54,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 01:48:54,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 01:48:54,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 01:48:54,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 01:48:54,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 01:48:54,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 01:48:54,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 01:48:54,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 01:48:54,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 01:48:54,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 01:48:54,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 01:48:54,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 01:48:54,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 01:48:54,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 01:48:54,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 01:48:54,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 01:48:54,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 01:48:54,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 01:48:54,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 01:48:54,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 01:48:54,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 01:48:54,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 01:48:54,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 01:48:54,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 01:48:54,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 01:48:54,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 01:48:54,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 01:48:54,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 01:48:54,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 01:48:54,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 01:48:54,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 01:48:54,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 01:48:54,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 01:48:54,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-15 01:48:54,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 01:48:54,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 01:48:54,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 01:48:54,264 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 01:48:54,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 01:48:54,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 01:48:54,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 01:48:54,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 01:48:54,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 01:48:54,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 01:48:54,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 01:48:54,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 01:48:54,266 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 01:48:54,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 01:48:54,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 01:48:54,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 01:48:54,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 01:48:54,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 01:48:54,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:48:54,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 01:48:54,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 01:48:54,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 01:48:54,267 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-15 01:48:54,267 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-15 01:48:54,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 01:48:54,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 01:48:54,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 01:48:54,488 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 01:48:54,488 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 01:48:54,489 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-02-15 01:48:54,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627205cd2/b5445f9d8de74c70a454be405275b260/FLAGb09c27d73 [2022-02-15 01:48:54,890 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 01:48:54,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-02-15 01:48:54,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627205cd2/b5445f9d8de74c70a454be405275b260/FLAGb09c27d73 [2022-02-15 01:48:54,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627205cd2/b5445f9d8de74c70a454be405275b260 [2022-02-15 01:48:54,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 01:48:54,921 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 01:48:54,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 01:48:54,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 01:48:54,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 01:48:54,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:48:54" (1/1) ... [2022-02-15 01:48:54,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c220ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:48:54, skipping insertion in model container [2022-02-15 01:48:54,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:48:54" (1/1) ... [2022-02-15 01:48:54,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 01:48:54,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 01:48:55,146 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-de42.c[368,381] [2022-02-15 01:48:55,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:48:55,182 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 01:48:55,192 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-de42.c[368,381] [2022-02-15 01:48:55,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:48:55,213 INFO L208 MainTranslator]: Completed translation [2022-02-15 01:48:55,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:48:55 WrapperNode [2022-02-15 01:48:55,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 01:48:55,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 01:48:55,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 01:48:55,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 01:48:55,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:48:55" (1/1) ... [2022-02-15 01:48:55,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:48:55" (1/1) ... [2022-02-15 01:48:55,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:48:55" (1/1) ... [2022-02-15 01:48:55,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:48:55" (1/1) ... [2022-02-15 01:48:55,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:48:55" (1/1) ... [2022-02-15 01:48:55,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:48:55" (1/1) ... [2022-02-15 01:48:55,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:48:55" (1/1) ... [2022-02-15 01:48:55,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 01:48:55,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 01:48:55,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 01:48:55,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 01:48:55,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:48:55" (1/1) ... [2022-02-15 01:48:55,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:48:55,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 01:48:55,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 01:48:55,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 01:48:55,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 01:48:55,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 01:48:55,326 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 01:48:55,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-15 01:48:55,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 01:48:55,326 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 01:48:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 01:48:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 01:48:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 01:48:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-15 01:48:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 01:48:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 01:48:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 01:48:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 01:48:55,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 01:48:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 01:48:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 01:48:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 01:48:55,378 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 01:48:55,379 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 01:48:55,510 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 01:48:55,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 01:48:55,527 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-15 01:48:55,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:48:55 BoogieIcfgContainer [2022-02-15 01:48:55,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 01:48:55,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 01:48:55,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 01:48:55,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 01:48:55,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:48:54" (1/3) ... [2022-02-15 01:48:55,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18434ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:48:55, skipping insertion in model container [2022-02-15 01:48:55,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:48:55" (2/3) ... [2022-02-15 01:48:55,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18434ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:48:55, skipping insertion in model container [2022-02-15 01:48:55,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:48:55" (3/3) ... [2022-02-15 01:48:55,534 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de42.c [2022-02-15 01:48:55,538 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 01:48:55,538 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 01:48:55,614 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 01:48:55,618 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-02-15 01:48:55,619 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 01:48:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 01:48:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-15 01:48:55,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:48:55,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:48:55,650 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:48:55,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:48:55,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-02-15 01:48:55,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:48:55,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1273678134] [2022-02-15 01:48:55,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:48:55,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:48:55,729 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:48:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:48:55,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:48:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:48:55,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-02-15 01:48:55,853 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:48:55,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1273678134] [2022-02-15 01:48:55,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1273678134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:48:55,856 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:48:55,856 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-15 01:48:55,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31509008] [2022-02-15 01:48:55,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:48:55,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-15 01:48:55,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:48:55,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-15 01:48:55,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 01:48:55,889 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:48:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:48:55,937 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-02-15 01:48:55,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-15 01:48:55,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-15 01:48:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:48:55,944 INFO L225 Difference]: With dead ends: 39 [2022-02-15 01:48:55,944 INFO L226 Difference]: Without dead ends: 16 [2022-02-15 01:48:55,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 01:48:55,949 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:48:55,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:48:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-15 01:48:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-15 01:48:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:48:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-15 01:48:55,977 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-02-15 01:48:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:48:55,978 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-15 01:48:55,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:48:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-15 01:48:55,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-15 01:48:55,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:48:55,980 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:48:55,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 01:48:55,982 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:48:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:48:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-02-15 01:48:55,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:48:55,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246685344] [2022-02-15 01:48:55,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:48:55,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:48:55,993 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:48:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:48:56,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:48:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:48:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:48:56,333 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:48:56,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246685344] [2022-02-15 01:48:56,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1246685344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:48:56,333 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:48:56,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 01:48:56,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146494170] [2022-02-15 01:48:56,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:48:56,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 01:48:56,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:48:56,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 01:48:56,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-15 01:48:56,335 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:48:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:48:56,536 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-15 01:48:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 01:48:56,536 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-15 01:48:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:48:56,538 INFO L225 Difference]: With dead ends: 33 [2022-02-15 01:48:56,538 INFO L226 Difference]: Without dead ends: 23 [2022-02-15 01:48:56,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-02-15 01:48:56,540 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:48:56,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 35 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:48:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-15 01:48:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-02-15 01:48:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:48:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-15 01:48:56,547 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-02-15 01:48:56,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:48:56,548 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-15 01:48:56,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:48:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-15 01:48:56,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-15 01:48:56,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:48:56,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:48:56,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 01:48:56,549 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:48:56,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:48:56,549 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 1 times [2022-02-15 01:48:56,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:48:56,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [954078748] [2022-02-15 01:48:56,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:48:56,650 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:48:56,652 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:48:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:48:56,670 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-02-15 01:48:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:48:56,703 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-02-15 01:48:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:48:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:48:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:48:56,980 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:48:56,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [954078748] [2022-02-15 01:48:56,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [954078748] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:48:56,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:48:56,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 01:48:56,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936651916] [2022-02-15 01:48:56,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:48:56,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 01:48:56,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:48:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 01:48:56,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-15 01:48:56,984 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:48:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:48:57,087 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-15 01:48:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 01:48:57,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-15 01:48:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:48:57,088 INFO L225 Difference]: With dead ends: 30 [2022-02-15 01:48:57,088 INFO L226 Difference]: Without dead ends: 17 [2022-02-15 01:48:57,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-02-15 01:48:57,094 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:48:57,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 47 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:48:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-15 01:48:57,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-15 01:48:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:48:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-15 01:48:57,102 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 16 [2022-02-15 01:48:57,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:48:57,102 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-15 01:48:57,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:48:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-15 01:48:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-15 01:48:57,103 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:48:57,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:48:57,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 01:48:57,103 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:48:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:48:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-02-15 01:48:57,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:48:57,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [229269247] [2022-02-15 01:48:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:48:57,166 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:48:57,167 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:48:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:48:57,186 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:48:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:48:57,225 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:48:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:48:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:48:57,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-02-15 01:49:00,039 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:00,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [229269247] [2022-02-15 01:49:00,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [229269247] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:00,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:00,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 01:49:00,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758869202] [2022-02-15 01:49:00,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:00,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 01:49:00,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:00,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 01:49:00,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-02-15 01:49:00,042 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:00,406 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-15 01:49:00,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 01:49:00,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-15 01:49:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:00,407 INFO L225 Difference]: With dead ends: 26 [2022-02-15 01:49:00,408 INFO L226 Difference]: Without dead ends: 21 [2022-02-15 01:49:00,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-02-15 01:49:00,409 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:00,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 37 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2022-02-15 01:49:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-15 01:49:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-02-15 01:49:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-02-15 01:49:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-15 01:49:00,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 16 [2022-02-15 01:49:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:00,425 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-15 01:49:00,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-15 01:49:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 01:49:00,425 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:00,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:00,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 01:49:00,426 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:00,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:00,426 INFO L85 PathProgramCache]: Analyzing trace with hash 550012215, now seen corresponding path program 1 times [2022-02-15 01:49:00,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:00,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1775171384] [2022-02-15 01:49:00,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:00,463 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:00,464 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:00,472 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:00,490 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:00,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:00,521 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:00,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1775171384] [2022-02-15 01:49:00,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1775171384] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:00,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:00,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 01:49:00,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067029464] [2022-02-15 01:49:00,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:00,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 01:49:00,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:00,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 01:49:00,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-15 01:49:00,523 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.6) 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-02-15 01:49:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:00,577 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-02-15 01:49:00,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 01:49:00,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) 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-02-15 01:49:00,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:00,578 INFO L225 Difference]: With dead ends: 35 [2022-02-15 01:49:00,578 INFO L226 Difference]: Without dead ends: 28 [2022-02-15 01:49:00,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-15 01:49:00,579 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:00,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:49:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-15 01:49:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-02-15 01:49:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-02-15 01:49:00,585 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 17 [2022-02-15 01:49:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:00,586 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-02-15 01:49:00,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) 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-02-15 01:49:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-15 01:49:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 01:49:00,586 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:00,586 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:00,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 01:49:00,586 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1952840614, now seen corresponding path program 1 times [2022-02-15 01:49:00,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:00,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1673257901] [2022-02-15 01:49:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:00,647 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:00,648 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:00,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:00,653 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-15 01:49:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:00,667 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-15 01:49:00,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:00,732 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:00,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1673257901] [2022-02-15 01:49:00,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1673257901] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:00,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:00,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:49:00,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086530774] [2022-02-15 01:49:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:00,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:49:00,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:00,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:49:00,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:49:00,733 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:00,799 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-15 01:49:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 01:49:00,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-15 01:49:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:00,800 INFO L225 Difference]: With dead ends: 29 [2022-02-15 01:49:00,800 INFO L226 Difference]: Without dead ends: 21 [2022-02-15 01:49:00,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:49:00,802 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:00,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 27 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:49:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-15 01:49:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-02-15 01:49:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-02-15 01:49:00,815 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2022-02-15 01:49:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:00,816 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-15 01:49:00,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-15 01:49:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 01:49:00,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:00,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:00,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 01:49:00,817 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:00,818 INFO L85 PathProgramCache]: Analyzing trace with hash -58627519, now seen corresponding path program 1 times [2022-02-15 01:49:00,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:00,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938777379] [2022-02-15 01:49:00,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:00,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:00,888 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:00,894 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:00,904 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:00,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:00,946 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:00,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938777379] [2022-02-15 01:49:00,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [938777379] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:00,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:00,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:49:00,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846889251] [2022-02-15 01:49:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:00,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:49:00,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:00,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:49:00,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:49:00,948 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:01,015 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-02-15 01:49:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 01:49:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-15 01:49:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:01,016 INFO L225 Difference]: With dead ends: 27 [2022-02-15 01:49:01,016 INFO L226 Difference]: Without dead ends: 20 [2022-02-15 01:49:01,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:49:01,017 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:01,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 34 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:49:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-15 01:49:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-15 01:49:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-02-15 01:49:01,024 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 18 [2022-02-15 01:49:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:01,024 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-15 01:49:01,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-15 01:49:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 01:49:01,025 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:01,025 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:01,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 01:49:01,025 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-02-15 01:49:01,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:01,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1768648821] [2022-02-15 01:49:01,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:01,061 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:01,061 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:01,066 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:01,075 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:01,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:01,115 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:01,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1768648821] [2022-02-15 01:49:01,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1768648821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:01,115 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:01,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:49:01,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788479573] [2022-02-15 01:49:01,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:01,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:49:01,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:01,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:49:01,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:49:01,116 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:01,209 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-15 01:49:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 01:49:01,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-15 01:49:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:01,210 INFO L225 Difference]: With dead ends: 33 [2022-02-15 01:49:01,210 INFO L226 Difference]: Without dead ends: 28 [2022-02-15 01:49:01,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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-02-15 01:49:01,210 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:01,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:49:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-15 01:49:01,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-02-15 01:49:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-02-15 01:49:01,218 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2022-02-15 01:49:01,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:01,219 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-02-15 01:49:01,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-02-15 01:49:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-15 01:49:01,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:01,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:01,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 01:49:01,220 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:01,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:01,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-02-15 01:49:01,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:01,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1026074725] [2022-02-15 01:49:01,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:01,290 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:01,291 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:01,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:01,296 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:01,321 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:01,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:01,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-02-15 01:49:01,759 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:01,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1026074725] [2022-02-15 01:49:01,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1026074725] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:01,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:01,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 01:49:01,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914064565] [2022-02-15 01:49:01,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:01,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 01:49:01,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:01,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 01:49:01,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-02-15 01:49:01,761 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:02,413 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-02-15 01:49:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 01:49:02,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-15 01:49:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:02,415 INFO L225 Difference]: With dead ends: 35 [2022-02-15 01:49:02,415 INFO L226 Difference]: Without dead ends: 30 [2022-02-15 01:49:02,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-02-15 01:49:02,416 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:02,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 59 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 21 Unchecked, 0.3s Time] [2022-02-15 01:49:02,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-15 01:49:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-02-15 01:49:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-02-15 01:49:02,426 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 19 [2022-02-15 01:49:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:02,426 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-02-15 01:49:02,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-15 01:49:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 01:49:02,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:02,426 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:02,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 01:49:02,427 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:02,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:02,427 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 2 times [2022-02-15 01:49:02,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:02,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1790243184] [2022-02-15 01:49:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:02,478 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:02,479 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:02,486 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-15 01:49:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:02,502 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-15 01:49:02,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:02,544 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:02,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1790243184] [2022-02-15 01:49:02,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1790243184] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:02,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:02,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:49:02,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899267767] [2022-02-15 01:49:02,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:02,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:49:02,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:02,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:49:02,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:49:02,545 INFO L87 Difference]: Start difference. First operand 27 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-02-15 01:49:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:02,616 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-15 01:49:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 01:49:02,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-15 01:49:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:02,619 INFO L225 Difference]: With dead ends: 38 [2022-02-15 01:49:02,619 INFO L226 Difference]: Without dead ends: 30 [2022-02-15 01:49:02,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:49:02,620 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:02,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 27 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 01:49:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-15 01:49:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-02-15 01:49:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-02-15 01:49:02,641 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 20 [2022-02-15 01:49:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:02,641 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-02-15 01:49:02,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-15 01:49:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 01:49:02,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:02,642 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:02,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 01:49:02,643 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash 633740065, now seen corresponding path program 3 times [2022-02-15 01:49:02,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:02,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1857068553] [2022-02-15 01:49:02,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:02,885 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:02,885 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:02,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:02,889 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:02,897 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:02,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:02,973 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:02,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1857068553] [2022-02-15 01:49:02,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1857068553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:02,974 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:02,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 01:49:02,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080685299] [2022-02-15 01:49:02,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:02,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 01:49:02,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:02,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 01:49:02,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-15 01:49:02,975 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:03,117 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-02-15 01:49:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 01:49:03,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-15 01:49:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:03,118 INFO L225 Difference]: With dead ends: 35 [2022-02-15 01:49:03,118 INFO L226 Difference]: Without dead ends: 25 [2022-02-15 01:49:03,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-02-15 01:49:03,119 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:03,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 40 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:49:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-15 01:49:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-02-15 01:49:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-02-15 01:49:03,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 20 [2022-02-15 01:49:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:03,134 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-02-15 01:49:03,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-15 01:49:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 01:49:03,136 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:03,136 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:03,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 01:49:03,137 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:03,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:03,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2032182702, now seen corresponding path program 4 times [2022-02-15 01:49:03,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:03,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [179594194] [2022-02-15 01:49:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:03,189 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:03,189 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:03,195 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:03,211 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:03,301 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:03,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [179594194] [2022-02-15 01:49:03,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [179594194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:03,302 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:03,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 01:49:03,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960546660] [2022-02-15 01:49:03,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:03,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 01:49:03,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:03,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 01:49:03,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-15 01:49:03,303 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:03,473 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-02-15 01:49:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 01:49:03,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-15 01:49:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:03,474 INFO L225 Difference]: With dead ends: 41 [2022-02-15 01:49:03,474 INFO L226 Difference]: Without dead ends: 35 [2022-02-15 01:49:03,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-02-15 01:49:03,475 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:03,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 32 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:49:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-15 01:49:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-02-15 01:49:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-02-15 01:49:03,484 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 20 [2022-02-15 01:49:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:03,485 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-15 01:49:03,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-15 01:49:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-15 01:49:03,485 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:03,485 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:03,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 01:49:03,485 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1461340774, now seen corresponding path program 5 times [2022-02-15 01:49:03,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:03,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1378511527] [2022-02-15 01:49:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:03,519 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:03,520 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:03,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:03,523 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:03,553 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-02-15 01:49:03,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:03,610 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:03,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1378511527] [2022-02-15 01:49:03,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1378511527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:03,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:03,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 01:49:03,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862765894] [2022-02-15 01:49:03,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:03,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 01:49:03,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:03,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 01:49:03,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-15 01:49:03,611 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:03,788 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-15 01:49:03,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 01:49:03,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 21 [2022-02-15 01:49:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:03,789 INFO L225 Difference]: With dead ends: 45 [2022-02-15 01:49:03,789 INFO L226 Difference]: Without dead ends: 35 [2022-02-15 01:49:03,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 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-02-15 01:49:03,790 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:03,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 42 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:49:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-15 01:49:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-02-15 01:49:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-02-15 01:49:03,807 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-02-15 01:49:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:03,808 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-15 01:49:03,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-15 01:49:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 01:49:03,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:03,811 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:03,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 01:49:03,811 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1884746625, now seen corresponding path program 6 times [2022-02-15 01:49:03,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:03,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [945419180] [2022-02-15 01:49:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:03,865 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:03,865 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:03,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:03,869 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:03,914 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:04,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:08,233 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:08,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [945419180] [2022-02-15 01:49:08,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [945419180] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:08,233 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:08,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-15 01:49:08,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651794968] [2022-02-15 01:49:08,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:08,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 01:49:08,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:08,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 01:49:08,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=264, Unknown=1, NotChecked=0, Total=306 [2022-02-15 01:49:08,234 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:09,198 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-02-15 01:49:09,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-15 01:49:09,198 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-15 01:49:09,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:09,199 INFO L225 Difference]: With dead ends: 48 [2022-02-15 01:49:09,199 INFO L226 Difference]: Without dead ends: 40 [2022-02-15 01:49:09,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=94, Invalid=717, Unknown=1, NotChecked=0, Total=812 [2022-02-15 01:49:09,200 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:09,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 75 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 242 Invalid, 0 Unknown, 26 Unchecked, 0.4s Time] [2022-02-15 01:49:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-15 01:49:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-02-15 01:49:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 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-02-15 01:49:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-02-15 01:49:09,211 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 22 [2022-02-15 01:49:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:09,212 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-02-15 01:49:09,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-02-15 01:49:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 01:49:09,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:09,212 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:09,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 01:49:09,212 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:09,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1383526881, now seen corresponding path program 7 times [2022-02-15 01:49:09,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:09,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [691279758] [2022-02-15 01:49:09,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:09,250 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:09,251 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:09,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:09,255 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:09,267 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:09,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:09,348 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:09,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [691279758] [2022-02-15 01:49:09,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [691279758] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:09,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:09,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 01:49:09,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315347541] [2022-02-15 01:49:09,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:09,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 01:49:09,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:09,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 01:49:09,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-15 01:49:09,351 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:09,535 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2022-02-15 01:49:09,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 01:49:09,535 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 22 [2022-02-15 01:49:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:09,538 INFO L225 Difference]: With dead ends: 54 [2022-02-15 01:49:09,538 INFO L226 Difference]: Without dead ends: 48 [2022-02-15 01:49:09,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-15 01:49:09,540 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 56 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:09,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 30 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:49:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-15 01:49:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-02-15 01:49:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-02-15 01:49:09,587 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 22 [2022-02-15 01:49:09,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:09,588 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-02-15 01:49:09,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-15 01:49:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 01:49:09,588 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:09,588 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:09,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 01:49:09,589 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2125426118, now seen corresponding path program 8 times [2022-02-15 01:49:09,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:09,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1205814403] [2022-02-15 01:49:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:09,630 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:09,631 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:09,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:09,637 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:09,650 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:09,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:09,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-02-15 01:49:09,726 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:09,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1205814403] [2022-02-15 01:49:09,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1205814403] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:09,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:09,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 01:49:09,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480242967] [2022-02-15 01:49:09,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:09,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 01:49:09,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:09,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 01:49:09,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-15 01:49:09,728 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:09,958 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-02-15 01:49:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 01:49:09,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-15 01:49:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:09,959 INFO L225 Difference]: With dead ends: 73 [2022-02-15 01:49:09,959 INFO L226 Difference]: Without dead ends: 38 [2022-02-15 01:49:09,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-02-15 01:49:09,960 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:09,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 49 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:49:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-15 01:49:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-02-15 01:49:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-02-15 01:49:09,977 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 23 [2022-02-15 01:49:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:09,977 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-02-15 01:49:09,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-02-15 01:49:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 01:49:09,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:09,980 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:09,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 01:49:09,980 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:09,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1165944096, now seen corresponding path program 9 times [2022-02-15 01:49:09,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:09,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1396773009] [2022-02-15 01:49:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:10,022 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:10,022 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:10,029 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:10,052 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:10,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:10,174 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:10,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1396773009] [2022-02-15 01:49:10,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1396773009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:10,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:10,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 01:49:10,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813669039] [2022-02-15 01:49:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:10,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 01:49:10,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:10,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 01:49:10,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-15 01:49:10,176 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:10,501 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2022-02-15 01:49:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 01:49:10,501 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-02-15 01:49:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:10,502 INFO L225 Difference]: With dead ends: 63 [2022-02-15 01:49:10,502 INFO L226 Difference]: Without dead ends: 57 [2022-02-15 01:49:10,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-02-15 01:49:10,503 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:10,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 30 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 01:49:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-15 01:49:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2022-02-15 01:49:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-02-15 01:49:10,516 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 24 [2022-02-15 01:49:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:10,517 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-02-15 01:49:10,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-02-15 01:49:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-15 01:49:10,517 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:10,517 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:10,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 01:49:10,517 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:10,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash 176966584, now seen corresponding path program 10 times [2022-02-15 01:49:10,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:10,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2143816711] [2022-02-15 01:49:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:10,551 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:10,551 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:10,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:10,558 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:10,583 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:10,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:10,706 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:10,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2143816711] [2022-02-15 01:49:10,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2143816711] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:10,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:10,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 01:49:10,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647337427] [2022-02-15 01:49:10,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:10,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 01:49:10,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:10,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 01:49:10,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-15 01:49:10,707 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:11,022 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-02-15 01:49:11,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 01:49:11,023 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-15 01:49:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:11,023 INFO L225 Difference]: With dead ends: 63 [2022-02-15 01:49:11,023 INFO L226 Difference]: Without dead ends: 51 [2022-02-15 01:49:11,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-02-15 01:49:11,024 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:11,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:49:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-15 01:49:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-02-15 01:49:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-02-15 01:49:11,043 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 25 [2022-02-15 01:49:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:11,043 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-02-15 01:49:11,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-02-15 01:49:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-15 01:49:11,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:11,044 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:11,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 01:49:11,044 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:11,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:11,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1440430863, now seen corresponding path program 11 times [2022-02-15 01:49:11,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:11,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [195926013] [2022-02-15 01:49:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:11,082 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:11,082 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:11,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:11,086 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-15 01:49:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:11,122 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-15 01:49:11,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:15,219 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:15,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [195926013] [2022-02-15 01:49:15,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [195926013] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:15,219 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:15,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 01:49:15,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277575479] [2022-02-15 01:49:15,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:15,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 01:49:15,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:15,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 01:49:15,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=409, Unknown=1, NotChecked=0, Total=462 [2022-02-15 01:49:15,220 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:16,210 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-02-15 01:49:16,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-15 01:49:16,211 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-15 01:49:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:16,211 INFO L225 Difference]: With dead ends: 66 [2022-02-15 01:49:16,211 INFO L226 Difference]: Without dead ends: 57 [2022-02-15 01:49:16,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=115, Invalid=1144, Unknown=1, NotChecked=0, Total=1260 [2022-02-15 01:49:16,214 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:16,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 86 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 352 Invalid, 0 Unknown, 31 Unchecked, 0.4s Time] [2022-02-15 01:49:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-15 01:49:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2022-02-15 01:49:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-02-15 01:49:16,236 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 26 [2022-02-15 01:49:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:16,236 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-02-15 01:49:16,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-02-15 01:49:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-15 01:49:16,236 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:16,236 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:16,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 01:49:16,237 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1525247695, now seen corresponding path program 12 times [2022-02-15 01:49:16,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:16,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2135710469] [2022-02-15 01:49:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:16,286 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:16,287 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:16,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:16,290 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:16,309 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:16,422 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:16,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2135710469] [2022-02-15 01:49:16,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2135710469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:16,422 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:16,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 01:49:16,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331690907] [2022-02-15 01:49:16,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:16,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 01:49:16,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:16,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 01:49:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-15 01:49:16,423 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:16,834 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-02-15 01:49:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 01:49:16,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-15 01:49:16,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:16,835 INFO L225 Difference]: With dead ends: 77 [2022-02-15 01:49:16,835 INFO L226 Difference]: Without dead ends: 71 [2022-02-15 01:49:16,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 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-02-15 01:49:16,836 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 84 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:16,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 43 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 01:49:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-15 01:49:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2022-02-15 01:49:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2022-02-15 01:49:16,854 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 26 [2022-02-15 01:49:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:16,854 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2022-02-15 01:49:16,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2022-02-15 01:49:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 01:49:16,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:16,855 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:16,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 01:49:16,855 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash -40144168, now seen corresponding path program 13 times [2022-02-15 01:49:16,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:16,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1779107780] [2022-02-15 01:49:16,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:16,895 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:16,896 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:16,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:16,900 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:16,911 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-02-15 01:49:16,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:17,041 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:17,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1779107780] [2022-02-15 01:49:17,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1779107780] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:17,041 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:17,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 01:49:17,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558075660] [2022-02-15 01:49:17,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:17,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 01:49:17,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:17,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 01:49:17,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-02-15 01:49:17,042 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:17,452 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2022-02-15 01:49:17,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-15 01:49:17,453 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-15 01:49:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:17,453 INFO L225 Difference]: With dead ends: 103 [2022-02-15 01:49:17,453 INFO L226 Difference]: Without dead ends: 54 [2022-02-15 01:49:17,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-02-15 01:49:17,455 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:17,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 59 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:49:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-15 01:49:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-02-15 01:49:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2022-02-15 01:49:17,474 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 27 [2022-02-15 01:49:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:17,475 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2022-02-15 01:49:17,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2022-02-15 01:49:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-15 01:49:17,475 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:17,475 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:17,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 01:49:17,475 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:17,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 177771346, now seen corresponding path program 14 times [2022-02-15 01:49:17,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:17,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2133562128] [2022-02-15 01:49:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:17,521 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:17,522 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:17,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:17,526 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:17,538 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:17,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:17,735 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:17,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2133562128] [2022-02-15 01:49:17,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2133562128] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:17,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:17,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 01:49:17,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217874354] [2022-02-15 01:49:17,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:17,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 01:49:17,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:17,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 01:49:17,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-15 01:49:17,736 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:18,280 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2022-02-15 01:49:18,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 01:49:18,281 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-02-15 01:49:18,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:18,281 INFO L225 Difference]: With dead ends: 87 [2022-02-15 01:49:18,281 INFO L226 Difference]: Without dead ends: 81 [2022-02-15 01:49:18,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2022-02-15 01:49:18,282 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 88 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:18,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 43 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 01:49:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-15 01:49:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2022-02-15 01:49:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-02-15 01:49:18,308 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 28 [2022-02-15 01:49:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:18,308 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2022-02-15 01:49:18,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-02-15 01:49:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-15 01:49:18,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:18,308 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:18,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 01:49:18,309 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:18,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash -415205978, now seen corresponding path program 15 times [2022-02-15 01:49:18,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:18,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [893043887] [2022-02-15 01:49:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:18,352 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:18,353 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:18,357 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:18,371 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:18,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:18,556 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:18,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [893043887] [2022-02-15 01:49:18,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [893043887] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:18,556 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:18,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 01:49:18,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820735632] [2022-02-15 01:49:18,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:18,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 01:49:18,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:18,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 01:49:18,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-02-15 01:49:18,557 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:19,219 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2022-02-15 01:49:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-15 01:49:19,235 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 29 [2022-02-15 01:49:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:19,236 INFO L225 Difference]: With dead ends: 85 [2022-02-15 01:49:19,236 INFO L226 Difference]: Without dead ends: 71 [2022-02-15 01:49:19,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-02-15 01:49:19,241 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:19,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 72 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 01:49:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-15 01:49:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2022-02-15 01:49:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-02-15 01:49:19,261 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 29 [2022-02-15 01:49:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:19,262 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2022-02-15 01:49:19,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-02-15 01:49:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-15 01:49:19,263 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:19,263 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:19,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-15 01:49:19,263 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:19,263 INFO L85 PathProgramCache]: Analyzing trace with hash -991215487, now seen corresponding path program 16 times [2022-02-15 01:49:19,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:19,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1394074393] [2022-02-15 01:49:19,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:19,299 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:19,300 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:19,304 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:19,347 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.8))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:20,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:36,693 WARN L228 SmtUtils]: Spent 7.08s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:49:36,694 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:36,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1394074393] [2022-02-15 01:49:36,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1394074393] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:36,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:36,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-02-15 01:49:36,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529169675] [2022-02-15 01:49:36,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:36,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-15 01:49:36,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:36,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-15 01:49:36,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=581, Unknown=2, NotChecked=0, Total=650 [2022-02-15 01:49:36,695 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:40,202 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2022-02-15 01:49:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-15 01:49:40,203 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-15 01:49:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:40,203 INFO L225 Difference]: With dead ends: 87 [2022-02-15 01:49:40,203 INFO L226 Difference]: Without dead ends: 77 [2022-02-15 01:49:40,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=148, Invalid=1656, Unknown=2, NotChecked=0, Total=1806 [2022-02-15 01:49:40,204 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:40,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 97 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 449 Invalid, 0 Unknown, 36 Unchecked, 2.0s Time] [2022-02-15 01:49:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-15 01:49:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-02-15 01:49:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-02-15 01:49:40,224 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 30 [2022-02-15 01:49:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:40,225 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2022-02-15 01:49:40,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-02-15 01:49:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-15 01:49:40,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:40,225 INFO L514 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:40,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-15 01:49:40,225 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2085098719, now seen corresponding path program 17 times [2022-02-15 01:49:40,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:40,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1083906853] [2022-02-15 01:49:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:40,273 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:40,274 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:40,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:40,277 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:40,287 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:40,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:40,461 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:40,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1083906853] [2022-02-15 01:49:40,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1083906853] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:40,461 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:40,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 01:49:40,461 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17316572] [2022-02-15 01:49:40,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:40,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 01:49:40,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:40,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 01:49:40,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-02-15 01:49:40,462 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:41,113 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2022-02-15 01:49:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-15 01:49:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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 30 [2022-02-15 01:49:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:41,114 INFO L225 Difference]: With dead ends: 104 [2022-02-15 01:49:41,114 INFO L226 Difference]: Without dead ends: 98 [2022-02-15 01:49:41,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2022-02-15 01:49:41,115 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 97 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:41,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 51 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 01:49:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-15 01:49:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 70. [2022-02-15 01:49:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-02-15 01:49:41,140 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 30 [2022-02-15 01:49:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:41,140 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-02-15 01:49:41,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-02-15 01:49:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-15 01:49:41,141 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:41,141 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:41,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-15 01:49:41,141 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:41,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:41,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1667641082, now seen corresponding path program 18 times [2022-02-15 01:49:41,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:41,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [49770866] [2022-02-15 01:49:41,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:41,168 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:41,168 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:41,171 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:41,186 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:41,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:41,362 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:41,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [49770866] [2022-02-15 01:49:41,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [49770866] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:41,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:41,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-15 01:49:41,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533422093] [2022-02-15 01:49:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:41,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 01:49:41,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:41,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 01:49:41,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-02-15 01:49:41,363 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:41,997 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2022-02-15 01:49:41,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-15 01:49:41,998 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 31 [2022-02-15 01:49:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:41,998 INFO L225 Difference]: With dead ends: 139 [2022-02-15 01:49:41,998 INFO L226 Difference]: Without dead ends: 74 [2022-02-15 01:49:41,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=1165, Unknown=0, NotChecked=0, Total=1332 [2022-02-15 01:49:41,999 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:41,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 74 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 01:49:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-15 01:49:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2022-02-15 01:49:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2022-02-15 01:49:42,039 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 31 [2022-02-15 01:49:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:42,040 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2022-02-15 01:49:42,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2022-02-15 01:49:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-15 01:49:42,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:42,041 INFO L514 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:42,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-15 01:49:42,041 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:42,041 INFO L85 PathProgramCache]: Analyzing trace with hash -715850976, now seen corresponding path program 19 times [2022-02-15 01:49:42,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:42,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [283469605] [2022-02-15 01:49:42,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:42,082 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:42,082 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:42,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:42,085 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:42,099 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-02-15 01:49:42,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:42,403 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:42,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [283469605] [2022-02-15 01:49:42,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [283469605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:42,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:42,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-15 01:49:42,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749312875] [2022-02-15 01:49:42,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:42,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-15 01:49:42,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:42,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-15 01:49:42,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-02-15 01:49:42,404 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:43,420 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2022-02-15 01:49:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-15 01:49:43,420 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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 32 [2022-02-15 01:49:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:43,422 INFO L225 Difference]: With dead ends: 115 [2022-02-15 01:49:43,422 INFO L226 Difference]: Without dead ends: 109 [2022-02-15 01:49:43,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2022-02-15 01:49:43,423 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 101 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:43,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 51 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 01:49:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-15 01:49:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2022-02-15 01:49:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2022-02-15 01:49:43,462 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 32 [2022-02-15 01:49:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:43,462 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2022-02-15 01:49:43,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2022-02-15 01:49:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-15 01:49:43,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:43,463 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:43,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-15 01:49:43,464 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:43,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:43,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1131406856, now seen corresponding path program 20 times [2022-02-15 01:49:43,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:43,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [274809792] [2022-02-15 01:49:43,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:43,507 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:43,508 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:43,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:43,512 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:43,532 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:43,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:49:43,782 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:49:43,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [274809792] [2022-02-15 01:49:43,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [274809792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:49:43,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:49:43,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-15 01:49:43,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405511813] [2022-02-15 01:49:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:49:43,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-15 01:49:43,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:49:43,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-15 01:49:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-02-15 01:49:43,783 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:49:45,141 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2022-02-15 01:49:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-15 01:49:45,142 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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-02-15 01:49:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:49:45,142 INFO L225 Difference]: With dead ends: 111 [2022-02-15 01:49:45,142 INFO L226 Difference]: Without dead ends: 95 [2022-02-15 01:49:45,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=1038, Unknown=0, NotChecked=0, Total=1260 [2022-02-15 01:49:45,143 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 01:49:45,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 77 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 01:49:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-15 01:49:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2022-02-15 01:49:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 74 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2022-02-15 01:49:45,175 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 33 [2022-02-15 01:49:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:49:45,175 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2022-02-15 01:49:45,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:49:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2022-02-15 01:49:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-15 01:49:45,176 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:49:45,176 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:49:45,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-15 01:49:45,176 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:49:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:49:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1464317553, now seen corresponding path program 21 times [2022-02-15 01:49:45,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:49:45,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2001173670] [2022-02-15 01:49:45,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:49:45,464 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:49:45,464 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:49:45,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:49:45,467 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:45,506 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.7))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:49:46,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:49:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:49:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:20,359 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:20,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2001173670] [2022-02-15 01:50:20,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2001173670] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:20,360 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:20,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 01:50:20,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786677947] [2022-02-15 01:50:20,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:20,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 01:50:20,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:20,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 01:50:20,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=787, Unknown=7, NotChecked=0, Total=870 [2022-02-15 01:50:20,361 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:25,167 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2022-02-15 01:50:25,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-15 01:50:25,168 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-15 01:50:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:25,169 INFO L225 Difference]: With dead ends: 111 [2022-02-15 01:50:25,169 INFO L226 Difference]: Without dead ends: 100 [2022-02-15 01:50:25,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=163, Invalid=2279, Unknown=8, NotChecked=0, Total=2450 [2022-02-15 01:50:25,170 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:25,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 138 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 738 Invalid, 0 Unknown, 74 Unchecked, 1.6s Time] [2022-02-15 01:50:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-15 01:50:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2022-02-15 01:50:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2022-02-15 01:50:25,220 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 34 [2022-02-15 01:50:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:25,220 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2022-02-15 01:50:25,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2022-02-15 01:50:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-15 01:50:25,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:25,221 INFO L514 BasicCegarLoop]: trace histogram [9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:25,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-15 01:50:25,221 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1089655055, now seen corresponding path program 22 times [2022-02-15 01:50:25,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:25,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [562591418] [2022-02-15 01:50:25,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:25,274 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:25,275 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:25,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:25,278 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:25,292 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:25,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:25,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-02-15 01:50:25,625 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:25,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [562591418] [2022-02-15 01:50:25,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [562591418] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:25,625 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:25,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-15 01:50:25,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132533577] [2022-02-15 01:50:25,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:25,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-15 01:50:25,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:25,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-15 01:50:25,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-02-15 01:50:25,627 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:28,789 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2022-02-15 01:50:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-15 01:50:28,789 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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 34 [2022-02-15 01:50:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:28,790 INFO L225 Difference]: With dead ends: 135 [2022-02-15 01:50:28,790 INFO L226 Difference]: Without dead ends: 129 [2022-02-15 01:50:28,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2022-02-15 01:50:28,791 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 113 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:28,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 59 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 01:50:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-15 01:50:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 88. [2022-02-15 01:50:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 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-02-15 01:50:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-02-15 01:50:28,830 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 34 [2022-02-15 01:50:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:28,830 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-02-15 01:50:28,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-02-15 01:50:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-15 01:50:28,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:28,831 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:28,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-15 01:50:28,831 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash 327395608, now seen corresponding path program 23 times [2022-02-15 01:50:28,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:28,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2088654855] [2022-02-15 01:50:28,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:28,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:28,860 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:28,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:28,864 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:28,879 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:29,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:29,129 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:29,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2088654855] [2022-02-15 01:50:29,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2088654855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:29,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:29,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-15 01:50:29,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291130240] [2022-02-15 01:50:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:29,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-15 01:50:29,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:29,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-15 01:50:29,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-02-15 01:50:29,131 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:30,241 INFO L93 Difference]: Finished difference Result 181 states and 222 transitions. [2022-02-15 01:50:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-15 01:50:30,242 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-02-15 01:50:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:30,242 INFO L225 Difference]: With dead ends: 181 [2022-02-15 01:50:30,242 INFO L226 Difference]: Without dead ends: 98 [2022-02-15 01:50:30,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=1760, Unknown=0, NotChecked=0, Total=1980 [2022-02-15 01:50:30,243 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:30,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 79 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 01:50:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-15 01:50:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2022-02-15 01:50:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-02-15 01:50:30,280 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 35 [2022-02-15 01:50:30,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:30,280 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-02-15 01:50:30,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-02-15 01:50:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-15 01:50:30,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:30,281 INFO L514 BasicCegarLoop]: trace histogram [10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:30,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-15 01:50:30,281 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1702763602, now seen corresponding path program 24 times [2022-02-15 01:50:30,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:30,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [763821570] [2022-02-15 01:50:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:30,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:30,340 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:30,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:30,344 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:30,354 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:30,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:50:30,803 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:30,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [763821570] [2022-02-15 01:50:30,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [763821570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:30,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:30,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 01:50:30,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081123424] [2022-02-15 01:50:30,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:30,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 01:50:30,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:30,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 01:50:30,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-02-15 01:50:30,805 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:32,737 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2022-02-15 01:50:32,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-15 01:50:32,737 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-02-15 01:50:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:32,738 INFO L225 Difference]: With dead ends: 147 [2022-02-15 01:50:32,738 INFO L226 Difference]: Without dead ends: 141 [2022-02-15 01:50:32,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2022-02-15 01:50:32,739 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 164 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:32,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 44 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 01:50:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-15 01:50:32,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2022-02-15 01:50:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-02-15 01:50:32,786 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 36 [2022-02-15 01:50:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:32,786 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-02-15 01:50:32,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-02-15 01:50:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-15 01:50:32,787 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:32,787 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:32,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-15 01:50:32,787 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:32,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:32,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1150668570, now seen corresponding path program 25 times [2022-02-15 01:50:32,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:32,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [583885953] [2022-02-15 01:50:32,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:32,830 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:32,831 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:32,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:32,837 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:32,872 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:33,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:33,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-02-15 01:50:33,268 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:50:33,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [583885953] [2022-02-15 01:50:33,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [583885953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:50:33,268 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:50:33,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 01:50:33,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549292395] [2022-02-15 01:50:33,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:50:33,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 01:50:33,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:50:33,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 01:50:33,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-02-15 01:50:33,269 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:50:36,470 INFO L93 Difference]: Finished difference Result 141 states and 173 transitions. [2022-02-15 01:50:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 01:50:36,471 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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 37 [2022-02-15 01:50:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:50:36,471 INFO L225 Difference]: With dead ends: 141 [2022-02-15 01:50:36,471 INFO L226 Difference]: Without dead ends: 123 [2022-02-15 01:50:36,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2022-02-15 01:50:36,472 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:50:36,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 82 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-15 01:50:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-02-15 01:50:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2022-02-15 01:50:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 93 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-02-15 01:50:36,520 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 37 [2022-02-15 01:50:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:50:36,521 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-02-15 01:50:36,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:50:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-02-15 01:50:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-15 01:50:36,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:50:36,521 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:50:36,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-15 01:50:36,521 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:50:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:50:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash 753593729, now seen corresponding path program 26 times [2022-02-15 01:50:36,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:50:36,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [55085338] [2022-02-15 01:50:36,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:50:36,774 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:50:36,774 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:50:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:50:36,777 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:36,836 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.8))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:50:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:50:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:50:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:19,024 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:19,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [55085338] [2022-02-15 01:51:19,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [55085338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:19,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:19,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-02-15 01:51:19,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175694735] [2022-02-15 01:51:19,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:19,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-15 01:51:19,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:19,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-15 01:51:19,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1019, Unknown=7, NotChecked=0, Total=1122 [2022-02-15 01:51:19,025 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 32 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:43,180 WARN L228 SmtUtils]: Spent 21.76s on a formula simplification. DAG size of input: 55 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:51:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:48,120 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2022-02-15 01:51:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-15 01:51:48,120 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-02-15 01:51:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:48,121 INFO L225 Difference]: With dead ends: 138 [2022-02-15 01:51:48,121 INFO L226 Difference]: Without dead ends: 126 [2022-02-15 01:51:48,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 67.1s TimeCoverageRelationStatistics Valid=205, Invalid=2979, Unknown=8, NotChecked=0, Total=3192 [2022-02-15 01:51:48,122 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:48,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 119 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 798 Invalid, 0 Unknown, 38 Unchecked, 3.4s Time] [2022-02-15 01:51:48,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-15 01:51:48,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2022-02-15 01:51:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2022-02-15 01:51:48,192 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 38 [2022-02-15 01:51:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:48,192 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2022-02-15 01:51:48,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2022-02-15 01:51:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-15 01:51:48,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:48,193 INFO L514 BasicCegarLoop]: trace histogram [11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:48,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-15 01:51:48,193 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:48,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2110923873, now seen corresponding path program 27 times [2022-02-15 01:51:48,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:48,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1718033643] [2022-02-15 01:51:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:48,227 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:48,227 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:48,237 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:51:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:48,248 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:51:48,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:48,731 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:48,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1718033643] [2022-02-15 01:51:48,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1718033643] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:48,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:48,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-15 01:51:48,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301716730] [2022-02-15 01:51:48,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:48,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-15 01:51:48,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:48,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-15 01:51:48,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-02-15 01:51:48,732 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:52,032 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2022-02-15 01:51:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 01:51:52,032 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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 38 [2022-02-15 01:51:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:52,033 INFO L225 Difference]: With dead ends: 170 [2022-02-15 01:51:52,033 INFO L226 Difference]: Without dead ends: 164 [2022-02-15 01:51:52,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=402, Invalid=1490, Unknown=0, NotChecked=0, Total=1892 [2022-02-15 01:51:52,034 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 141 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:52,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 57 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 01:51:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-02-15 01:51:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 108. [2022-02-15 01:51:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.2233009708737863) internal successors, (126), 103 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-02-15 01:51:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2022-02-15 01:51:52,092 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 38 [2022-02-15 01:51:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:52,093 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2022-02-15 01:51:52,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2022-02-15 01:51:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-15 01:51:52,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:52,093 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:52,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-15 01:51:52,093 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash -343817146, now seen corresponding path program 28 times [2022-02-15 01:51:52,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:52,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1362365371] [2022-02-15 01:51:52,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:52,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:52,127 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:52,130 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:51:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:52,148 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-02-15 01:51:52,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:52,527 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:52,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1362365371] [2022-02-15 01:51:52,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1362365371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:52,527 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:52,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-02-15 01:51:52,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375908827] [2022-02-15 01:51:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:52,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-15 01:51:52,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-15 01:51:52,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-02-15 01:51:52,528 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:54,578 INFO L93 Difference]: Finished difference Result 229 states and 277 transitions. [2022-02-15 01:51:54,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-15 01:51:54,578 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-02-15 01:51:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:54,579 INFO L225 Difference]: With dead ends: 229 [2022-02-15 01:51:54,579 INFO L226 Difference]: Without dead ends: 126 [2022-02-15 01:51:54,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=279, Invalid=2477, Unknown=0, NotChecked=0, Total=2756 [2022-02-15 01:51:54,581 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:54,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 104 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 01:51:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-15 01:51:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2022-02-15 01:51:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.21875) internal successors, (117), 96 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2022-02-15 01:51:54,659 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 39 [2022-02-15 01:51:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:54,659 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2022-02-15 01:51:54,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-02-15 01:51:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-15 01:51:54,660 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:54,660 INFO L514 BasicCegarLoop]: trace histogram [12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:54,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-15 01:51:54,660 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1373388512, now seen corresponding path program 29 times [2022-02-15 01:51:54,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:54,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1469457918] [2022-02-15 01:51:54,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:54,736 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:54,736 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:54,739 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:51:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:54,751 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:51:54,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:51:55,491 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:51:55,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1469457918] [2022-02-15 01:51:55,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1469457918] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:51:55,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:51:55,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-15 01:51:55,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147244086] [2022-02-15 01:51:55,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:51:55,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-15 01:51:55,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:51:55,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-15 01:51:55,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-02-15 01:51:55,492 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:51:59,624 INFO L93 Difference]: Finished difference Result 183 states and 232 transitions. [2022-02-15 01:51:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-15 01:51:59,624 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-02-15 01:51:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:51:59,625 INFO L225 Difference]: With dead ends: 183 [2022-02-15 01:51:59,625 INFO L226 Difference]: Without dead ends: 177 [2022-02-15 01:51:59,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2022-02-15 01:51:59,626 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 202 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-15 01:51:59,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 47 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-15 01:51:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-15 01:51:59,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 111. [2022-02-15 01:51:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 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-02-15 01:51:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 134 transitions. [2022-02-15 01:51:59,693 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 134 transitions. Word has length 40 [2022-02-15 01:51:59,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:51:59,693 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 134 transitions. [2022-02-15 01:51:59,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:51:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2022-02-15 01:51:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-15 01:51:59,694 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:51:59,694 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:51:59,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-15 01:51:59,694 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:51:59,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:51:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1281562680, now seen corresponding path program 30 times [2022-02-15 01:51:59,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:51:59,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1728114746] [2022-02-15 01:51:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:51:59,723 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:51:59,723 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:51:59,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:51:59,726 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:51:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:59,743 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:51:59,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:51:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:51:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:52:00,460 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:52:00,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1728114746] [2022-02-15 01:52:00,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1728114746] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:52:00,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:52:00,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-15 01:52:00,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592928070] [2022-02-15 01:52:00,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:52:00,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-15 01:52:00,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:52:00,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-15 01:52:00,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-02-15 01:52:00,461 INFO L87 Difference]: Start difference. First operand 111 states and 134 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:52:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:52:06,681 INFO L93 Difference]: Finished difference Result 175 states and 212 transitions. [2022-02-15 01:52:06,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-15 01:52:06,682 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-02-15 01:52:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:52:06,682 INFO L225 Difference]: With dead ends: 175 [2022-02-15 01:52:06,682 INFO L226 Difference]: Without dead ends: 155 [2022-02-15 01:52:06,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=401, Invalid=2049, Unknown=0, NotChecked=0, Total=2450 [2022-02-15 01:52:06,684 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 60 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 01:52:06,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 102 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 01:52:06,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-15 01:52:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 119. [2022-02-15 01:52:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2105263157894737) internal successors, (138), 114 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:52:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2022-02-15 01:52:06,761 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 41 [2022-02-15 01:52:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:52:06,761 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2022-02-15 01:52:06,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:52:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2022-02-15 01:52:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-15 01:52:06,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:52:06,762 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:52:06,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-15 01:52:06,762 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:52:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:52:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash -383612943, now seen corresponding path program 31 times [2022-02-15 01:52:06,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:52:06,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697167473] [2022-02-15 01:52:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:52:06,809 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:52:06,810 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:52:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:52:06,813 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:52:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:52:06,865 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.8))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:52:09,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:52:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:52:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:53:15,387 WARN L228 SmtUtils]: Spent 8.74s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:54:17,453 WARN L228 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:54:17,454 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:54:17,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697167473] [2022-02-15 01:54:17,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [697167473] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:54:17,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:54:17,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-02-15 01:54:17,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678944700] [2022-02-15 01:54:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:54:17,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-15 01:54:17,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:54:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-15 01:54:17,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1257, Unknown=37, NotChecked=0, Total=1406 [2022-02-15 01:54:17,455 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand has 36 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:54:26,523 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2022-02-15 01:54:26,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-15 01:54:26,524 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-02-15 01:54:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:54:26,524 INFO L225 Difference]: With dead ends: 168 [2022-02-15 01:54:26,524 INFO L226 Difference]: Without dead ends: 155 [2022-02-15 01:54:26,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 134.3s TimeCoverageRelationStatistics Valid=235, Invalid=3760, Unknown=37, NotChecked=0, Total=4032 [2022-02-15 01:54:26,526 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:54:26,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 150 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1077 Invalid, 0 Unknown, 126 Unchecked, 4.0s Time] [2022-02-15 01:54:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-15 01:54:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 120. [2022-02-15 01:54:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.208695652173913) internal successors, (139), 115 states have internal predecessors, (139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2022-02-15 01:54:26,628 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 42 [2022-02-15 01:54:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:54:26,628 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2022-02-15 01:54:26,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2022-02-15 01:54:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-15 01:54:26,628 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:54:26,629 INFO L514 BasicCegarLoop]: trace histogram [13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:54:26,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-15 01:54:26,629 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:54:26,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:54:26,629 INFO L85 PathProgramCache]: Analyzing trace with hash 724405425, now seen corresponding path program 32 times [2022-02-15 01:54:26,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:54:26,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1261283204] [2022-02-15 01:54:26,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:54:26,662 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:54:26,662 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:54:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:54:26,666 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:26,680 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:26,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:54:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:54:27,471 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:54:27,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1261283204] [2022-02-15 01:54:27,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1261283204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:54:27,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:54:27,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-02-15 01:54:27,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884754269] [2022-02-15 01:54:27,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:54:27,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-15 01:54:27,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:54:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-15 01:54:27,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2022-02-15 01:54:27,472 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:54:30,534 INFO L93 Difference]: Finished difference Result 209 states and 260 transitions. [2022-02-15 01:54:30,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-15 01:54:30,535 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-02-15 01:54:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:54:30,536 INFO L225 Difference]: With dead ends: 209 [2022-02-15 01:54:30,536 INFO L226 Difference]: Without dead ends: 203 [2022-02-15 01:54:30,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=531, Invalid=2019, Unknown=0, NotChecked=0, Total=2550 [2022-02-15 01:54:30,537 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 183 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-15 01:54:30,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 70 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-15 01:54:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-02-15 01:54:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 130. [2022-02-15 01:54:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.208) internal successors, (151), 125 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2022-02-15 01:54:30,646 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 42 [2022-02-15 01:54:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:54:30,646 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2022-02-15 01:54:30,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2022-02-15 01:54:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-15 01:54:30,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:54:30,647 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:54:30,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-15 01:54:30,647 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:54:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:54:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash -464449704, now seen corresponding path program 33 times [2022-02-15 01:54:30,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:54:30,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1085558134] [2022-02-15 01:54:30,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:54:30,686 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:54:30,686 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:54:30,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:54:30,690 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:30,715 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:54:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:54:31,475 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:54:31,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1085558134] [2022-02-15 01:54:31,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1085558134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:54:31,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:54:31,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-15 01:54:31,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87462151] [2022-02-15 01:54:31,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:54:31,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-15 01:54:31,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:54:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-15 01:54:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2022-02-15 01:54:31,477 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:54:35,421 INFO L93 Difference]: Finished difference Result 283 states and 338 transitions. [2022-02-15 01:54:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-15 01:54:35,422 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-02-15 01:54:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:54:35,422 INFO L225 Difference]: With dead ends: 283 [2022-02-15 01:54:35,422 INFO L226 Difference]: Without dead ends: 158 [2022-02-15 01:54:35,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=344, Invalid=3316, Unknown=0, NotChecked=0, Total=3660 [2022-02-15 01:54:35,424 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-15 01:54:35,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 104 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-15 01:54:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-15 01:54:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 122. [2022-02-15 01:54:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.205128205128205) internal successors, (141), 117 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2022-02-15 01:54:35,512 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 43 [2022-02-15 01:54:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:54:35,512 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2022-02-15 01:54:35,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-02-15 01:54:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-15 01:54:35,513 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:54:35,513 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:54:35,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-15 01:54:35,513 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:54:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:54:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1186461010, now seen corresponding path program 34 times [2022-02-15 01:54:35,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:54:35,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1776721998] [2022-02-15 01:54:35,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:54:35,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:54:35,558 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:54:35,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:54:35,562 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:35,583 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:35,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:54:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:54:37,566 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:54:37,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1776721998] [2022-02-15 01:54:37,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1776721998] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:54:37,567 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:54:37,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-02-15 01:54:37,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490197750] [2022-02-15 01:54:37,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:54:37,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-15 01:54:37,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:54:37,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-15 01:54:37,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-02-15 01:54:37,568 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:54:43,027 INFO L93 Difference]: Finished difference Result 223 states and 279 transitions. [2022-02-15 01:54:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-15 01:54:43,028 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-02-15 01:54:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:54:43,029 INFO L225 Difference]: With dead ends: 223 [2022-02-15 01:54:43,029 INFO L226 Difference]: Without dead ends: 217 [2022-02-15 01:54:43,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=651, Invalid=2429, Unknown=0, NotChecked=0, Total=3080 [2022-02-15 01:54:43,030 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 239 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-15 01:54:43,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 70 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-02-15 01:54:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-02-15 01:54:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 133. [2022-02-15 01:54:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.2109375) internal successors, (155), 128 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2022-02-15 01:54:43,125 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 44 [2022-02-15 01:54:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:54:43,125 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2022-02-15 01:54:43,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2022-02-15 01:54:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-15 01:54:43,126 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:54:43,126 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:54:43,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-15 01:54:43,126 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:54:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:54:43,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1828750298, now seen corresponding path program 35 times [2022-02-15 01:54:43,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:54:43,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643328141] [2022-02-15 01:54:43,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:54:43,155 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:54:43,156 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:54:43,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:54:43,159 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-15 01:54:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:43,185 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-02-15 01:54:43,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:54:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:54:44,217 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:54:44,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643328141] [2022-02-15 01:54:44,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1643328141] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:54:44,217 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:54:44,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-02-15 01:54:44,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859027186] [2022-02-15 01:54:44,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:54:44,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-15 01:54:44,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:54:44,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-15 01:54:44,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2022-02-15 01:54:44,218 INFO L87 Difference]: Start difference. First operand 133 states and 159 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:57,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:54:57,845 INFO L93 Difference]: Finished difference Result 213 states and 255 transitions. [2022-02-15 01:54:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-15 01:54:57,846 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 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 45 [2022-02-15 01:54:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:54:57,847 INFO L225 Difference]: With dead ends: 213 [2022-02-15 01:54:57,847 INFO L226 Difference]: Without dead ends: 191 [2022-02-15 01:54:57,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=510, Invalid=2682, Unknown=0, NotChecked=0, Total=3192 [2022-02-15 01:54:57,848 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 60 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-02-15 01:54:57,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 117 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-02-15 01:54:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-15 01:54:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 142. [2022-02-15 01:54:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.197080291970803) internal successors, (164), 137 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 168 transitions. [2022-02-15 01:54:57,993 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 168 transitions. Word has length 45 [2022-02-15 01:54:57,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:54:57,993 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 168 transitions. [2022-02-15 01:54:57,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:54:57,993 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 168 transitions. [2022-02-15 01:54:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-15 01:54:57,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:54:57,994 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:54:57,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-15 01:54:57,994 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:54:57,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:54:57,994 INFO L85 PathProgramCache]: Analyzing trace with hash 175241857, now seen corresponding path program 36 times [2022-02-15 01:54:57,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:54:57,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [480103095] [2022-02-15 01:54:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:54:58,028 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:54:58,028 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:54:58,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:54:58,032 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:54:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:54:58,069 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.8))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:55:00,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:55:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:55:00,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-02-15 01:55:23,730 WARN L228 SmtUtils]: Spent 7.18s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:55:57,605 WARN L228 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:56:17,379 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:56:17,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [480103095] [2022-02-15 01:56:17,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [480103095] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:56:17,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:56:17,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-15 01:56:17,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977174576] [2022-02-15 01:56:17,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:56:17,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-15 01:56:17,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:56:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-15 01:56:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1589, Unknown=4, NotChecked=0, Total=1722 [2022-02-15 01:56:17,381 INFO L87 Difference]: Start difference. First operand 142 states and 168 transitions. Second operand has 40 states, 40 states have (on average 1.05) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:19,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 01:56:25,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:56:25,488 INFO L93 Difference]: Finished difference Result 201 states and 235 transitions. [2022-02-15 01:56:25,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-02-15 01:56:25,489 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.05) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-02-15 01:56:25,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:56:25,489 INFO L225 Difference]: With dead ends: 201 [2022-02-15 01:56:25,489 INFO L226 Difference]: Without dead ends: 187 [2022-02-15 01:56:25,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 80.6s TimeCoverageRelationStatistics Valid=266, Invalid=4700, Unknown=4, NotChecked=0, Total=4970 [2022-02-15 01:56:25,490 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-02-15 01:56:25,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 161 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1296 Invalid, 0 Unknown, 75 Unchecked, 5.8s Time] [2022-02-15 01:56:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-15 01:56:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 143. [2022-02-15 01:56:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.1956521739130435) internal successors, (165), 138 states have internal predecessors, (165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 169 transitions. [2022-02-15 01:56:25,607 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 169 transitions. Word has length 46 [2022-02-15 01:56:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:56:25,607 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 169 transitions. [2022-02-15 01:56:25,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.05) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2022-02-15 01:56:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-15 01:56:25,608 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:56:25,608 INFO L514 BasicCegarLoop]: trace histogram [15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:56:25,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-02-15 01:56:25,608 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:56:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:56:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash -378430047, now seen corresponding path program 37 times [2022-02-15 01:56:25,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:56:25,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [630580213] [2022-02-15 01:56:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:56:25,651 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:56:25,651 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:56:25,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:56:25,654 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:56:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:56:25,667 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-02-15 01:56:25,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:56:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:56:25,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-02-15 01:56:26,902 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:56:26,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [630580213] [2022-02-15 01:56:26,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [630580213] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:56:26,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:56:26,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-15 01:56:26,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932357201] [2022-02-15 01:56:26,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:56:26,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-15 01:56:26,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:56:26,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-15 01:56:26,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2022-02-15 01:56:26,907 INFO L87 Difference]: Start difference. First operand 143 states and 169 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:56:35,575 INFO L93 Difference]: Finished difference Result 252 states and 310 transitions. [2022-02-15 01:56:35,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-15 01:56:35,575 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 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 46 [2022-02-15 01:56:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:56:35,576 INFO L225 Difference]: With dead ends: 252 [2022-02-15 01:56:35,577 INFO L226 Difference]: Without dead ends: 246 [2022-02-15 01:56:35,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=678, Invalid=2628, Unknown=0, NotChecked=0, Total=3306 [2022-02-15 01:56:35,577 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 268 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:56:35,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 63 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 01:56:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-02-15 01:56:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 154. [2022-02-15 01:56:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.1946308724832215) internal successors, (178), 149 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2022-02-15 01:56:35,764 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 46 [2022-02-15 01:56:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:56:35,764 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2022-02-15 01:56:35,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2022-02-15 01:56:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-15 01:56:35,765 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:56:35,765 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:56:35,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-15 01:56:35,765 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:56:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:56:35,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2125510778, now seen corresponding path program 38 times [2022-02-15 01:56:35,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:56:35,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863740889] [2022-02-15 01:56:35,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:56:35,792 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:56:35,792 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:56:35,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:56:35,797 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_44.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:56:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:56:35,833 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_44.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:56:36,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:56:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:56:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:56:37,139 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:56:37,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863740889] [2022-02-15 01:56:37,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1863740889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:56:37,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:56:37,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 01:56:37,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754795943] [2022-02-15 01:56:37,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:56:37,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 01:56:37,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:56:37,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 01:56:37,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-02-15 01:56:37,140 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:56:43,503 INFO L93 Difference]: Finished difference Result 343 states and 405 transitions. [2022-02-15 01:56:43,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-02-15 01:56:43,504 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 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 47 [2022-02-15 01:56:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:56:43,505 INFO L225 Difference]: With dead ends: 343 [2022-02-15 01:56:43,505 INFO L226 Difference]: Without dead ends: 194 [2022-02-15 01:56:43,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=415, Invalid=4277, Unknown=0, NotChecked=0, Total=4692 [2022-02-15 01:56:43,506 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 01:56:43,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 109 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 01:56:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-02-15 01:56:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 145. [2022-02-15 01:56:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.1928571428571428) internal successors, (167), 140 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 171 transitions. [2022-02-15 01:56:43,639 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 171 transitions. Word has length 47 [2022-02-15 01:56:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:56:43,639 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 171 transitions. [2022-02-15 01:56:43,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 171 transitions. [2022-02-15 01:56:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-15 01:56:43,640 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:56:43,640 INFO L514 BasicCegarLoop]: trace histogram [16, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:56:43,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-15 01:56:43,640 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:56:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:56:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash 658716448, now seen corresponding path program 39 times [2022-02-15 01:56:43,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:56:43,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [795961469] [2022-02-15 01:56:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:56:43,686 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:56:43,687 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:56:43,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:56:43,690 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_45.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:56:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:56:43,705 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_45.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:56:43,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:56:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:56:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:56:46,062 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:56:46,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [795961469] [2022-02-15 01:56:46,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [795961469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:56:46,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:56:46,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 01:56:46,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175165076] [2022-02-15 01:56:46,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:56:46,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 01:56:46,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:56:46,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 01:56:46,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2022-02-15 01:56:46,063 INFO L87 Difference]: Start difference. First operand 145 states and 171 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:56:53,658 INFO L93 Difference]: Finished difference Result 267 states and 330 transitions. [2022-02-15 01:56:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-15 01:56:53,659 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-02-15 01:56:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:56:53,660 INFO L225 Difference]: With dead ends: 267 [2022-02-15 01:56:53,660 INFO L226 Difference]: Without dead ends: 261 [2022-02-15 01:56:53,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=813, Invalid=3093, Unknown=0, NotChecked=0, Total=3906 [2022-02-15 01:56:53,660 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 249 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-02-15 01:56:53,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 93 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-02-15 01:56:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-02-15 01:56:53,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 157. [2022-02-15 01:56:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.1973684210526316) internal successors, (182), 152 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-02-15 01:56:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2022-02-15 01:56:53,811 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 48 [2022-02-15 01:56:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:56:53,811 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2022-02-15 01:56:53,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:56:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2022-02-15 01:56:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-15 01:56:53,812 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:56:53,812 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:56:53,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-02-15 01:56:53,812 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:56:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:56:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1036171656, now seen corresponding path program 40 times [2022-02-15 01:56:53,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:56:53,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1966899965] [2022-02-15 01:56:53,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:56:53,847 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:56:53,848 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:56:53,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:56:53,852 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_46.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:56:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:56:53,877 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_46.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:56:54,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:56:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:56:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:56:56,035 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:56:56,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1966899965] [2022-02-15 01:56:56,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1966899965] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:56:56,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:56:56,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 01:56:56,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941689877] [2022-02-15 01:56:56,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:56:56,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 01:56:56,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:56:56,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 01:56:56,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2022-02-15 01:56:56,036 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:57:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:57:21,084 INFO L93 Difference]: Finished difference Result 255 states and 302 transitions. [2022-02-15 01:57:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-15 01:57:21,085 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 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 49 [2022-02-15 01:57:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:57:21,086 INFO L225 Difference]: With dead ends: 255 [2022-02-15 01:57:21,086 INFO L226 Difference]: Without dead ends: 231 [2022-02-15 01:57:21,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=632, Invalid=3400, Unknown=0, NotChecked=0, Total=4032 [2022-02-15 01:57:21,086 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 79 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-02-15 01:57:21,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 112 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-02-15 01:57:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-15 01:57:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 167. [2022-02-15 01:57:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.1851851851851851) internal successors, (192), 162 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:57:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2022-02-15 01:57:21,287 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 49 [2022-02-15 01:57:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:57:21,287 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2022-02-15 01:57:21,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 01:57:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2022-02-15 01:57:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-15 01:57:21,288 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:57:21,288 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:57:21,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-02-15 01:57:21,288 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:57:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:57:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1166460559, now seen corresponding path program 41 times [2022-02-15 01:57:21,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:57:21,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [271312541] [2022-02-15 01:57:21,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:57:21,323 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:57:21,323 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:57:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:57:21,326 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_47.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:57:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:57:21,377 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_47.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 01:57:23,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:57:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:57:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:58:07,880 WARN L228 SmtUtils]: Spent 7.06s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:58:52,895 WARN L228 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 01:59:42,007 WARN L228 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 02:00:36,244 WARN L228 SmtUtils]: Spent 13.61s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 02:00:36,245 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:00:36,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [271312541] [2022-02-15 02:00:36,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [271312541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:00:36,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:00:36,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-02-15 02:00:36,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312252518] [2022-02-15 02:00:36,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:00:36,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-02-15 02:00:36,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:00:36,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-02-15 02:00:36,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1898, Unknown=33, NotChecked=0, Total=2070 [2022-02-15 02:00:36,247 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 44 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 42 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-02-15 02:00:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:00:42,361 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2022-02-15 02:00:42,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-02-15 02:00:42,362 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-02-15 02:00:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:00:42,363 INFO L225 Difference]: With dead ends: 237 [2022-02-15 02:00:42,363 INFO L226 Difference]: Without dead ends: 222 [2022-02-15 02:00:42,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 197.2s TimeCoverageRelationStatistics Valid=274, Invalid=5699, Unknown=33, NotChecked=0, Total=6006 [2022-02-15 02:00:42,364 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-15 02:00:42,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 182 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1763 Invalid, 0 Unknown, 36 Unchecked, 2.9s Time] [2022-02-15 02:00:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-02-15 02:00:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 168. [2022-02-15 02:00:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.1840490797546013) internal successors, (193), 163 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:00:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 197 transitions. [2022-02-15 02:00:42,605 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 197 transitions. Word has length 50 [2022-02-15 02:00:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:00:42,605 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 197 transitions. [2022-02-15 02:00:42,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 42 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-02-15 02:00:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 197 transitions. [2022-02-15 02:00:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-15 02:00:42,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:00:42,606 INFO L514 BasicCegarLoop]: trace histogram [17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:00:42,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-02-15 02:00:42,606 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:00:42,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:00:42,606 INFO L85 PathProgramCache]: Analyzing trace with hash 399223409, now seen corresponding path program 42 times [2022-02-15 02:00:42,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:00:42,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1696888707] [2022-02-15 02:00:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:00:42,652 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 02:00:42,652 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 02:00:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:00:42,656 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_48.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:00:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:00:42,675 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-02-15 02:00:43,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:00:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:00:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:00:45,252 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:00:45,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1696888707] [2022-02-15 02:00:45,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1696888707] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:00:45,253 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:00:45,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-02-15 02:00:45,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570745648] [2022-02-15 02:00:45,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:00:45,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-02-15 02:00:45,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:00:45,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-02-15 02:00:45,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2022-02-15 02:00:45,254 INFO L87 Difference]: Start difference. First operand 168 states and 197 transitions. Second operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:00:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:00:54,470 INFO L93 Difference]: Finished difference Result 299 states and 364 transitions. [2022-02-15 02:00:54,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-15 02:00:54,470 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 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 50 [2022-02-15 02:00:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:00:54,471 INFO L225 Difference]: With dead ends: 299 [2022-02-15 02:00:54,471 INFO L226 Difference]: Without dead ends: 293 [2022-02-15 02:00:54,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=843, Invalid=3317, Unknown=0, NotChecked=0, Total=4160 [2022-02-15 02:00:54,472 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 244 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-02-15 02:00:54,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 61 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-02-15 02:00:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-02-15 02:00:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 180. [2022-02-15 02:00:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 175 states have (on average 1.1828571428571428) internal successors, (207), 175 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:00:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 211 transitions. [2022-02-15 02:00:54,665 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 211 transitions. Word has length 50 [2022-02-15 02:00:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:00:54,665 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 211 transitions. [2022-02-15 02:00:54,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:00:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 211 transitions. [2022-02-15 02:00:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-15 02:00:54,666 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:00:54,666 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:00:54,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-02-15 02:00:54,666 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:00:54,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:00:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash -910449256, now seen corresponding path program 43 times [2022-02-15 02:00:54,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:00:54,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [531091388] [2022-02-15 02:00:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:00:54,708 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 02:00:54,709 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 02:00:54,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:00:54,714 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_49.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:00:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:00:54,748 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_49.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:00:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:00:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:00:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:00:56,886 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:00:56,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [531091388] [2022-02-15 02:00:56,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [531091388] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:00:56,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:00:56,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-02-15 02:00:56,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534179241] [2022-02-15 02:00:56,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:00:56,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-15 02:00:56,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:00:56,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-15 02:00:56,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-02-15 02:00:56,887 INFO L87 Difference]: Start difference. First operand 180 states and 211 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:01:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:01:12,156 INFO L93 Difference]: Finished difference Result 409 states and 478 transitions. [2022-02-15 02:01:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-15 02:01:12,157 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 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 51 [2022-02-15 02:01:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:01:12,158 INFO L225 Difference]: With dead ends: 409 [2022-02-15 02:01:12,158 INFO L226 Difference]: Without dead ends: 234 [2022-02-15 02:01:12,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=492, Invalid=5360, Unknown=0, NotChecked=0, Total=5852 [2022-02-15 02:01:12,159 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-02-15 02:01:12,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 119 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-02-15 02:01:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-15 02:01:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 170. [2022-02-15 02:01:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.1818181818181819) internal successors, (195), 165 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:01:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 199 transitions. [2022-02-15 02:01:12,399 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 199 transitions. Word has length 51 [2022-02-15 02:01:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:01:12,400 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 199 transitions. [2022-02-15 02:01:12,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:01:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 199 transitions. [2022-02-15 02:01:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-15 02:01:12,400 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:01:12,400 INFO L514 BasicCegarLoop]: trace histogram [18, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:01:12,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-02-15 02:01:12,401 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:01:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:01:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash -563208622, now seen corresponding path program 44 times [2022-02-15 02:01:12,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:01:12,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1472874932] [2022-02-15 02:01:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:01:12,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 02:01:12,452 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 02:01:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:01:12,458 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_50.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:01:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:01:12,478 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_50.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:01:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:01:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:01:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:01:15,772 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:01:15,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1472874932] [2022-02-15 02:01:15,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1472874932] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:01:15,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:01:15,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-02-15 02:01:15,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813316011] [2022-02-15 02:01:15,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:01:15,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-15 02:01:15,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:01:15,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-15 02:01:15,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=722, Unknown=0, NotChecked=0, Total=992 [2022-02-15 02:01:15,774 INFO L87 Difference]: Start difference. First operand 170 states and 199 transitions. Second operand has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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-02-15 02:01:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:01:31,337 INFO L93 Difference]: Finished difference Result 315 states and 385 transitions. [2022-02-15 02:01:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-02-15 02:01:31,337 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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 52 [2022-02-15 02:01:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:01:31,338 INFO L225 Difference]: With dead ends: 315 [2022-02-15 02:01:31,338 INFO L226 Difference]: Without dead ends: 309 [2022-02-15 02:01:31,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=993, Invalid=3837, Unknown=0, NotChecked=0, Total=4830 [2022-02-15 02:01:31,339 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 262 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-02-15 02:01:31,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 76 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-02-15 02:01:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-02-15 02:01:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 183. [2022-02-15 02:01:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 178 states have (on average 1.1853932584269662) internal successors, (211), 178 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:01:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-02-15 02:01:31,558 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 52 [2022-02-15 02:01:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:01:31,558 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-02-15 02:01:31,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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-02-15 02:01:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-02-15 02:01:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-15 02:01:31,559 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:01:31,559 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:01:31,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-02-15 02:01:31,559 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:01:31,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:01:31,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1536665754, now seen corresponding path program 45 times [2022-02-15 02:01:31,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:01:31,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [248571546] [2022-02-15 02:01:31,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:01:31,608 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 02:01:31,609 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 02:01:31,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:01:31,613 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_51.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:01:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:01:31,658 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_51.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:01:32,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:01:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:01:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:01:35,279 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:01:35,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [248571546] [2022-02-15 02:01:35,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [248571546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:01:35,279 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:01:35,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-02-15 02:01:35,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239620444] [2022-02-15 02:01:35,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:01:35,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-15 02:01:35,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:01:35,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-15 02:01:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2022-02-15 02:01:35,280 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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-02-15 02:02:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:02:26,472 INFO L93 Difference]: Finished difference Result 301 states and 353 transitions. [2022-02-15 02:02:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-15 02:02:26,473 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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-02-15 02:02:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:02:26,474 INFO L225 Difference]: With dead ends: 301 [2022-02-15 02:02:26,474 INFO L226 Difference]: Without dead ends: 275 [2022-02-15 02:02:26,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=767, Invalid=4203, Unknown=0, NotChecked=0, Total=4970 [2022-02-15 02:02:26,475 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 75 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-02-15 02:02:26,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 137 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2022-02-15 02:02:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-02-15 02:02:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 194. [2022-02-15 02:02:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 189 states have (on average 1.1746031746031746) internal successors, (222), 189 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 02:02:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2022-02-15 02:02:26,695 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 53 [2022-02-15 02:02:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:02:26,695 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2022-02-15 02:02:26,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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-02-15 02:02:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2022-02-15 02:02:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-15 02:02:26,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:02:26,696 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:02:26,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-02-15 02:02:26,696 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:02:26,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:02:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash 396126081, now seen corresponding path program 46 times [2022-02-15 02:02:26,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:02:26,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643721600] [2022-02-15 02:02:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:02:26,742 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 02:02:26,742 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 02:02:26,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:02:26,746 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_52.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:02:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:02:26,794 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_52.8))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-15 02:02:33,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:02:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:02:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.