/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 19:05:46,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 19:05:46,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 19:05:46,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 19:05:46,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 19:05:46,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 19:05:46,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 19:05:46,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 19:05:46,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 19:05:46,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 19:05:46,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 19:05:46,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 19:05:46,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 19:05:46,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 19:05:46,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 19:05:46,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 19:05:46,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 19:05:46,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 19:05:46,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 19:05:46,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 19:05:46,452 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 19:05:46,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 19:05:46,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 19:05:46,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 19:05:46,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 19:05:46,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 19:05:46,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 19:05:46,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 19:05:46,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 19:05:46,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 19:05:46,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 19:05:46,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 19:05:46,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 19:05:46,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 19:05:46,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 19:05:46,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 19:05:46,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 19:05:46,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 19:05:46,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 19:05:46,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 19:05:46,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 19:05:46,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 19:05:46,474 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-20 19:05:46,482 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 19:05:46,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 19:05:46,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 19:05:46,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 19:05:46,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 19:05:46,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 19:05:46,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 19:05:46,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 19:05:46,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 19:05:46,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 19:05:46,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 19:05:46,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 19:05:46,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 19:05:46,486 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 19:05:46,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 19:05:46,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 19:05:46,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 19:05:46,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 19:05:46,486 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 19:05:46,486 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 19:05:46,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 19:05:46,486 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-20 19:05:46,486 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 19:05:46,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 19:05:46,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 19:05:46,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 19:05:46,687 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 19:05:46,688 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 19:05:46,689 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-03-20 19:05:46,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f5c796f/c5489105bf854ab59be855569bd792c3/FLAG1e12e3c1e [2022-03-20 19:05:47,125 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 19:05:47,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-03-20 19:05:47,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f5c796f/c5489105bf854ab59be855569bd792c3/FLAG1e12e3c1e [2022-03-20 19:05:47,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f5c796f/c5489105bf854ab59be855569bd792c3 [2022-03-20 19:05:47,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 19:05:47,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 19:05:47,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 19:05:47,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 19:05:47,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 19:05:47,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 07:05:47" (1/1) ... [2022-03-20 19:05:47,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c405683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:05:47, skipping insertion in model container [2022-03-20 19:05:47,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 07:05:47" (1/1) ... [2022-03-20 19:05:47,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 19:05:47,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 19:05:47,289 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/sumt6.c[403,416] [2022-03-20 19:05:47,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 19:05:47,322 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 19:05:47,331 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/sumt6.c[403,416] [2022-03-20 19:05:47,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 19:05:47,358 INFO L208 MainTranslator]: Completed translation [2022-03-20 19:05:47,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:05:47 WrapperNode [2022-03-20 19:05:47,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 19:05:47,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 19:05:47,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 19:05:47,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 19:05:47,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:05:47" (1/1) ... [2022-03-20 19:05:47,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:05:47" (1/1) ... [2022-03-20 19:05:47,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:05:47" (1/1) ... [2022-03-20 19:05:47,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:05:47" (1/1) ... [2022-03-20 19:05:47,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:05:47" (1/1) ... [2022-03-20 19:05:47,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:05:47" (1/1) ... [2022-03-20 19:05:47,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:05:47" (1/1) ... [2022-03-20 19:05:47,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 19:05:47,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 19:05:47,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 19:05:47,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 19:05:47,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:05:47" (1/1) ... [2022-03-20 19:05:47,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 19:05:47,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 19:05:47,421 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 19:05:47,438 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 19:05:47,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 19:05:47,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 19:05:47,461 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 19:05:47,461 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 19:05:47,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 19:05:47,461 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 19:05:47,461 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 19:05:47,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 19:05:47,517 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 19:05:47,518 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 19:05:54,198 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 19:05:54,208 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 19:05:54,209 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 19:05:54,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:05:54 BoogieIcfgContainer [2022-03-20 19:05:54,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 19:05:54,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 19:05:54,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 19:05:54,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 19:05:54,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 07:05:47" (1/3) ... [2022-03-20 19:05:54,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba85f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 07:05:54, skipping insertion in model container [2022-03-20 19:05:54,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:05:47" (2/3) ... [2022-03-20 19:05:54,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba85f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 07:05:54, skipping insertion in model container [2022-03-20 19:05:54,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:05:54" (3/3) ... [2022-03-20 19:05:54,214 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.c [2022-03-20 19:05:54,225 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 19:05:54,225 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 19:05:54,277 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 19:05:54,282 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 19:05:54,282 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 19:05:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 19:05:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-20 19:05:54,297 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:05:54,298 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:05:54,298 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:05:54,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:05:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 1 times [2022-03-20 19:05:54,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:05:54,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1996140763] [2022-03-20 19:05:54,317 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:05:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 2 times [2022-03-20 19:05:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:05:54,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7949240] [2022-03-20 19:05:54,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:05:54,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:05:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:05:54,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:05:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:05:54,478 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 19:05:54,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:05:54,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7949240] [2022-03-20 19:05:54,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7949240] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:05:54,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:05:54,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 19:05:54,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:05:54,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1996140763] [2022-03-20 19:05:54,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1996140763] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:05:54,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:05:54,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 19:05:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945116204] [2022-03-20 19:05:54,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:05:54,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 19:05:54,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:05:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 19:05:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 19:05:54,506 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 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 19:05:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:05:54,543 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-03-20 19:05:54,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 19:05:54,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 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 12 [2022-03-20 19:05:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:05:54,550 INFO L225 Difference]: With dead ends: 38 [2022-03-20 19:05:54,550 INFO L226 Difference]: Without dead ends: 19 [2022-03-20 19:05:54,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 19:05:54,555 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 19:05:54,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 19:05:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-03-20 19:05:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-03-20 19:05:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-03-20 19:05:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-03-20 19:05:54,580 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-03-20 19:05:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:05:54,580 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-03-20 19:05:54,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 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 19:05:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-03-20 19:05:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-20 19:05:54,581 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:05:54,581 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:05:54,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 19:05:54,582 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:05:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:05:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 1 times [2022-03-20 19:05:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:05:54,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [947292533] [2022-03-20 19:05:54,583 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:05:54,583 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 2 times [2022-03-20 19:05:54,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:05:54,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721133693] [2022-03-20 19:05:54,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:05:54,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:05:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:05:54,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:05:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:05:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 19:05:54,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:05:54,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721133693] [2022-03-20 19:05:54,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721133693] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:05:54,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:05:54,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 19:05:54,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:05:54,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [947292533] [2022-03-20 19:05:54,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [947292533] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:05:54,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:05:54,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 19:05:54,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290487921] [2022-03-20 19:05:54,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:05:54,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 19:05:54,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:05:54,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 19:05:54,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 19:05:54,871 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 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 19:05:56,921 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 19:05:59,108 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 19:06:01,316 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 19:06:03,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 19:06:05,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 19:06:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:06:05,823 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-03-20 19:06:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 19:06:05,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 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 12 [2022-03-20 19:06:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:06:05,825 INFO L225 Difference]: With dead ends: 26 [2022-03-20 19:06:05,825 INFO L226 Difference]: Without dead ends: 21 [2022-03-20 19:06:05,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-20 19:06:05,827 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-03-20 19:06:05,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2022-03-20 19:06:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-03-20 19:06:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-03-20 19:06:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 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-03-20 19:06:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-03-20 19:06:05,832 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-03-20 19:06:05,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:06:05,832 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-03-20 19:06:05,832 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 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 19:06:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-03-20 19:06:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-20 19:06:05,832 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:06:05,833 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:06:05,833 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 19:06:05,833 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:06:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:06:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1279795021, now seen corresponding path program 1 times [2022-03-20 19:06:05,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:06:05,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1992723808] [2022-03-20 19:06:06,196 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 19:06:06,198 INFO L85 PathProgramCache]: Analyzing trace with hash -748417914, now seen corresponding path program 1 times [2022-03-20 19:06:06,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:06:06,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605700828] [2022-03-20 19:06:06,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:06:06,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:06:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:06:06,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:06:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:06:06,518 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 19:06:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:06:06,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605700828] [2022-03-20 19:06:06,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605700828] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:06:06,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:06:06,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-20 19:06:23,564 WARN L232 SmtUtils]: Spent 17.03s on a formula simplification. DAG size of input: 36 DAG size of output: 17 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.MetaTraceTransformer.getInductiveLoopInterpolants) [2022-03-20 19:06:34,207 WARN L232 SmtUtils]: Spent 10.60s on a formula simplification. DAG size of input: 27 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 19:06:34,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:06:34,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1992723808] [2022-03-20 19:06:34,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1992723808] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:06:34,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:06:34,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 19:06:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323048870] [2022-03-20 19:06:34,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:06:34,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 19:06:34,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:06:34,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 19:06:34,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-20 19:06:34,237 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 19:06:36,324 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 19:06:38,523 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 19:06:40,768 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 19:06:42,970 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 19:06:45,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 19:06:47,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 19:06:49,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 19:06:51,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 19:06:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:06:51,835 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-03-20 19:06:51,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 19:06:51,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-03-20 19:06:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:06:51,836 INFO L225 Difference]: With dead ends: 39 [2022-03-20 19:06:51,836 INFO L226 Difference]: Without dead ends: 24 [2022-03-20 19:06:51,837 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-03-20 19:06:51,838 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-03-20 19:06:51,838 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 17.5s Time] [2022-03-20 19:06:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-03-20 19:06:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-03-20 19:06:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 19:06:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-03-20 19:06:51,842 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2022-03-20 19:06:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:06:51,847 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-03-20 19:06:51,848 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 19:06:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-03-20 19:06:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 19:06:51,848 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:06:51,848 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:06:51,848 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 19:06:51,848 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:06:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:06:51,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1309439716, now seen corresponding path program 1 times [2022-03-20 19:06:51,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:06:51,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676335600] [2022-03-20 19:06:52,082 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 19:06:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash -689312570, now seen corresponding path program 1 times [2022-03-20 19:06:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:06:52,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156622387] [2022-03-20 19:06:52,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:06:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:06:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:06:52,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:06:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:06:52,771 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 19:06:52,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:06:52,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156622387] [2022-03-20 19:06:52,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156622387] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:06:52,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:06:52,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 19:07:01,506 WARN L232 SmtUtils]: Spent 8.73s on a formula simplification. DAG size of input: 46 DAG size of output: 24 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.MetaTraceTransformer.getInductiveLoopInterpolants) [2022-03-20 19:07:03,740 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (< 0 (+ c_main_~n~0 1)) (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (<= (div c_main_~n~0 4294967296) 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-03-20 19:07:05,921 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (< 0 (+ c_main_~n~0 1)) (= (mod (mod .cse0 5) 4294967296) 0) (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (<= (div c_main_~n~0 4294967296) 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= (+ c_main_~v3~0 (- 1)) 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-03-20 19:07:08,100 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 4294967295 c_main_~l~0) 4294967296))) (and (< 0 (+ c_main_~n~0 1)) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (<= (div c_main_~n~0 4294967296) 0) (= (+ (- 1) c_main_~l~0) 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= (mod (mod .cse0 5) 4294967296) 0) (= (+ c_main_~v3~0 (- 1)) 0) (= c_main_~j~0 0) (= c_main_~k~0 0))) is different from false [2022-03-20 19:07:08,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:07:08,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676335600] [2022-03-20 19:07:08,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676335600] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:07:08,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:07:08,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 19:07:08,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121051768] [2022-03-20 19:07:08,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:07:08,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 19:07:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:07:08,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 19:07:08,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=105, Unknown=3, NotChecked=66, Total=210 [2022-03-20 19:07:08,107 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 14 states, 12 states have (on average 1.0) internal successors, (12), 10 states have internal predecessors, (12), 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-03-20 19:07:10,314 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 19:07:12,526 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 19:07:14,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 19:07:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:07:14,952 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-03-20 19:07:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 19:07:14,953 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.0) internal successors, (12), 10 states have internal predecessors, (12), 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) Word has length 16 [2022-03-20 19:07:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:07:14,953 INFO L225 Difference]: With dead ends: 34 [2022-03-20 19:07:14,954 INFO L226 Difference]: Without dead ends: 29 [2022-03-20 19:07:14,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=84, Invalid=231, Unknown=3, NotChecked=102, Total=420 [2022-03-20 19:07:14,955 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-03-20 19:07:14,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 68 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 86 Invalid, 3 Unknown, 71 Unchecked, 6.6s Time] [2022-03-20 19:07:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-03-20 19:07:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-03-20 19:07:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 19:07:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-03-20 19:07:14,960 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 16 [2022-03-20 19:07:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:07:14,960 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-03-20 19:07:14,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.0) internal successors, (12), 10 states have internal predecessors, (12), 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-03-20 19:07:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-03-20 19:07:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 19:07:14,960 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:07:14,961 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:07:14,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 19:07:14,961 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:07:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:07:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1923990926, now seen corresponding path program 1 times [2022-03-20 19:07:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:07:14,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [818474186] [2022-03-20 19:07:15,160 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 19:07:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash -630207226, now seen corresponding path program 1 times [2022-03-20 19:07:15,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:07:15,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521174525] [2022-03-20 19:07:15,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:07:15,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:07:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:07:15,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:07:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:07:15,965 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 19:07:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:07:15,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521174525] [2022-03-20 19:07:15,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521174525] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:07:15,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:07:15,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 19:07:22,601 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_main_~n~0 4294967296)) (.cse1 (mod c_main_~l~0 4294967296))) (and (= c_main_~i~0 0) (< 0 (+ .cse0 1)) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (<= c_main_~n~0 (+ (* .cse0 4294967296) 20000001)) (<= .cse0 0) (< .cse1 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse1 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-03-20 19:07:24,787 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (div c_main_~n~0 4294967296)) (.cse0 (mod c_main_~l~0 4294967296))) (and (not (= (mod (mod .cse0 5) 4294967296) 0)) (= c_main_~i~0 0) (< 0 (+ .cse1 1)) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (<= c_main_~n~0 (+ (* .cse1 4294967296) 20000001)) (<= .cse1 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-03-20 19:07:26,970 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (div c_main_~n~0 4294967296)) (.cse0 (mod c_main_~l~0 4294967296))) (and (not (= (mod (mod .cse0 5) 4294967296) 0)) (= c_main_~i~0 0) (< 0 (+ .cse1 1)) (= c_main_~v2~0 0) (<= c_main_~n~0 (+ (* .cse1 4294967296) 20000001)) (<= .cse1 0) (= (mod c_main_~l~0 4) 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~v4~0 1) (= c_main_~k~0 0))) is different from false [2022-03-20 19:07:26,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:07:26,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [818474186] [2022-03-20 19:07:26,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [818474186] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:07:26,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:07:26,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 19:07:26,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133843947] [2022-03-20 19:07:26,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:07:26,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 19:07:26,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:07:26,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 19:07:26,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=105, Unknown=3, NotChecked=66, Total=210 [2022-03-20 19:07:26,986 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 14 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 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-03-20 19:07:29,286 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 19:07:31,488 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 19:07:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:07:31,736 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2022-03-20 19:07:31,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 19:07:31,736 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 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) Word has length 17 [2022-03-20 19:07:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:07:31,737 INFO L225 Difference]: With dead ends: 42 [2022-03-20 19:07:31,737 INFO L226 Difference]: Without dead ends: 29 [2022-03-20 19:07:31,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=74, Invalid=175, Unknown=3, NotChecked=90, Total=342 [2022-03-20 19:07:31,738 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-20 19:07:31,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 54 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 77 Invalid, 2 Unknown, 55 Unchecked, 4.5s Time] [2022-03-20 19:07:31,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-03-20 19:07:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-03-20 19:07:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 19:07:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-03-20 19:07:31,743 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2022-03-20 19:07:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:07:31,743 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-03-20 19:07:31,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 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-03-20 19:07:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-03-20 19:07:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 19:07:31,743 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:07:31,743 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:07:31,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 19:07:31,744 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:07:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:07:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1061425385, now seen corresponding path program 1 times [2022-03-20 19:07:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:07:31,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675650606] [2022-03-20 19:07:31,902 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 19:07:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -571101882, now seen corresponding path program 1 times [2022-03-20 19:07:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:07:31,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920705448] [2022-03-20 19:07:31,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:07:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:07:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:07:32,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:07:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:07:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 19:07:32,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:07:32,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920705448] [2022-03-20 19:07:32,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920705448] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:07:32,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:07:32,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 19:07:47,192 WARN L232 SmtUtils]: Spent 15.16s on a formula simplification. DAG size of input: 51 DAG size of output: 17 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.MetaTraceTransformer.getInductiveLoopInterpolants) [2022-03-20 19:07:49,393 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-03-20 19:07:51,694 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (not (= (mod (mod .cse0 5) 4294967296) 0)) (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-03-20 19:07:51,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:07:51,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675650606] [2022-03-20 19:07:51,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675650606] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:07:51,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:07:51,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 19:07:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879882085] [2022-03-20 19:07:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:07:51,707 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 19:07:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:07:51,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 19:07:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=32, Unknown=2, NotChecked=22, Total=72 [2022-03-20 19:07:51,708 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) 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-03-20 19:07:53,781 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 19:07:55,976 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 19:07:58,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 19:07:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:07:58,359 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-03-20 19:07:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 19:07:58,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) 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-03-20 19:07:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:07:58,360 INFO L225 Difference]: With dead ends: 41 [2022-03-20 19:07:58,360 INFO L226 Difference]: Without dead ends: 28 [2022-03-20 19:07:58,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-03-20 19:07:58,361 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-03-20 19:07:58,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 52 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 3 Unknown, 42 Unchecked, 6.6s Time] [2022-03-20 19:07:58,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-20 19:07:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-03-20 19:07:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 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-03-20 19:07:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-03-20 19:07:58,365 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2022-03-20 19:07:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:07:58,365 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-03-20 19:07:58,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) 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-03-20 19:07:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-03-20 19:07:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 19:07:58,366 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:07:58,366 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:07:58,366 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 19:07:58,366 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:07:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:07:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash 57783349, now seen corresponding path program 1 times [2022-03-20 19:07:58,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:07:58,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1700008514] [2022-03-20 19:09:33,126 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:428) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.pushout(QvasrAbstractionJoin.java:181) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.join(QvasrAbstractionJoin.java:116) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:130) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-20 19:09:33,132 INFO L158 Benchmark]: Toolchain (without parser) took 225988.26ms. Allocated memory was 235.9MB in the beginning and 324.0MB in the end (delta: 88.1MB). Free memory was 209.3MB in the beginning and 152.6MB in the end (delta: 56.7MB). Peak memory consumption was 144.5MB. Max. memory is 8.0GB. [2022-03-20 19:09:33,132 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 235.9MB. Free memory is still 196.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 19:09:33,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.98ms. Allocated memory is still 235.9MB. Free memory was 209.1MB in the beginning and 207.9MB in the end (delta: 1.1MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-03-20 19:09:33,133 INFO L158 Benchmark]: Boogie Preprocessor took 21.54ms. Allocated memory is still 235.9MB. Free memory was 207.9MB in the beginning and 206.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 19:09:33,133 INFO L158 Benchmark]: RCFGBuilder took 6828.35ms. Allocated memory is still 235.9MB. Free memory was 206.5MB in the beginning and 195.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-20 19:09:33,134 INFO L158 Benchmark]: TraceAbstraction took 218920.74ms. Allocated memory was 235.9MB in the beginning and 324.0MB in the end (delta: 88.1MB). Free memory was 194.6MB in the beginning and 152.6MB in the end (delta: 42.0MB). Peak memory consumption was 131.3MB. Max. memory is 8.0GB. [2022-03-20 19:09:33,135 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 235.9MB. Free memory is still 196.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.98ms. Allocated memory is still 235.9MB. Free memory was 209.1MB in the beginning and 207.9MB in the end (delta: 1.1MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.54ms. Allocated memory is still 235.9MB. Free memory was 207.9MB in the beginning and 206.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 6828.35ms. Allocated memory is still 235.9MB. Free memory was 206.5MB in the beginning and 195.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 218920.74ms. Allocated memory was 235.9MB in the beginning and 324.0MB in the end (delta: 88.1MB). Free memory was 194.6MB in the beginning and 152.6MB in the end (delta: 42.0MB). Peak memory consumption was 131.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:428) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-20 19:09:33,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...