/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-de31.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:12:23,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:12:23,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:12:23,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:12:23,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:12:23,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:12:23,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:12:23,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:12:23,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:12:23,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:12:23,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:12:23,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:12:23,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:12:23,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:12:23,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:12:23,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:12:23,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:12:23,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:12:23,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:12:23,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:12:23,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:12:23,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:12:23,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:12:23,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:12:23,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:12:23,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:12:23,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:12:23,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:12:23,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:12:23,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:12:23,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:12:23,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:12:23,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:12:23,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:12:23,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:12:23,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:12:23,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:12:23,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:12:23,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:12:23,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:12:23,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:12:23,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 21:12:23,670 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:12:23,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:12:23,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:12:23,673 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:12:23,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:12:23,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:12:23,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:12:23,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:12:23,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:12:23,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:12:23,675 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:12:23,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:12:23,675 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:12:23,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:12:23,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:12:23,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:12:23,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:12:23,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:12:23,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:12:23,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:12:23,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:12:23,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:12:23,676 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:12:23,677 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 21:12:23,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:12:23,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:12:23,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:12:23,941 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:12:23,942 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:12:23,942 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de31.c [2022-01-31 21:12:24,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dd4857b2/a4d713104ca1474d8ca251992db00411/FLAG944c01d1a [2022-01-31 21:12:24,365 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:12:24,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c [2022-01-31 21:12:24,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dd4857b2/a4d713104ca1474d8ca251992db00411/FLAG944c01d1a [2022-01-31 21:12:24,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dd4857b2/a4d713104ca1474d8ca251992db00411 [2022-01-31 21:12:24,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:12:24,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:12:24,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:12:24,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:12:24,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:12:24,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:12:24" (1/1) ... [2022-01-31 21:12:24,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7762b074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:24, skipping insertion in model container [2022-01-31 21:12:24,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:12:24" (1/1) ... [2022-01-31 21:12:24,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:12:24,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:12:24,538 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-de31.c[368,381] [2022-01-31 21:12:24,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:12:24,558 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:12:24,576 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-de31.c[368,381] [2022-01-31 21:12:24,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:12:24,593 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:12:24,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:24 WrapperNode [2022-01-31 21:12:24,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:12:24,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:12:24,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:12:24,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:12:24,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:24" (1/1) ... [2022-01-31 21:12:24,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:24" (1/1) ... [2022-01-31 21:12:24,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:24" (1/1) ... [2022-01-31 21:12:24,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:24" (1/1) ... [2022-01-31 21:12:24,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:24" (1/1) ... [2022-01-31 21:12:24,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:24" (1/1) ... [2022-01-31 21:12:24,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:24" (1/1) ... [2022-01-31 21:12:24,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:12:24,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:12:24,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:12:24,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:12:24,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:24" (1/1) ... [2022-01-31 21:12:24,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:12:24,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:12:24,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 21:12:24,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 21:12:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:12:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:12:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:12:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 21:12:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:12:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:12:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:12:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:12:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:12:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 21:12:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 21:12:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:12:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:12:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:12:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:12:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:12:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:12:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:12:24,772 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:12:24,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:12:24,896 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:12:24,900 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:12:24,901 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 21:12:24,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:12:24 BoogieIcfgContainer [2022-01-31 21:12:24,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:12:24,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:12:24,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:12:24,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:12:24,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:12:24" (1/3) ... [2022-01-31 21:12:24,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1380e669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:12:24, skipping insertion in model container [2022-01-31 21:12:24,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:24" (2/3) ... [2022-01-31 21:12:24,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1380e669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:12:24, skipping insertion in model container [2022-01-31 21:12:24,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:12:24" (3/3) ... [2022-01-31 21:12:24,909 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de31.c [2022-01-31 21:12:24,917 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:12:24,917 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:12:24,984 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:12:24,989 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-01-31 21:12:24,989 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:12:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 21:12:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 21:12:25,026 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:25,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:25,035 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:25,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:25,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-01-31 21:12:25,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:25,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [868261910] [2022-01-31 21:12:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:25,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:25,106 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:12:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:25,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:25,491 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:25,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [868261910] [2022-01-31 21:12:25,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [868261910] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:25,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:25,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:12:25,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404704027] [2022-01-31 21:12:25,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:25,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:12:25,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:25,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:12:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:12:25,528 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:25,813 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-01-31 21:12:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:12:25,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-01-31 21:12:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:25,819 INFO L225 Difference]: With dead ends: 49 [2022-01-31 21:12:25,819 INFO L226 Difference]: Without dead ends: 16 [2022-01-31 21:12:25,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:12:25,825 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:25,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:12:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-01-31 21:12:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-01-31 21:12:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-01-31 21:12:25,881 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2022-01-31 21:12:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:25,882 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-01-31 21:12:25,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-01-31 21:12:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 21:12:25,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:25,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:25,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:12:25,885 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:25,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash 595464366, now seen corresponding path program 1 times [2022-01-31 21:12:25,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:25,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1097134212] [2022-01-31 21:12:25,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:26,073 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:26,075 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:26,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:26,093 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:26,137 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:26,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:28,596 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:28,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1097134212] [2022-01-31 21:12:28,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1097134212] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:28,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:28,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:12:28,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121360137] [2022-01-31 21:12:28,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:28,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:12:28,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:28,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:12:28,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:12:28,600 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:29,166 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-01-31 21:12:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:12:29,168 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 21:12:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:29,168 INFO L225 Difference]: With dead ends: 22 [2022-01-31 21:12:29,168 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 21:12:29,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:12:29,170 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:29,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 13 Unchecked, 0.1s Time] [2022-01-31 21:12:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 21:12:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-31 21:12:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-01-31 21:12:29,176 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2022-01-31 21:12:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:29,177 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-01-31 21:12:29,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-01-31 21:12:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 21:12:29,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:29,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:29,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:12:29,178 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 1 times [2022-01-31 21:12:29,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:29,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1811313036] [2022-01-31 21:12:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:29,226 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:29,227 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:29,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:29,234 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:29,253 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:29,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:29,538 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:29,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1811313036] [2022-01-31 21:12:29,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1811313036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:29,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:29,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:12:29,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791392503] [2022-01-31 21:12:29,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:29,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:12:29,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:29,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:12:29,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:12:29,540 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:29,764 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-01-31 21:12:29,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:12:29,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 21:12:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:29,765 INFO L225 Difference]: With dead ends: 26 [2022-01-31 21:12:29,765 INFO L226 Difference]: Without dead ends: 19 [2022-01-31 21:12:29,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:12:29,767 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:29,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 28 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-01-31 21:12:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-31 21:12:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-01-31 21:12:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-01-31 21:12:29,774 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-01-31 21:12:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:29,774 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-01-31 21:12:29,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-01-31 21:12:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:12:29,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:29,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:29,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:12:29,775 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:29,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:29,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-01-31 21:12:29,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:29,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [674207295] [2022-01-31 21:12:29,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:29,855 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:29,855 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:29,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:29,870 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:29,913 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:30,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:32,658 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:32,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [674207295] [2022-01-31 21:12:32,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [674207295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:32,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:32,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:12:32,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928643670] [2022-01-31 21:12:32,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:32,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:12:32,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:32,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:12:32,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=148, Unknown=1, NotChecked=0, Total=182 [2022-01-31 21:12:32,660 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:45,657 WARN L228 SmtUtils]: Spent 12.88s on a formula simplification. DAG size of input: 49 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:12:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:45,938 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-01-31 21:12:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:12:45,938 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 21:12:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:45,941 INFO L225 Difference]: With dead ends: 26 [2022-01-31 21:12:45,941 INFO L226 Difference]: Without dead ends: 21 [2022-01-31 21:12:45,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=68, Invalid=351, Unknown=1, NotChecked=0, Total=420 [2022-01-31 21:12:45,944 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:45,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 47 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 77 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-01-31 21:12:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-31 21:12:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-01-31 21:12:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-01-31 21:12:45,955 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2022-01-31 21:12:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:45,955 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-01-31 21:12:45,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-01-31 21:12:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:12:45,956 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:45,956 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:45,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:12:45,956 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:45,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:45,957 INFO L85 PathProgramCache]: Analyzing trace with hash 656236558, now seen corresponding path program 2 times [2022-01-31 21:12:45,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:45,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [902515476] [2022-01-31 21:12:45,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:46,017 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:46,018 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:46,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:46,035 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:12:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:46,046 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:12:46,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:46,157 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:46,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [902515476] [2022-01-31 21:12:46,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [902515476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:46,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:46,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:12:46,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369456927] [2022-01-31 21:12:46,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:46,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:12:46,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:46,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:12:46,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:12:46,159 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:46,278 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-01-31 21:12:46,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:12:46,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 21:12:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:46,279 INFO L225 Difference]: With dead ends: 27 [2022-01-31 21:12:46,279 INFO L226 Difference]: Without dead ends: 19 [2022-01-31 21:12:46,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:12:46,280 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:46,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 39 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:12:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-31 21:12:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-31 21:12:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-01-31 21:12:46,288 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 18 [2022-01-31 21:12:46,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:46,289 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-01-31 21:12:46,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-01-31 21:12:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:12:46,289 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:46,290 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:46,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:12:46,290 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:46,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1194243967, now seen corresponding path program 3 times [2022-01-31 21:12:46,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:46,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950087781] [2022-01-31 21:12:46,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:46,350 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:46,351 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:46,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:46,357 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:46,390 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:46,457 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:46,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [950087781] [2022-01-31 21:12:46,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [950087781] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:46,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:46,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:12:46,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085813219] [2022-01-31 21:12:46,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:46,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:12:46,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:46,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:12:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:12:46,459 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:46,595 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-01-31 21:12:46,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:12:46,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 21:12:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:46,596 INFO L225 Difference]: With dead ends: 25 [2022-01-31 21:12:46,596 INFO L226 Difference]: Without dead ends: 20 [2022-01-31 21:12:46,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:12:46,598 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:46,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:12:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-31 21:12:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-01-31 21:12:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-01-31 21:12:46,606 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-01-31 21:12:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:46,606 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-01-31 21:12:46,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-01-31 21:12:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 21:12:46,607 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:46,607 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:46,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:12:46,607 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1598647602, now seen corresponding path program 4 times [2022-01-31 21:12:46,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:46,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187823813] [2022-01-31 21:12:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:46,649 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:46,650 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:46,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:46,655 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:46,675 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:46,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:47,189 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:47,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187823813] [2022-01-31 21:12:47,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1187823813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:47,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:47,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:12:47,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26660337] [2022-01-31 21:12:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:47,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:12:47,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:47,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:12:47,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:12:47,191 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:49,897 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-01-31 21:12:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:12:49,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 21:12:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:49,898 INFO L225 Difference]: With dead ends: 29 [2022-01-31 21:12:49,898 INFO L226 Difference]: Without dead ends: 24 [2022-01-31 21:12:49,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:12:49,899 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:49,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 57 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-01-31 21:12:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-31 21:12:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-01-31 21:12:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-01-31 21:12:49,910 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2022-01-31 21:12:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:49,910 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-01-31 21:12:49,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-01-31 21:12:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:12:49,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:49,911 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:49,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:12:49,911 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2016026975, now seen corresponding path program 5 times [2022-01-31 21:12:49,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:49,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1894399952] [2022-01-31 21:12:49,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:49,979 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:49,980 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:49,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:49,985 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:50,006 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:50,135 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:50,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1894399952] [2022-01-31 21:12:50,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1894399952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:50,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:50,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:12:50,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501511435] [2022-01-31 21:12:50,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:50,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:12:50,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:50,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:12:50,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:12:50,138 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:50,378 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-01-31 21:12:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:12:50,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-31 21:12:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:50,379 INFO L225 Difference]: With dead ends: 39 [2022-01-31 21:12:50,380 INFO L226 Difference]: Without dead ends: 22 [2022-01-31 21:12:50,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:12:50,381 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:50,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:12:50,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-31 21:12:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-31 21:12:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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-01-31 21:12:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-01-31 21:12:50,391 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2022-01-31 21:12:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:50,392 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-01-31 21:12:50,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-01-31 21:12:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 21:12:50,392 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:50,393 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:50,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:12:50,393 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1178216785, now seen corresponding path program 6 times [2022-01-31 21:12:50,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:50,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [544747385] [2022-01-31 21:12:50,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:50,458 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:50,458 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:50,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:50,463 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:12:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:50,479 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:12:50,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:50,603 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:50,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [544747385] [2022-01-31 21:12:50,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [544747385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:50,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:50,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:12:50,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056160125] [2022-01-31 21:12:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:50,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:12:50,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:50,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:12:50,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:12:50,604 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:50,881 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-01-31 21:12:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:12:50,882 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 21:12:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:50,882 INFO L225 Difference]: With dead ends: 28 [2022-01-31 21:12:50,882 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 21:12:50,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:12:50,883 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:50,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:12:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 21:12:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-31 21:12:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-01-31 21:12:50,892 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2022-01-31 21:12:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:50,893 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-01-31 21:12:50,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-01-31 21:12:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 21:12:50,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:50,893 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:50,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:12:50,894 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2130486882, now seen corresponding path program 7 times [2022-01-31 21:12:50,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:50,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618769389] [2022-01-31 21:12:50,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:50,937 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:50,937 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:50,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:50,942 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:50,967 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:51,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:54,212 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:54,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618769389] [2022-01-31 21:12:54,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1618769389] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:54,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:54,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:12:54,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869960714] [2022-01-31 21:12:54,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:54,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:12:54,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:54,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:12:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:12:54,214 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:56,876 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-01-31 21:12:56,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:12:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 21:12:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:56,877 INFO L225 Difference]: With dead ends: 33 [2022-01-31 21:12:56,877 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 21:12:56,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:12:56,878 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:56,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-01-31 21:12:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 21:12:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-01-31 21:12:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-01-31 21:12:56,892 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2022-01-31 21:12:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:56,893 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-01-31 21:12:56,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-01-31 21:12:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:12:56,894 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:56,894 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:56,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:12:56,894 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:56,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1586088817, now seen corresponding path program 8 times [2022-01-31 21:12:56,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:56,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [695854981] [2022-01-31 21:12:56,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:56,949 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:56,949 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:56,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:56,954 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:56,976 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:57,137 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:57,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [695854981] [2022-01-31 21:12:57,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [695854981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:57,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:57,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:12:57,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075884411] [2022-01-31 21:12:57,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:57,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:12:57,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:57,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:12:57,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:12:57,140 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:57,543 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-01-31 21:12:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:12:57,543 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 21:12:57,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:57,544 INFO L225 Difference]: With dead ends: 45 [2022-01-31 21:12:57,544 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 21:12:57,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:12:57,545 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:57,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 58 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:12:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 21:12:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 21:12:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-01-31 21:12:57,557 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2022-01-31 21:12:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:57,557 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-01-31 21:12:57,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-01-31 21:12:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 21:12:57,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:57,560 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:57,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:12:57,561 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1773782399, now seen corresponding path program 9 times [2022-01-31 21:12:57,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:57,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [163344700] [2022-01-31 21:12:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:57,606 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:57,607 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:57,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:57,613 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:57,637 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:57,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:57,816 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:57,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [163344700] [2022-01-31 21:12:57,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [163344700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:57,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:57,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:12:57,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104979246] [2022-01-31 21:12:57,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:57,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:12:57,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:12:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:12:57,818 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:58,295 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-01-31 21:12:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:12:58,295 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-01-31 21:12:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:58,296 INFO L225 Difference]: With dead ends: 31 [2022-01-31 21:12:58,296 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 21:12:58,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:12:58,297 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:58,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 61 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:12:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 21:12:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 21:12:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-01-31 21:12:58,307 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2022-01-31 21:12:58,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:58,308 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-01-31 21:12:58,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-01-31 21:12:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 21:12:58,308 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:58,308 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:58,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:12:58,309 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:58,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:58,309 INFO L85 PathProgramCache]: Analyzing trace with hash -812825394, now seen corresponding path program 10 times [2022-01-31 21:12:58,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:58,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [713135133] [2022-01-31 21:12:58,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:58,348 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:58,349 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:58,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:58,353 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:58,379 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:58,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:13:02,894 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:02,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [713135133] [2022-01-31 21:13:02,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [713135133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:02,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:02,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:13:02,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332409960] [2022-01-31 21:13:02,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:02,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:13:02,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:02,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:13:02,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:13:02,896 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.05) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:07,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:07,783 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-01-31 21:13:07,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:13:07,783 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.05) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-01-31 21:13:07,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:07,784 INFO L225 Difference]: With dead ends: 37 [2022-01-31 21:13:07,784 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 21:13:07,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:13:07,785 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:07,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 77 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 202 Invalid, 0 Unknown, 23 Unchecked, 0.2s Time] [2022-01-31 21:13:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 21:13:07,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-01-31 21:13:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-01-31 21:13:07,797 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2022-01-31 21:13:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:07,797 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-01-31 21:13:07,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.05) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-01-31 21:13:07,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 21:13:07,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:07,798 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:07,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:13:07,798 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:07,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash 606711647, now seen corresponding path program 11 times [2022-01-31 21:13:07,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:07,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [335159985] [2022-01-31 21:13:07,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:07,861 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:07,861 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:07,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:07,865 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:07,881 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:08,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:13:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:13:08,108 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:08,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [335159985] [2022-01-31 21:13:08,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [335159985] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:08,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:08,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:13:08,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344901409] [2022-01-31 21:13:08,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:08,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:13:08,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:08,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:13:08,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:13:08,110 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:08,719 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-01-31 21:13:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:13:08,719 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-01-31 21:13:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:08,720 INFO L225 Difference]: With dead ends: 51 [2022-01-31 21:13:08,720 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 21:13:08,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 21:13:08,721 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:08,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:13:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 21:13:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-31 21:13:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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-01-31 21:13:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-01-31 21:13:08,731 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2022-01-31 21:13:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:08,731 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-01-31 21:13:08,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-01-31 21:13:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 21:13:08,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:08,732 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:08,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:13:08,732 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1542928431, now seen corresponding path program 12 times [2022-01-31 21:13:08,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:08,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2102531874] [2022-01-31 21:13:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:08,778 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:08,778 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:08,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:08,782 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:08,796 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:08,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:13:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:13:09,049 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:09,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2102531874] [2022-01-31 21:13:09,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2102531874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:09,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:09,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:13:09,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58257321] [2022-01-31 21:13:09,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:09,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:13:09,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:09,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:13:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:13:09,050 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:09,893 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-01-31 21:13:09,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:13:09,893 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-01-31 21:13:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:09,894 INFO L225 Difference]: With dead ends: 34 [2022-01-31 21:13:09,894 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 21:13:09,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:13:09,895 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:09,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 81 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:13:09,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 21:13:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 21:13:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-01-31 21:13:09,904 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2022-01-31 21:13:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:09,904 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-01-31 21:13:09,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:09,904 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-01-31 21:13:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 21:13:09,905 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:09,905 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:09,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:13:09,905 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:09,906 INFO L85 PathProgramCache]: Analyzing trace with hash 620636190, now seen corresponding path program 13 times [2022-01-31 21:13:09,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:09,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2088141804] [2022-01-31 21:13:09,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:09,942 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:09,943 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:09,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:09,946 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:09,973 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:10,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:13:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:13:19,780 WARN L228 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:13:33,763 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:33,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2088141804] [2022-01-31 21:13:33,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2088141804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:33,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:33,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:13:33,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805444776] [2022-01-31 21:13:33,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:33,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:13:33,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:33,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:13:33,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=484, Unknown=1, NotChecked=0, Total=552 [2022-01-31 21:13:33,765 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:39,285 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-01-31 21:13:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 21:13:39,286 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-01-31 21:13:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:39,286 INFO L225 Difference]: With dead ends: 41 [2022-01-31 21:13:39,286 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 21:13:39,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=136, Invalid=1269, Unknown=1, NotChecked=0, Total=1406 [2022-01-31 21:13:39,287 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:39,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 243 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2022-01-31 21:13:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 21:13:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-01-31 21:13:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-01-31 21:13:39,302 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2022-01-31 21:13:39,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:39,302 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-01-31 21:13:39,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-01-31 21:13:39,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:13:39,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:39,303 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:39,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:13:39,303 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:39,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:39,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2094347791, now seen corresponding path program 14 times [2022-01-31 21:13:39,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:39,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1366284843] [2022-01-31 21:13:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:39,338 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:39,338 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:39,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:39,342 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:39,365 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:39,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:13:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:13:39,721 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:39,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1366284843] [2022-01-31 21:13:39,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1366284843] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:39,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:39,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:13:39,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253838573] [2022-01-31 21:13:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:39,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:13:39,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:39,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:13:39,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:13:39,723 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:40,589 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-01-31 21:13:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 21:13:40,590 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-01-31 21:13:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:40,590 INFO L225 Difference]: With dead ends: 57 [2022-01-31 21:13:40,590 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 21:13:40,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=1457, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 21:13:40,591 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:40,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:13:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 21:13:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-31 21:13:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-01-31 21:13:40,604 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 29 [2022-01-31 21:13:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:40,604 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-01-31 21:13:40,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-01-31 21:13:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:13:40,605 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:40,605 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:40,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:13:40,605 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:40,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:40,606 INFO L85 PathProgramCache]: Analyzing trace with hash 751514495, now seen corresponding path program 15 times [2022-01-31 21:13:40,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:40,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1506431727] [2022-01-31 21:13:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:40,638 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:40,638 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:40,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:40,642 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:13:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:40,659 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:13:40,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:13:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:13:41,078 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:13:41,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1506431727] [2022-01-31 21:13:41,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1506431727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:13:41,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:13:41,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:13:41,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632422634] [2022-01-31 21:13:41,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:13:41,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:13:41,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:13:41,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:13:41,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:13:41,079 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:13:42,728 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-01-31 21:13:42,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:13:42,728 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-01-31 21:13:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:13:42,728 INFO L225 Difference]: With dead ends: 37 [2022-01-31 21:13:42,729 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 21:13:42,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 21:13:42,729 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:13:42,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 86 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:13:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 21:13:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-31 21:13:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-01-31 21:13:42,746 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2022-01-31 21:13:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:13:42,746 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-01-31 21:13:42,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:13:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-01-31 21:13:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:13:42,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:13:42,747 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:13:42,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:13:42,747 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:13:42,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:13:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1856607950, now seen corresponding path program 16 times [2022-01-31 21:13:42,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:13:42,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [293769941] [2022-01-31 21:13:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:13:42,804 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:13:42,805 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:13:42,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:13:42,824 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:42,849 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:13:43,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:13:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:13:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:14:26,508 WARN L228 SmtUtils]: Spent 13.78s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:14:26,509 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:26,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [293769941] [2022-01-31 21:14:26,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [293769941] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:26,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:26,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:14:26,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590568063] [2022-01-31 21:14:26,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:26,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:14:26,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:14:26,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=394, Unknown=2, NotChecked=0, Total=462 [2022-01-31 21:14:26,511 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 20 states, 20 states have (on average 1.35) 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-01-31 21:14:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:30,714 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-01-31 21:14:30,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:14:30,714 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.35) 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 31 [2022-01-31 21:14:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:30,714 INFO L225 Difference]: With dead ends: 45 [2022-01-31 21:14:30,715 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 21:14:30,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=115, Invalid=939, Unknown=2, NotChecked=0, Total=1056 [2022-01-31 21:14:30,716 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:30,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 67 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 225 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-01-31 21:14:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 21:14:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-01-31 21:14:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-01-31 21:14:30,731 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 31 [2022-01-31 21:14:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:30,731 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-01-31 21:14:30,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.35) 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-01-31 21:14:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-01-31 21:14:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 21:14:30,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:30,731 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:30,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:14:30,732 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:30,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1754766687, now seen corresponding path program 17 times [2022-01-31 21:14:30,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:30,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1168170511] [2022-01-31 21:14:30,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:30,771 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:30,771 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:30,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:30,775 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:30,808 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:31,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:31,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-01-31 21:14:31,248 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:31,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1168170511] [2022-01-31 21:14:31,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1168170511] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:31,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:31,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:14:31,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001600878] [2022-01-31 21:14:31,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:31,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:14:31,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:31,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:14:31,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:14:31,250 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:32,721 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-01-31 21:14:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 21:14:32,721 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-01-31 21:14:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:32,722 INFO L225 Difference]: With dead ends: 63 [2022-01-31 21:14:32,722 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 21:14:32,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=228, Invalid=2028, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 21:14:32,723 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:32,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 98 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:14:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 21:14:32,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-31 21:14:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 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-01-31 21:14:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-01-31 21:14:32,742 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 32 [2022-01-31 21:14:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:32,742 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-01-31 21:14:32,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-01-31 21:14:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 21:14:32,745 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:32,745 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:32,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:14:32,745 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1766095279, now seen corresponding path program 18 times [2022-01-31 21:14:32,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:32,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1196318796] [2022-01-31 21:14:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:32,792 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:32,792 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:32,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:32,796 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:32,815 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:33,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:33,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-01-31 21:14:33,566 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:33,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1196318796] [2022-01-31 21:14:33,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1196318796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:33,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:33,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:14:33,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017774119] [2022-01-31 21:14:33,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:33,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:14:33,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:33,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:14:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:14:33,568 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:36,812 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-01-31 21:14:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:14:36,812 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-01-31 21:14:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:36,813 INFO L225 Difference]: With dead ends: 40 [2022-01-31 21:14:36,813 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 21:14:36,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=284, Invalid=1608, Unknown=0, NotChecked=0, Total=1892 [2022-01-31 21:14:36,814 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:36,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 96 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 21:14:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 21:14:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-01-31 21:14:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-01-31 21:14:36,831 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2022-01-31 21:14:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:36,831 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-01-31 21:14:36,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-01-31 21:14:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 21:14:36,832 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:36,832 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:36,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:14:36,832 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:36,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1051126114, now seen corresponding path program 19 times [2022-01-31 21:14:36,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:36,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [929328599] [2022-01-31 21:14:36,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:36,879 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:14:36,880 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:36,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:36,884 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:36,912 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:18,367 WARN L228 SmtUtils]: Spent 13.02s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:15:43,840 WARN L228 SmtUtils]: Spent 11.24s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:15:43,841 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:43,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [929328599] [2022-01-31 21:15:43,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [929328599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:43,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:43,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:15:43,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809516452] [2022-01-31 21:15:43,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:43,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:15:43,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:43,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:15:43,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=474, Unknown=1, NotChecked=0, Total=552 [2022-01-31 21:15:43,842 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:48,946 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-01-31 21:15:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 21:15:48,947 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-01-31 21:15:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:48,947 INFO L225 Difference]: With dead ends: 49 [2022-01-31 21:15:48,947 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 21:15:48,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 71.6s TimeCoverageRelationStatistics Valid=130, Invalid=1128, Unknown=2, NotChecked=0, Total=1260 [2022-01-31 21:15:48,949 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:48,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 87 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 291 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2022-01-31 21:15:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 21:15:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-01-31 21:15:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-01-31 21:15:48,968 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2022-01-31 21:15:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:48,968 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-01-31 21:15:48,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-01-31 21:15:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:15:48,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:48,968 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:48,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 21:15:48,968 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1809323919, now seen corresponding path program 20 times [2022-01-31 21:15:48,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:48,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1657668605] [2022-01-31 21:15:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:49,000 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:49,000 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:49,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:49,005 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:49,028 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:49,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:49,739 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:49,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1657668605] [2022-01-31 21:15:49,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1657668605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:49,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:49,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:15:49,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547062173] [2022-01-31 21:15:49,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:49,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:15:49,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:49,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:15:49,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:15:49,740 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:52,051 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-01-31 21:15:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 21:15:52,051 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-01-31 21:15:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:52,052 INFO L225 Difference]: With dead ends: 69 [2022-01-31 21:15:52,052 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 21:15:52,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=277, Invalid=2693, Unknown=0, NotChecked=0, Total=2970 [2022-01-31 21:15:52,053 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:52,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 108 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:15:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 21:15:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-01-31 21:15:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 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-01-31 21:15:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-01-31 21:15:52,080 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 35 [2022-01-31 21:15:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:52,081 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-01-31 21:15:52,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-01-31 21:15:52,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:15:52,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:52,081 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:52,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 21:15:52,081 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:52,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1944519039, now seen corresponding path program 21 times [2022-01-31 21:15:52,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:52,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1423807861] [2022-01-31 21:15:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:52,111 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:52,111 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:52,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:52,115 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:52,136 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:52,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:52,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-01-31 21:15:53,213 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:53,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1423807861] [2022-01-31 21:15:53,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1423807861] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:53,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:53,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:15:53,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990030808] [2022-01-31 21:15:53,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:53,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:15:53,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:53,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:15:53,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:15:53,215 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:58,899 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-01-31 21:15:58,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 21:15:58,899 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-01-31 21:15:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:58,900 INFO L225 Difference]: With dead ends: 43 [2022-01-31 21:15:58,900 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 21:15:58,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=356, Invalid=2094, Unknown=0, NotChecked=0, Total=2450 [2022-01-31 21:15:58,901 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:58,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 106 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-31 21:15:58,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 21:15:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-31 21:15:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-01-31 21:15:58,923 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 36 [2022-01-31 21:15:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:58,924 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-01-31 21:15:58,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-01-31 21:15:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 21:15:58,924 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:58,924 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:58,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 21:15:58,925 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:58,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash 185043150, now seen corresponding path program 22 times [2022-01-31 21:15:58,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:58,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1566568206] [2022-01-31 21:15:58,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:58,971 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:58,971 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:58,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:58,975 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:59,006 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:59,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:59,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-01-31 21:16:20,855 WARN L228 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:16:40,864 WARN L228 SmtUtils]: Spent 13.12s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:17:20,152 WARN L228 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:17:20,153 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:20,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1566568206] [2022-01-31 21:17:20,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1566568206] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:20,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:20,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 21:17:20,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148785939] [2022-01-31 21:17:20,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:20,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 21:17:20,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:20,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 21:17:20,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=555, Unknown=6, NotChecked=0, Total=650 [2022-01-31 21:17:20,154 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:21,899 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-01-31 21:17:21,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:17:21,899 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.375) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-01-31 21:17:21,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:21,900 INFO L225 Difference]: With dead ends: 53 [2022-01-31 21:17:21,900 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 21:17:21,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 82.5s TimeCoverageRelationStatistics Valid=146, Invalid=1330, Unknown=6, NotChecked=0, Total=1482 [2022-01-31 21:17:21,901 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:21,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 87 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 317 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2022-01-31 21:17:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 21:17:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-01-31 21:17:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-01-31 21:17:21,928 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 37 [2022-01-31 21:17:21,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:21,929 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-01-31 21:17:21,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.375) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-01-31 21:17:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 21:17:21,929 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:21,929 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:21,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 21:17:21,930 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1475865439, now seen corresponding path program 23 times [2022-01-31 21:17:21,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:21,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [939003699] [2022-01-31 21:17:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:21,971 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:21,971 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:21,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:21,976 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:22,018 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:22,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:17:23,115 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:23,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [939003699] [2022-01-31 21:17:23,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [939003699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:23,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:23,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 21:17:23,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958871263] [2022-01-31 21:17:23,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:23,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 21:17:23,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:23,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 21:17:23,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:17:23,117 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:27,554 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-01-31 21:17:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 21:17:27,554 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-01-31 21:17:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:27,554 INFO L225 Difference]: With dead ends: 75 [2022-01-31 21:17:27,554 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 21:17:27,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=330, Invalid=3452, Unknown=0, NotChecked=0, Total=3782 [2022-01-31 21:17:27,556 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:27,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 108 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 21:17:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 21:17:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-01-31 21:17:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 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-01-31 21:17:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-01-31 21:17:27,575 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 38 [2022-01-31 21:17:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:27,575 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-01-31 21:17:27,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-01-31 21:17:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 21:17:27,576 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:27,576 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:27,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 21:17:27,576 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash 638163759, now seen corresponding path program 24 times [2022-01-31 21:17:27,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:27,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [176985605] [2022-01-31 21:17:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:27,607 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:27,607 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:27,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:27,612 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:27,642 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:17:29,804 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:29,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [176985605] [2022-01-31 21:17:29,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [176985605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:29,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:29,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-31 21:17:29,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672262789] [2022-01-31 21:17:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:29,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 21:17:29,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:29,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 21:17:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:17:29,806 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:41,669 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-01-31 21:17:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 21:17:41,669 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-01-31 21:17:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:41,669 INFO L225 Difference]: With dead ends: 46 [2022-01-31 21:17:41,669 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 21:17:41,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=436, Invalid=2644, Unknown=0, NotChecked=0, Total=3080 [2022-01-31 21:17:41,670 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:41,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 121 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-01-31 21:17:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 21:17:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-31 21:17:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-01-31 21:17:41,695 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 39 [2022-01-31 21:17:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:41,695 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-01-31 21:17:41,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-01-31 21:17:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 21:17:41,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:41,695 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:41,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 21:17:41,696 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:41,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1657264866, now seen corresponding path program 25 times [2022-01-31 21:17:41,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:41,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2049602417] [2022-01-31 21:17:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:41,759 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:41,759 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:41,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:41,763 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:41,837 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:42,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:42,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-01-31 21:18:16,582 WARN L228 SmtUtils]: Spent 7.26s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:18:41,991 WARN L228 SmtUtils]: Spent 11.34s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:18:44,005 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 7 c_main_~x~0))) (and (< 0 (mod (+ c_main_~x~0 1) 4294967296)) (< 0 (mod (+ 3 c_main_~x~0) 4294967296)) (< 0 (mod (+ 5 c_main_~x~0) 4294967296)) (< 0 (mod (+ 6 c_main_~x~0) 4294967296)) (< 0 (mod (+ 4 c_main_~x~0) 4294967296)) (< 0 (mod (+ 2 c_main_~x~0) 4294967296)) (or (and (< 7 c_main_~y~0) (= (+ c_main_~x~0 c_main_~y~0) c_main_~n~0) (< 0 (mod c_main_~n~0 4294967296)) (forall ((v_it_27 Int)) (or (not (<= 1 v_it_27)) (not (<= (+ v_it_27 8) c_main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_27) c_main_~n~0) 4294967296))))) (and (= c_main_~n~0 .cse0) (= (+ (- 7) c_main_~y~0) 0))) (< 0 (mod .cse0 4294967296)))) is different from false [2022-01-31 21:19:18,840 WARN L228 SmtUtils]: Spent 11.08s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:19:18,840 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:18,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2049602417] [2022-01-31 21:19:18,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2049602417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:18,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:18,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-01-31 21:19:18,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395836840] [2022-01-31 21:19:18,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:18,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 21:19:18,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:18,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 21:19:18,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1136, Unknown=9, NotChecked=68, Total=1332 [2022-01-31 21:19:18,842 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:19:41,054 WARN L228 SmtUtils]: Spent 13.56s on a formula simplification. DAG size of input: 73 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:20:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:03,245 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-01-31 21:20:03,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 21:20:03,245 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-01-31 21:20:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:03,246 INFO L225 Difference]: With dead ends: 57 [2022-01-31 21:20:03,246 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 21:20:03,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 140.7s TimeCoverageRelationStatistics Valid=245, Invalid=3289, Unknown=10, NotChecked=116, Total=3660 [2022-01-31 21:20:03,247 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:03,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 560 Invalid, 0 Unknown, 132 Unchecked, 0.4s Time] [2022-01-31 21:20:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 21:20:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-01-31 21:20:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-01-31 21:20:03,270 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2022-01-31 21:20:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:03,270 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-01-31 21:20:03,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-01-31 21:20:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:20:03,271 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:03,271 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:20:03,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 21:20:03,271 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:03,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:03,271 INFO L85 PathProgramCache]: Analyzing trace with hash 198891791, now seen corresponding path program 26 times [2022-01-31 21:20:03,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:03,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1611324037] [2022-01-31 21:20:03,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:03,320 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:20:03,321 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:03,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:03,325 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:03,355 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:03,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:20:05,204 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:05,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1611324037] [2022-01-31 21:20:05,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1611324037] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:05,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:05,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 21:20:05,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152514810] [2022-01-31 21:20:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:05,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 21:20:05,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:05,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 21:20:05,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:20:05,205 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:13,704 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-01-31 21:20:13,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 21:20:13,704 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-01-31 21:20:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:13,704 INFO L225 Difference]: With dead ends: 81 [2022-01-31 21:20:13,704 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 21:20:13,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=387, Invalid=4305, Unknown=0, NotChecked=0, Total=4692 [2022-01-31 21:20:13,706 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:13,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 118 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-31 21:20:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 21:20:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-31 21:20:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 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-01-31 21:20:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-01-31 21:20:13,731 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 41 [2022-01-31 21:20:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:13,731 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-01-31 21:20:13,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-01-31 21:20:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:20:13,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:13,732 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:20:13,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 21:20:13,732 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:13,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1251028863, now seen corresponding path program 27 times [2022-01-31 21:20:13,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:13,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1389343375] [2022-01-31 21:20:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:13,775 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:20:13,775 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:13,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:13,779 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:13,809 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:20:17,075 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:17,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1389343375] [2022-01-31 21:20:17,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1389343375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:17,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:17,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 21:20:17,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569830698] [2022-01-31 21:20:17,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:17,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 21:20:17,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 21:20:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:20:17,077 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:36,880 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-01-31 21:20:36,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 21:20:36,880 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-01-31 21:20:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:36,881 INFO L225 Difference]: With dead ends: 49 [2022-01-31 21:20:36,881 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 21:20:36,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=524, Invalid=3258, Unknown=0, NotChecked=0, Total=3782 [2022-01-31 21:20:36,882 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:36,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 131 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-01-31 21:20:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 21:20:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-01-31 21:20:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-01-31 21:20:36,912 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 42 [2022-01-31 21:20:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:36,912 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-01-31 21:20:36,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:20:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-01-31 21:20:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 21:20:36,913 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:36,913 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:20:36,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 21:20:36,913 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:36,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash 161684174, now seen corresponding path program 28 times [2022-01-31 21:20:36,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:36,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1408439960] [2022-01-31 21:20:36,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:36,946 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:20:36,946 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:36,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:36,950 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:36,988 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:37,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:21:05,307 WARN L228 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:21:21,370 WARN L228 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:21:57,595 WARN L228 SmtUtils]: Spent 16.89s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:22:37,688 WARN L228 SmtUtils]: Spent 12.46s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:23:21,325 WARN L228 SmtUtils]: Spent 16.94s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:24:22,305 WARN L228 SmtUtils]: Spent 18.13s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:24:22,306 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:22,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1408439960] [2022-01-31 21:24:22,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1408439960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:22,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:22,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-01-31 21:24:22,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144239362] [2022-01-31 21:24:22,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:22,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 21:24:22,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:22,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 21:24:22,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1385, Unknown=29, NotChecked=0, Total=1560 [2022-01-31 21:24:22,307 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:24:25,572 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-01-31 21:24:25,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:24:25,572 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-01-31 21:24:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:24:25,573 INFO L225 Difference]: With dead ends: 61 [2022-01-31 21:24:25,573 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 21:24:25,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 227.9s TimeCoverageRelationStatistics Valid=221, Invalid=2719, Unknown=30, NotChecked=0, Total=2970 [2022-01-31 21:24:25,574 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:24:25,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 112 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 538 Invalid, 0 Unknown, 32 Unchecked, 0.3s Time] [2022-01-31 21:24:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 21:24:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2022-01-31 21:24:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-01-31 21:24:25,602 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 43 [2022-01-31 21:24:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:24:25,602 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-01-31 21:24:25,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-01-31 21:24:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:24:25,602 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:24:25,602 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:24:25,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 21:24:25,603 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:24:25,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:24:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash 751737183, now seen corresponding path program 29 times [2022-01-31 21:24:25,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:24:25,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [142449477] [2022-01-31 21:24:25,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:24:25,646 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:24:25,646 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:24:25,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:24:25,651 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:24:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:25,685 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:24:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:24:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:24:29,200 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:29,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [142449477] [2022-01-31 21:24:29,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [142449477] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:29,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:29,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-31 21:24:29,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905071482] [2022-01-31 21:24:29,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:29,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 21:24:29,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:29,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 21:24:29,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 21:24:29,202 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:24:43,454 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-01-31 21:24:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-31 21:24:43,454 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-01-31 21:24:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:24:43,454 INFO L225 Difference]: With dead ends: 87 [2022-01-31 21:24:43,454 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 21:24:43,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=448, Invalid=5252, Unknown=0, NotChecked=0, Total=5700 [2022-01-31 21:24:43,456 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:24:43,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 138 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-01-31 21:24:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 21:24:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-31 21:24:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-01-31 21:24:43,484 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 44 [2022-01-31 21:24:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:24:43,485 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-01-31 21:24:43,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-01-31 21:24:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 21:24:43,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:24:43,485 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:24:43,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 21:24:43,485 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:24:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:24:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1633510225, now seen corresponding path program 30 times [2022-01-31 21:24:43,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:24:43,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1264777417] [2022-01-31 21:24:43,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:24:43,536 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:24:43,536 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:24:43,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:24:43,540 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:24:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:43,567 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:24:43,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:24:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:24:48,576 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:48,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1264777417] [2022-01-31 21:24:48,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1264777417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:48,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:48,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-01-31 21:24:48,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37939091] [2022-01-31 21:24:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:48,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 21:24:48,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 21:24:48,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:24:48,578 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:25,236 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-01-31 21:25:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-31 21:25:25,237 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-01-31 21:25:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:25,237 INFO L225 Difference]: With dead ends: 52 [2022-01-31 21:25:25,237 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 21:25:25,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=620, Invalid=3936, Unknown=0, NotChecked=0, Total=4556 [2022-01-31 21:25:25,238 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:25,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 141 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2022-01-31 21:25:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 21:25:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-01-31 21:25:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-01-31 21:25:25,264 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 45 [2022-01-31 21:25:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:25,264 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-01-31 21:25:25,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-01-31 21:25:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:25:25,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:25,264 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:25:25,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 21:25:25,264 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:25,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:25,265 INFO L85 PathProgramCache]: Analyzing trace with hash 935285662, now seen corresponding path program 31 times [2022-01-31 21:25:25,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:25,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819886356] [2022-01-31 21:25:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:25,301 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:25,301 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:25:25,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:25,305 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:25:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:25,362 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:25:26,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:26:08,371 WARN L228 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:26:43,418 WARN L228 SmtUtils]: Spent 13.81s 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)