/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/iftelse.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 13:18:20,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 13:18:20,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 13:18:20,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 13:18:20,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 13:18:20,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 13:18:20,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 13:18:20,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 13:18:20,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 13:18:20,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 13:18:20,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 13:18:20,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 13:18:20,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 13:18:20,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 13:18:20,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 13:18:20,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 13:18:20,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 13:18:20,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 13:18:20,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 13:18:20,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 13:18:20,518 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 13:18:20,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 13:18:20,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 13:18:20,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 13:18:20,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 13:18:20,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 13:18:20,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 13:18:20,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 13:18:20,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 13:18:20,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 13:18:20,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 13:18:20,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 13:18:20,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 13:18:20,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 13:18:20,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 13:18:20,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 13:18:20,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 13:18:20,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 13:18:20,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 13:18:20,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 13:18:20,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 13:18:20,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 13:18:20,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-20 13:18:20,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 13:18:20,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 13:18:20,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 13:18:20,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 13:18:20,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 13:18:20,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 13:18:20,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 13:18:20,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 13:18:20,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 13:18:20,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 13:18:20,543 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 13:18:20,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 13:18:20,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 13:18:20,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 13:18:20,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 13:18:20,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 13:18:20,543 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 13:18:20,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 13:18:20,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 13:18:20,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 13:18:20,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 13:18:20,544 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 13:18:20,544 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 13:18:20,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 13:18:20,544 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-20 13:18:20,544 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-03-20 13:18:20,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 13:18:20,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 13:18:20,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 13:18:20,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 13:18:20,766 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 13:18:20,767 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-03-20 13:18:20,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c9b5c5b9/4568e05337d34ec3b83168bd8089eb09/FLAGfcfc316d7 [2022-03-20 13:18:21,178 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 13:18:21,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-03-20 13:18:21,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c9b5c5b9/4568e05337d34ec3b83168bd8089eb09/FLAGfcfc316d7 [2022-03-20 13:18:21,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c9b5c5b9/4568e05337d34ec3b83168bd8089eb09 [2022-03-20 13:18:21,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 13:18:21,200 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 13:18:21,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 13:18:21,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 13:18:21,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 13:18:21,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:18:21" (1/1) ... [2022-03-20 13:18:21,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd2a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:18:21, skipping insertion in model container [2022-03-20 13:18:21,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:18:21" (1/1) ... [2022-03-20 13:18:21,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 13:18:21,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 13:18:21,361 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/iftelse.c[406,419] [2022-03-20 13:18:21,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 13:18:21,386 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 13:18:21,394 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/iftelse.c[406,419] [2022-03-20 13:18:21,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 13:18:21,414 INFO L208 MainTranslator]: Completed translation [2022-03-20 13:18:21,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:18:21 WrapperNode [2022-03-20 13:18:21,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 13:18:21,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 13:18:21,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 13:18:21,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 13:18:21,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:18:21" (1/1) ... [2022-03-20 13:18:21,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:18:21" (1/1) ... [2022-03-20 13:18:21,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:18:21" (1/1) ... [2022-03-20 13:18:21,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:18:21" (1/1) ... [2022-03-20 13:18:21,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:18:21" (1/1) ... [2022-03-20 13:18:21,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:18:21" (1/1) ... [2022-03-20 13:18:21,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:18:21" (1/1) ... [2022-03-20 13:18:21,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 13:18:21,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 13:18:21,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 13:18:21,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 13:18:21,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:18:21" (1/1) ... [2022-03-20 13:18:21,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 13:18:21,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:18:21,492 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-03-20 13:18:21,524 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-03-20 13:18:21,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 13:18:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 13:18:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 13:18:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 13:18:21,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 13:18:21,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 13:18:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 13:18:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 13:18:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 13:18:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 13:18:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 13:18:21,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 13:18:21,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-20 13:18:21,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 13:18:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 13:18:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 13:18:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 13:18:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 13:18:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 13:18:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 13:18:21,590 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 13:18:21,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 13:18:21,699 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 13:18:21,703 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 13:18:21,703 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 13:18:21,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:18:21 BoogieIcfgContainer [2022-03-20 13:18:21,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 13:18:21,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 13:18:21,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 13:18:21,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 13:18:21,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 01:18:21" (1/3) ... [2022-03-20 13:18:21,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661136e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:18:21, skipping insertion in model container [2022-03-20 13:18:21,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:18:21" (2/3) ... [2022-03-20 13:18:21,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661136e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:18:21, skipping insertion in model container [2022-03-20 13:18:21,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:18:21" (3/3) ... [2022-03-20 13:18:21,728 INFO L111 eAbstractionObserver]: Analyzing ICFG iftelse.c [2022-03-20 13:18:21,731 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 13:18:21,732 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 13:18:21,783 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 13:18:21,787 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, 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 [2022-03-20 13:18:21,788 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 13:18:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 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-03-20 13:18:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-20 13:18:21,820 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:18:21,820 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 13:18:21,821 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:18:21,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:18:21,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1034116429, now seen corresponding path program 1 times [2022-03-20 13:18:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:18:21,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [944458872] [2022-03-20 13:18:21,849 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:18:21,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1034116429, now seen corresponding path program 2 times [2022-03-20 13:18:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:18:21,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105369646] [2022-03-20 13:18:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:18:21,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:18:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:18:22,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:18:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:18:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 13:18:22,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:18:22,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105369646] [2022-03-20 13:18:22,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105369646] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:18:22,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:18:22,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 13:18:22,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:18:22,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [944458872] [2022-03-20 13:18:22,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [944458872] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:18:22,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:18:22,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 13:18:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732187462] [2022-03-20 13:18:22,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:18:22,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 13:18:22,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:18:22,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 13:18:22,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-03-20 13:18:22,269 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 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-03-20 13:18:24,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:18:26,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:18:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:18:26,799 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-03-20 13:18:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 13:18:26,800 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-03-20 13:18:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:18:26,805 INFO L225 Difference]: With dead ends: 53 [2022-03-20 13:18:26,805 INFO L226 Difference]: Without dead ends: 27 [2022-03-20 13:18:26,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-03-20 13:18:26,809 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-20 13:18:26,810 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-03-20 13:18:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-20 13:18:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-03-20 13:18:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 13:18:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-03-20 13:18:26,835 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-03-20 13:18:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:18:26,835 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-03-20 13:18:26,835 INFO L479 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-03-20 13:18:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-03-20 13:18:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 13:18:26,836 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:18:26,836 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 13:18:26,836 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 13:18:26,837 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:18:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:18:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash -244126219, now seen corresponding path program 1 times [2022-03-20 13:18:26,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:18:26,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [707268444] [2022-03-20 13:18:26,945 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-03-20 13:18:26,946 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 13:18:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1655658973, now seen corresponding path program 1 times [2022-03-20 13:18:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:18:26,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873614825] [2022-03-20 13:18:26,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:18:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:18:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:18:27,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:18:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:18:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 13:18:27,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:18:27,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873614825] [2022-03-20 13:18:27,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873614825] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:18:27,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:18:27,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 13:18:27,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:18:27,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [707268444] [2022-03-20 13:18:27,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [707268444] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:18:27,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:18:27,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 13:18:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197182020] [2022-03-20 13:18:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:18:27,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 13:18:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:18:27,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 13:18:27,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-03-20 13:18:27,253 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 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-03-20 13:18:29,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:18:31,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:18:33,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:18:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:18:33,565 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-03-20 13:18:33,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 13:18:33,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 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-03-20 13:18:33,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:18:33,645 INFO L225 Difference]: With dead ends: 36 [2022-03-20 13:18:33,645 INFO L226 Difference]: Without dead ends: 26 [2022-03-20 13:18:33,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-03-20 13:18:33,646 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-03-20 13:18:33,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 39 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2022-03-20 13:18:33,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-03-20 13:18:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-03-20 13:18:33,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 13:18:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-03-20 13:18:33,654 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2022-03-20 13:18:33,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:18:33,654 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-03-20 13:18:33,654 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 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-03-20 13:18:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-03-20 13:18:33,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 13:18:33,655 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:18:33,655 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 13:18:33,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 13:18:33,655 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:18:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:18:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash 722095884, now seen corresponding path program 1 times [2022-03-20 13:18:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:18:33,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [681450360] [2022-03-20 13:20:17,241 WARN L232 SmtUtils]: Spent 1.73m on a formula simplification. DAG size of input: 74 DAG size of output: 72 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-03-20 13:20:17,243 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-20 13:20:17,243 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 13:20:17,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1673647587, now seen corresponding path program 1 times [2022-03-20 13:20:17,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:20:17,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335810132] [2022-03-20 13:20:17,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:20:17,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:20:17,255 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= .v_it_2.0 (+ (* (- 1) main_~i~0_6) (* 2 (div (+ main_~i~0_6 .v_it_2.0 1) 2)) (- 1)))) [2022-03-20 13:20:17,259 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~n~0_5 (* (- 4294967296) (div main_~n~0_5 4294967296)) (* (- 1) main_~i~0_6) (* (- 3) .v_it_2.0) (* 4294967296 (div (+ main_~i~0_6 (* 3 .v_it_2.0)) 4294967296))) 0)) [2022-03-20 13:20:17,259 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (let ((.cse1 (* 3 .v_it_2.0))) (let ((.cse0 (div (+ main_~i~0_6 .cse1 (* (- 4294967296) (div (+ main_~i~0_6 .cse1 3) 4294967296)) 3) 2))) (+ .cse0 (* (- 4294967296) (div .cse0 4294967296)) (* (- 1) main_~j~0_6) (* (- 3) .v_it_2.0) (* 4294967296 (div (+ main_~j~0_6 .cse1 3) 4294967296)) (- 3)))) 0) [2022-03-20 13:20:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:20:17,344 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= .v_it_2.3 (+ (* (- 1) main_~i~0_6) (* 2 (div (+ main_~i~0_6 .v_it_2.3 1) 2)) (- 1)))) [2022-03-20 13:20:17,345 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~n~0_5 (* (- 4294967296) (div main_~n~0_5 4294967296)) (* (- 1) main_~i~0_6) (* (- 3) .v_it_2.3) (* 4294967296 (div (+ main_~i~0_6 (* 3 .v_it_2.3)) 4294967296))) 0)) [2022-03-20 13:20:17,345 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (let ((.cse1 (* 3 .v_it_2.3))) (let ((.cse0 (div (+ main_~i~0_6 .cse1 (* (- 4294967296) (div (+ main_~i~0_6 .cse1 3) 4294967296)) 3) 2))) (+ .cse0 (* (- 4294967296) (div .cse0 4294967296)) (* (- 1) main_~j~0_6) (* (- 3) .v_it_2.3) (* 4294967296 (div (+ main_~j~0_6 .cse1 3) 4294967296)) (- 3)))) 0) [2022-03-20 13:20:17,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:20:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:20:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 13:20:17,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:20:17,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335810132] [2022-03-20 13:20:17,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335810132] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:20:17,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:20:17,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 13:20:37,102 WARN L232 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 56 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 13:21:04,725 WARN L232 SmtUtils]: Spent 16.91s 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-03-20 13:21:13,337 WARN L833 $PredicateComparison]: unable to prove that (exists ((aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_1_33_111 Int) (aux_div_aux_mod_v_main_~i~0_BEFORE_CALL_1_33_111 Int) (v_main_~j~0_BEFORE_CALL_1 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_1_42_53 Int) (aux_div_v_main_~i~0_BEFORE_CALL_1_33 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_CALL_1_42_53 Int)) (let ((.cse3 (* aux_div_v_main_~i~0_BEFORE_CALL_1_33 2))) (let ((.cse2 (+ (* aux_div_aux_mod_v_main_~n~0_BEFORE_CALL_1_42_53 4294967296) aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_1_42_53)) (.cse0 (+ .cse3 4294967293)) (.cse1 (+ (* aux_div_aux_mod_v_main_~i~0_BEFORE_CALL_1_33_111 4294967296) aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_1_33_111))) (and (not (= .cse0 .cse1)) (<= .cse2 20000001) (< .cse1 (+ 4294967295 .cse3)) (< aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_1_42_53 4294967296) (< aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_1_33_111 4294967296) (<= 0 aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_1_33_111) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_1_42_53) (or (and (= 4294967296 .cse1) (= 3 v_main_~j~0_BEFORE_CALL_1)) (let ((.cse4 (div (+ (* (- 1) v_main_~j~0_BEFORE_CALL_1) 3) (- 3)))) (and (< 0 .cse4) (= (mod (* 2 v_main_~j~0_BEFORE_CALL_1) 3) 0) (forall ((v_it_2 Int)) (let ((.cse6 (+ v_it_2 1))) (or (not (<= 1 v_it_2)) (let ((.cse5 (* v_it_2 3))) (and (< (mod .cse5 4294967296) (mod aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_1_42_53 4294967296)) (not (= (mod .cse6 2) 0)) (let ((.cse7 (mod (+ 3 .cse5) 4294967296))) (<= (mod (div .cse7 2) 4294967296) .cse7)))) (not (<= .cse6 (div (+ (* (- 1) v_main_~j~0_BEFORE_CALL_1) 3) (- 3))))))) (= .cse1 (+ (* 3 .cse4) 4294967296))))) (let ((.cse8 (<= (mod (div (mod (+ 3 aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_1_33_111) 4294967296) 2) 4294967296) (mod v_main_~j~0_BEFORE_CALL_1 4294967296)))) (or (and (= |c___VERIFIER_assert_#in~cond| 1) .cse8) (and (not .cse8) (= |c___VERIFIER_assert_#in~cond| 0)))) (<= 0 .cse2) (< aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_1_33_111 aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_1_42_53) (<= .cse0 .cse1))))) is different from false [2022-03-20 13:21:15,484 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) 20000001)) (exists ((v_main_~j~0_16 Int) (aux_div_v_main_~i~0_19_22 Int) (aux_div_aux_mod_v_main_~i~0_19_22_89 Int) (aux_mod_aux_mod_v_main_~i~0_19_22_89 Int)) (let ((.cse1 (* aux_div_aux_mod_v_main_~i~0_19_22_89 4294967296))) (let ((.cse3 (* 2 aux_div_v_main_~i~0_19_22)) (.cse2 (+ aux_mod_aux_mod_v_main_~i~0_19_22_89 .cse1))) (and (< aux_mod_aux_mod_v_main_~i~0_19_22_89 (mod c_main_~n~0 4294967296)) (let ((.cse0 (<= (mod (div (mod (+ 3 aux_mod_aux_mod_v_main_~i~0_19_22_89) 4294967296) 2) 4294967296) (mod v_main_~j~0_16 4294967296)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| 0)) (and .cse0 (= |c___VERIFIER_assert_#in~cond| 1)))) (not (= (+ (- 4294967293) (* (- 2) aux_div_v_main_~i~0_19_22) aux_mod_aux_mod_v_main_~i~0_19_22_89 .cse1) 0)) (< .cse2 (+ 4294967295 .cse3)) (let ((.cse8 (+ (- 4294967293) aux_mod_aux_mod_v_main_~i~0_19_22_89 .cse1))) (or (let ((.cse4 (div (+ (* v_main_~j~0_16 (- 1)) 3) (- 3)))) (and (< 0 .cse4) (forall ((v_it_2 Int)) (let ((.cse6 (+ v_it_2 1))) (or (not (<= 1 v_it_2)) (let ((.cse5 (* v_it_2 3))) (and (< (mod .cse5 4294967296) (mod c_main_~n~0 4294967296)) (not (= (mod .cse6 2) 0)) (let ((.cse7 (mod (+ 3 .cse5) 4294967296))) (<= (mod (div .cse7 2) 4294967296) .cse7)))) (not (<= .cse6 (div (+ (* v_main_~j~0_16 (- 1)) 3) (- 3))))))) (= (mod (* v_main_~j~0_16 2) 3) 0) (= .cse8 (+ (* 3 .cse4) 3)))) (and (= .cse8 3) (= (+ v_main_~j~0_16 (- 3)) 0)))) (<= (+ .cse3 4294967293) .cse2) (<= 0 aux_mod_aux_mod_v_main_~i~0_19_22_89) (< aux_mod_aux_mod_v_main_~i~0_19_22_89 4294967296)))))) is different from false [2022-03-20 13:21:17,625 WARN L833 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (<= c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) 20000001)) (exists ((v_main_~j~0_16 Int) (aux_div_v_main_~i~0_19_22 Int) (aux_div_aux_mod_v_main_~i~0_19_22_89 Int) (aux_mod_aux_mod_v_main_~i~0_19_22_89 Int)) (let ((.cse1 (* aux_div_aux_mod_v_main_~i~0_19_22_89 4294967296))) (let ((.cse3 (* 2 aux_div_v_main_~i~0_19_22)) (.cse2 (+ aux_mod_aux_mod_v_main_~i~0_19_22_89 .cse1))) (and (< aux_mod_aux_mod_v_main_~i~0_19_22_89 (mod c_main_~n~0 4294967296)) (let ((.cse0 (<= (mod (div (mod (+ 3 aux_mod_aux_mod_v_main_~i~0_19_22_89) 4294967296) 2) 4294967296) (mod v_main_~j~0_16 4294967296)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| 0)) (and .cse0 (= |c___VERIFIER_assert_#in~cond| 1)))) (not (= (+ (- 4294967293) (* (- 2) aux_div_v_main_~i~0_19_22) aux_mod_aux_mod_v_main_~i~0_19_22_89 .cse1) 0)) (< .cse2 (+ 4294967295 .cse3)) (let ((.cse8 (+ (- 4294967293) aux_mod_aux_mod_v_main_~i~0_19_22_89 .cse1))) (or (let ((.cse4 (div (+ (* v_main_~j~0_16 (- 1)) 3) (- 3)))) (and (< 0 .cse4) (forall ((v_it_2 Int)) (let ((.cse6 (+ v_it_2 1))) (or (not (<= 1 v_it_2)) (let ((.cse5 (* v_it_2 3))) (and (< (mod .cse5 4294967296) (mod c_main_~n~0 4294967296)) (not (= (mod .cse6 2) 0)) (let ((.cse7 (mod (+ 3 .cse5) 4294967296))) (<= (mod (div .cse7 2) 4294967296) .cse7)))) (not (<= .cse6 (div (+ (* v_main_~j~0_16 (- 1)) 3) (- 3))))))) (= (mod (* v_main_~j~0_16 2) 3) 0) (= .cse8 (+ (* 3 .cse4) 3)))) (and (= .cse8 3) (= (+ v_main_~j~0_16 (- 3)) 0)))) (<= (+ .cse3 4294967293) .cse2) (<= 0 aux_mod_aux_mod_v_main_~i~0_19_22_89) (< aux_mod_aux_mod_v_main_~i~0_19_22_89 4294967296)))))) is different from false [2022-03-20 13:21:49,328 WARN L232 SmtUtils]: Spent 16.86s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 13:21:51,526 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((aux_div_v_main_~i~0_19_22 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55_75 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_19_22_89_59 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_113 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55_75 Int) (aux_div_aux_mod_v_main_~i~0_19_22_89 Int) (aux_mod_v_main_~j~0_16_31 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_113 Int) (aux_div_v_main_~n~0_BEFORE_RETURN_1_44 Int) (aux_div_v_main_~j~0_16_31 Int)) (let ((.cse4 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55_75)) (.cse5 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55_75 2)) (.cse6 (* aux_div_aux_mod_aux_mod_v_main_~i~0_19_22_89_59 4294967296)) (.cse7 (* aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_113 4294967296)) (.cse2 (* 2 aux_div_v_main_~i~0_19_22))) (let ((.cse0 (+ 4294967296 .cse2)) (.cse3 (* aux_div_v_main_~n~0_BEFORE_RETURN_1_44 4294967296)) (.cse9 (+ .cse7 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_113)) (.cse8 (+ .cse4 .cse5 .cse6 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55)) (.cse1 (+ .cse4 .cse5 .cse6 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55 (* aux_div_aux_mod_v_main_~i~0_19_22_89 4294967296))) (.cse10 (+ .cse4 .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55))) (and (<= .cse0 .cse1) (<= aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_113 20000001) (not (= .cse0 .cse1)) (< .cse1 (+ .cse2 4294967298)) (< (+ .cse3 .cse4 .cse5 .cse6 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55) (+ .cse7 3 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_113)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55_75 4294967296) (< .cse8 4294967299) (< aux_mod_v_main_~j~0_16_31 4294967296) (< .cse9 (+ .cse3 4294967296)) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55_75 aux_mod_v_main_~j~0_16_31) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55 2) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55_75) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_113) (< .cse10 4294967296) (<= 0 aux_mod_v_main_~j~0_16_31) (<= .cse3 .cse9) (<= 3 .cse8) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_19_22_89_59_55) (or (and (= 4294967299 .cse1) (= (+ (* aux_div_v_main_~j~0_16_31 4294967296) aux_mod_v_main_~j~0_16_31) 3)) (let ((.cse11 (div (+ (* aux_div_v_main_~j~0_16_31 (- 4294967296)) 3 (* (- 1) aux_mod_v_main_~j~0_16_31)) (- 3)))) (and (< 0 .cse11) (= (mod (+ (* 2 aux_div_v_main_~j~0_16_31) (* 2 aux_mod_v_main_~j~0_16_31)) 3) 0) (forall ((v_it_2 Int)) (let ((.cse12 (+ v_it_2 1))) (or (not (<= 1 v_it_2)) (not (<= .cse12 (div (+ (* aux_div_v_main_~j~0_16_31 (- 4294967296)) 3 (* (- 1) aux_mod_v_main_~j~0_16_31)) (- 3)))) (let ((.cse13 (* v_it_2 3))) (and (< (mod .cse13 4294967296) (mod aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_113 4294967296)) (not (= (mod .cse12 2) 0)) (let ((.cse14 (mod (+ 3 .cse13) 4294967296))) (<= (mod (div .cse14 2) 4294967296) .cse14))))))) (= (+ 4294967299 (* 3 .cse11)) .cse1)))) (<= 0 .cse10))))) (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296))) is different from false [2022-03-20 13:21:51,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:21:51,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [681450360] [2022-03-20 13:21:51,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [681450360] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:21:51,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:21:51,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 13:21:51,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909315507] [2022-03-20 13:21:51,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:21:51,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 13:21:51,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:21:51,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 13:21:51,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=139, Unknown=17, NotChecked=108, Total=306 [2022-03-20 13:21:51,535 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 13:22:06,471 WARN L232 SmtUtils]: Spent 8.56s on a formula simplification. DAG size of input: 72 DAG size of output: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 13:22:08,581 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (<= c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) 20000001)) (exists ((v_main_~j~0_16 Int) (aux_div_v_main_~i~0_19_22 Int) (aux_div_aux_mod_v_main_~i~0_19_22_89 Int) (aux_mod_aux_mod_v_main_~i~0_19_22_89 Int)) (let ((.cse1 (* aux_div_aux_mod_v_main_~i~0_19_22_89 4294967296))) (let ((.cse3 (* 2 aux_div_v_main_~i~0_19_22)) (.cse2 (+ aux_mod_aux_mod_v_main_~i~0_19_22_89 .cse1))) (and (< aux_mod_aux_mod_v_main_~i~0_19_22_89 (mod c_main_~n~0 4294967296)) (let ((.cse0 (<= (mod (div (mod (+ 3 aux_mod_aux_mod_v_main_~i~0_19_22_89) 4294967296) 2) 4294967296) (mod v_main_~j~0_16 4294967296)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| 0)) (and .cse0 (= |c___VERIFIER_assert_#in~cond| 1)))) (not (= (+ (- 4294967293) (* (- 2) aux_div_v_main_~i~0_19_22) aux_mod_aux_mod_v_main_~i~0_19_22_89 .cse1) 0)) (< .cse2 (+ 4294967295 .cse3)) (let ((.cse8 (+ (- 4294967293) aux_mod_aux_mod_v_main_~i~0_19_22_89 .cse1))) (or (let ((.cse4 (div (+ (* v_main_~j~0_16 (- 1)) 3) (- 3)))) (and (< 0 .cse4) (forall ((v_it_2 Int)) (let ((.cse6 (+ v_it_2 1))) (or (not (<= 1 v_it_2)) (let ((.cse5 (* v_it_2 3))) (and (< (mod .cse5 4294967296) (mod c_main_~n~0 4294967296)) (not (= (mod .cse6 2) 0)) (let ((.cse7 (mod (+ 3 .cse5) 4294967296))) (<= (mod (div .cse7 2) 4294967296) .cse7)))) (not (<= .cse6 (div (+ (* v_main_~j~0_16 (- 1)) 3) (- 3))))))) (= (mod (* v_main_~j~0_16 2) 3) 0) (= .cse8 (+ (* 3 .cse4) 3)))) (and (= .cse8 3) (= (+ v_main_~j~0_16 (- 3)) 0)))) (<= (+ .cse3 4294967293) .cse2) (<= 0 aux_mod_aux_mod_v_main_~i~0_19_22_89) (< aux_mod_aux_mod_v_main_~i~0_19_22_89 4294967296)))))) is different from false [2022-03-20 13:22:16,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:22:19,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:22:21,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:22:23,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:22:29,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:22:31,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:22:33,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:22:36,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:22:38,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 13:22:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:22:38,323 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-03-20 13:22:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 13:22:38,324 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-03-20 13:22:38,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:22:38,325 INFO L225 Difference]: With dead ends: 39 [2022-03-20 13:22:38,325 INFO L226 Difference]: Without dead ends: 37 [2022-03-20 13:22:38,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 117.0s TimeCoverageRelationStatistics Valid=75, Invalid=299, Unknown=26, NotChecked=200, Total=600 [2022-03-20 13:22:38,326 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2022-03-20 13:22:38,326 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 77 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 9 Unknown, 156 Unchecked, 19.1s Time] [2022-03-20 13:22:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-20 13:22:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-03-20 13:22:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-20 13:22:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-03-20 13:22:38,339 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2022-03-20 13:22:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:22:38,342 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-03-20 13:22:38,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 13:22:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-03-20 13:22:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 13:22:38,343 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:22:38,343 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 13:22:38,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 13:22:38,343 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:22:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:22:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash 779354186, now seen corresponding path program 1 times [2022-03-20 13:22:38,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:22:38,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370534552] [2022-03-20 13:24:37,340 WARN L232 SmtUtils]: Spent 1.98m on a formula simplification. DAG size of input: 74 DAG size of output: 72 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-03-20 13:24:37,341 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-20 13:24:37,342 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 13:24:37,342 INFO L85 PathProgramCache]: Analyzing trace with hash -650728549, now seen corresponding path program 1 times [2022-03-20 13:24:37,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:24:37,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100762173] [2022-03-20 13:24:37,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:24:37,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:24:37,348 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= .v_it_3.0 (+ (* (- 1) main_~i~0_6) (* 2 (div (+ main_~i~0_6 .v_it_3.0 1) 2)) (- 1)))) [2022-03-20 13:24:37,349 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (let ((.cse1 (* 3 .v_it_3.0))) (let ((.cse0 (div (+ main_~i~0_6 .cse1 (* (- 4294967296) (div (+ main_~i~0_6 .cse1 3) 4294967296)) 3) 2))) (+ .cse0 (* (- 4294967296) (div .cse0 4294967296)) (* (- 1) main_~j~0_6) (* (- 3) .v_it_3.0) (* 4294967296 (div (+ main_~j~0_6 .cse1 3) 4294967296)) (- 3)))) 0) [2022-03-20 13:24:37,349 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~n~0_5 (* (- 4294967296) (div main_~n~0_5 4294967296)) (* (- 1) main_~i~0_6) (* (- 3) .v_it_3.0) (* 4294967296 (div (+ main_~i~0_6 (* 3 .v_it_3.0)) 4294967296))) 0)) [2022-03-20 13:24:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:24:37,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:24:37,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100762173] [2022-03-20 13:24:37,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Interpolation not supported for quantified formulae. [2022-03-20 13:24:37,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865887409] [2022-03-20 13:24:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:24:37,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:24:37,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:24:37,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 13:24:37,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process