/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/array-fpi/ms4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:24:34,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:24:34,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:24:34,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:24:34,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:24:34,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:24:34,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:24:34,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:24:34,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:24:34,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:24:34,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:24:34,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:24:34,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:24:34,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:24:34,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:24:34,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:24:34,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:24:34,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:24:34,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:24:34,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:24:34,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:24:34,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:24:34,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:24:34,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:24:34,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:24:34,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:24:34,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:24:34,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:24:34,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:24:34,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:24:34,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:24:34,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:24:34,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:24:34,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:24:34,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:24:34,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:24:34,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:24:34,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:24:34,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:24:34,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:24:34,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:24:34,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:24:34,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:24:34,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:24:34,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:24:34,419 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:24:34,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:24:34,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:24:34,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:24:34,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:24:34,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:24:34,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:24:34,420 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:24:34,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:24:34,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:24:34,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:24:34,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:24:34,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:24:34,421 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:24:34,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:24:34,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:24:34,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:24:34,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:24:34,422 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:24:34,422 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 11:24:34,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:24:34,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:24:34,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:24:34,629 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:24:34,629 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:24:34,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ms4.c [2022-01-31 11:24:34,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15130a7a4/ecf39e7e0dd3461b9d5aafdab4f4a3b1/FLAG7f51a4fc9 [2022-01-31 11:24:35,081 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:24:35,081 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms4.c [2022-01-31 11:24:35,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15130a7a4/ecf39e7e0dd3461b9d5aafdab4f4a3b1/FLAG7f51a4fc9 [2022-01-31 11:24:35,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15130a7a4/ecf39e7e0dd3461b9d5aafdab4f4a3b1 [2022-01-31 11:24:35,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:24:35,111 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:24:35,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:24:35,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:24:35,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:24:35,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:24:35" (1/1) ... [2022-01-31 11:24:35,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157dc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:24:35, skipping insertion in model container [2022-01-31 11:24:35,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:24:35" (1/1) ... [2022-01-31 11:24:35,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:24:35,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:24:35,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms4.c[586,599] [2022-01-31 11:24:35,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:24:35,353 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:24:35,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms4.c[586,599] [2022-01-31 11:24:35,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:24:35,381 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:24:35,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:24:35 WrapperNode [2022-01-31 11:24:35,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:24:35,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:24:35,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:24:35,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:24:35,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:24:35" (1/1) ... [2022-01-31 11:24:35,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:24:35" (1/1) ... [2022-01-31 11:24:35,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:24:35" (1/1) ... [2022-01-31 11:24:35,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:24:35" (1/1) ... [2022-01-31 11:24:35,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:24:35" (1/1) ... [2022-01-31 11:24:35,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:24:35" (1/1) ... [2022-01-31 11:24:35,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:24:35" (1/1) ... [2022-01-31 11:24:35,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:24:35,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:24:35,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:24:35,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:24:35,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:24:35" (1/1) ... [2022-01-31 11:24:35,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:24:35,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:24:35,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 11:24:35,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 11:24:35,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:24:35,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:24:35,503 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:24:35,503 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:24:35,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:24:35,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:24:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:24:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:24:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:24:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:24:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:24:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:24:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:24:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:24:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:24:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:24:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:24:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:24:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:24:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:24:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:24:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:24:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:24:35,562 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:24:35,563 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:24:35,670 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:24:35,675 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:24:35,675 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 11:24:35,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:24:35 BoogieIcfgContainer [2022-01-31 11:24:35,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:24:35,678 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:24:35,678 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:24:35,685 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:24:35,688 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:24:35" (1/1) ... [2022-01-31 11:24:35,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:24:35 BasicIcfg [2022-01-31 11:24:35,710 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:24:35,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:24:35,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:24:35,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:24:35,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:24:35" (1/4) ... [2022-01-31 11:24:35,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b20f815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:24:35, skipping insertion in model container [2022-01-31 11:24:35,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:24:35" (2/4) ... [2022-01-31 11:24:35,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b20f815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:24:35, skipping insertion in model container [2022-01-31 11:24:35,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:24:35" (3/4) ... [2022-01-31 11:24:35,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b20f815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:24:35, skipping insertion in model container [2022-01-31 11:24:35,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:24:35" (4/4) ... [2022-01-31 11:24:35,716 INFO L111 eAbstractionObserver]: Analyzing ICFG ms4.cJordan [2022-01-31 11:24:35,720 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:24:35,720 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:24:35,753 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:24:35,760 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 11:24:35,760 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:24:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:24:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 11:24:35,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:24:35,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:24:35,782 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:24:35,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:24:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash -219332792, now seen corresponding path program 1 times [2022-01-31 11:24:35,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:24:35,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628876339] [2022-01-31 11:24:35,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:24:35,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:24:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:36,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:24:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:36,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:24:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:36,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:24:36,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628876339] [2022-01-31 11:24:36,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628876339] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:24:36,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:24:36,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:24:36,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031435475] [2022-01-31 11:24:36,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:24:36,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:24:36,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:24:36,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:24:36,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:24:36,152 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:24:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:24:36,224 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-01-31 11:24:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:24:36,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-01-31 11:24:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:24:36,232 INFO L225 Difference]: With dead ends: 32 [2022-01-31 11:24:36,232 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 11:24:36,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:24:36,243 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:24:36,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:24:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 11:24:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 11:24:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:24:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-01-31 11:24:36,274 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-01-31 11:24:36,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:24:36,276 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-01-31 11:24:36,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:24:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-01-31 11:24:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 11:24:36,277 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:24:36,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:24:36,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:24:36,278 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:24:36,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:24:36,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1681189413, now seen corresponding path program 1 times [2022-01-31 11:24:36,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:24:36,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382914899] [2022-01-31 11:24:36,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:24:36,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:24:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:36,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:24:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:36,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:24:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:36,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:24:36,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382914899] [2022-01-31 11:24:36,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382914899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:24:36,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:24:36,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:24:36,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138222394] [2022-01-31 11:24:36,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:24:36,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:24:36,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:24:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:24:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:24:36,449 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:24:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:24:36,536 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-01-31 11:24:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:24:36,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-01-31 11:24:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:24:36,538 INFO L225 Difference]: With dead ends: 30 [2022-01-31 11:24:36,539 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 11:24:36,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 11:24:36,549 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:24:36,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:24:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 11:24:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-01-31 11:24:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:24:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-01-31 11:24:36,561 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2022-01-31 11:24:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:24:36,561 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-01-31 11:24:36,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:24:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-01-31 11:24:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 11:24:36,563 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:24:36,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:24:36,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:24:36,564 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:24:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:24:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash 982061835, now seen corresponding path program 1 times [2022-01-31 11:24:36,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:24:36,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518614739] [2022-01-31 11:24:36,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:24:36,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:24:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:24:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:36,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:24:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:24:36,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:24:36,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518614739] [2022-01-31 11:24:36,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518614739] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:24:36,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:24:36,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 11:24:36,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166436959] [2022-01-31 11:24:36,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:24:36,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 11:24:36,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:24:36,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 11:24:36,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 11:24:36,775 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:24:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:24:36,898 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-01-31 11:24:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 11:24:36,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-01-31 11:24:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:24:36,900 INFO L225 Difference]: With dead ends: 35 [2022-01-31 11:24:36,900 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 11:24:36,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:24:36,907 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:24:36,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 62 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:24:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 11:24:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-31 11:24:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:24:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-01-31 11:24:36,917 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2022-01-31 11:24:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:24:36,918 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-01-31 11:24:36,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:24:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-01-31 11:24:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 11:24:36,919 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:24:36,920 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:24:36,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 11:24:36,920 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:24:36,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:24:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1617004712, now seen corresponding path program 1 times [2022-01-31 11:24:36,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:24:36,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421541268] [2022-01-31 11:24:36,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:24:36,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:24:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:37,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:24:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:24:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:37,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:24:37,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421541268] [2022-01-31 11:24:37,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421541268] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:24:37,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001513653] [2022-01-31 11:24:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:24:37,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:24:37,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:24:37,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:24:37,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 11:24:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:37,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:24:37,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:24:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:37,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:24:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:37,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001513653] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:24:37,364 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:24:37,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:24:37,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237977896] [2022-01-31 11:24:37,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:24:37,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:24:37,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:24:37,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:24:37,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:24:37,366 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:24:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:24:37,469 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-01-31 11:24:37,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:24:37,469 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-01-31 11:24:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:24:37,470 INFO L225 Difference]: With dead ends: 40 [2022-01-31 11:24:37,470 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 11:24:37,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:24:37,471 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:24:37,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:24:37,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 11:24:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-01-31 11:24:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:24:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-01-31 11:24:37,475 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2022-01-31 11:24:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:24:37,475 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-01-31 11:24:37,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:24:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-01-31 11:24:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:24:37,476 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:24:37,476 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:24:37,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 11:24:37,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:24:37,678 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:24:37,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:24:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash 66776460, now seen corresponding path program 2 times [2022-01-31 11:24:37,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:24:37,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686854190] [2022-01-31 11:24:37,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:24:37,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:24:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:38,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:24:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:38,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:24:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:38,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:24:38,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686854190] [2022-01-31 11:24:38,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686854190] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:24:38,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884239143] [2022-01-31 11:24:38,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:24:38,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:24:38,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:24:38,152 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:24:38,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 11:24:38,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:24:38,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:24:38,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 11:24:38,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:24:38,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 11:24:39,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:39,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-01-31 11:24:39,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:39,545 INFO L353 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-01-31 11:24:39,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 44 [2022-01-31 11:24:39,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:39,947 INFO L353 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2022-01-31 11:24:39,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2022-01-31 11:24:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:40,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:24:40,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 106 [2022-01-31 11:24:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:40,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884239143] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:24:40,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:24:40,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 41 [2022-01-31 11:24:40,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800153321] [2022-01-31 11:24:40,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:24:40,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-31 11:24:40,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:24:40,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-31 11:24:40,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 11:24:40,828 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 41 states, 38 states have (on average 1.631578947368421) internal successors, (62), 38 states have internal predecessors, (62), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:24:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:24:41,597 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-01-31 11:24:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 11:24:41,599 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 1.631578947368421) internal successors, (62), 38 states have internal predecessors, (62), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-01-31 11:24:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:24:41,600 INFO L225 Difference]: With dead ends: 50 [2022-01-31 11:24:41,600 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 11:24:41,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=403, Invalid=2459, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 11:24:41,602 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:24:41,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 104 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 238 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2022-01-31 11:24:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 11:24:41,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2022-01-31 11:24:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:24:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-31 11:24:41,607 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2022-01-31 11:24:41,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:24:41,607 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-31 11:24:41,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 1.631578947368421) internal successors, (62), 38 states have internal predecessors, (62), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:24:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-31 11:24:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 11:24:41,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:24:41,609 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:24:41,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 11:24:41,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:24:41,840 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:24:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:24:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash 651078000, now seen corresponding path program 3 times [2022-01-31 11:24:41,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:24:41,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850255858] [2022-01-31 11:24:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:24:41,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:24:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:41,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:24:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:41,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:24:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:41,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:24:41,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850255858] [2022-01-31 11:24:41,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850255858] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:24:41,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712346680] [2022-01-31 11:24:41,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:24:41,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:24:41,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:24:41,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:24:41,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 11:24:42,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:24:42,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:24:42,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-31 11:24:42,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:24:42,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 11:24:42,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:42,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-01-31 11:24:42,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:42,889 INFO L353 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-01-31 11:24:42,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 44 [2022-01-31 11:24:43,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:43,423 INFO L353 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2022-01-31 11:24:43,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2022-01-31 11:24:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:24:43,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:24:44,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 238 [2022-01-31 11:24:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:24:44,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712346680] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:24:44,193 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:24:44,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 15] total 36 [2022-01-31 11:24:44,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553333038] [2022-01-31 11:24:44,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:24:44,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 11:24:44,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:24:44,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 11:24:44,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 11:24:44,195 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 36 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:24:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:24:49,694 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-01-31 11:24:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 11:24:49,694 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-01-31 11:24:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:24:49,696 INFO L225 Difference]: With dead ends: 56 [2022-01-31 11:24:49,697 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 11:24:49,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=404, Invalid=2458, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 11:24:49,698 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:24:49,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 104 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 195 Invalid, 0 Unknown, 207 Unchecked, 0.1s Time] [2022-01-31 11:24:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 11:24:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2022-01-31 11:24:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:24:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-01-31 11:24:49,703 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 33 [2022-01-31 11:24:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:24:49,703 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-01-31 11:24:49,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:24:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-01-31 11:24:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 11:24:49,704 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:24:49,704 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:24:49,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 11:24:49,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:24:49,905 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:24:49,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:24:49,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1197206905, now seen corresponding path program 4 times [2022-01-31 11:24:49,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:24:49,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980562243] [2022-01-31 11:24:49,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:24:49,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:24:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:24:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:24:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:49,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:24:49,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980562243] [2022-01-31 11:24:49,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980562243] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:24:49,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411458173] [2022-01-31 11:24:49,999 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:24:50,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:24:50,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:24:50,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:24:50,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 11:24:50,048 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:24:50,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:24:50,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:24:50,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:24:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:50,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:24:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:50,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411458173] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:24:50,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:24:50,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:24:50,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061551760] [2022-01-31 11:24:50,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:24:50,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:24:50,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:24:50,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:24:50,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:24:50,249 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:24:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:24:50,395 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-01-31 11:24:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:24:50,396 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-01-31 11:24:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:24:50,397 INFO L225 Difference]: With dead ends: 59 [2022-01-31 11:24:50,397 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 11:24:50,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:24:50,398 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:24:50,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 61 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:24:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 11:24:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2022-01-31 11:24:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:24:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-01-31 11:24:50,402 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2022-01-31 11:24:50,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:24:50,402 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-01-31 11:24:50,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:24:50,402 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-01-31 11:24:50,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 11:24:50,403 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:24:50,403 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:24:50,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 11:24:50,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:24:50,619 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:24:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:24:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1772479453, now seen corresponding path program 5 times [2022-01-31 11:24:50,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:24:50,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348540419] [2022-01-31 11:24:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:24:50,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:24:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:51,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:24:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:51,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:24:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:24:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:51,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:24:51,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348540419] [2022-01-31 11:24:51,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348540419] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:24:51,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170469904] [2022-01-31 11:24:51,190 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:24:51,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:24:51,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:24:51,196 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:24:51,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 11:24:51,265 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:24:51,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:24:51,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 11:24:51,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:24:51,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:24:51,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 11:24:51,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:51,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2022-01-31 11:24:51,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:51,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2022-01-31 11:24:52,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:52,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:24:52,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2022-01-31 11:24:52,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:52,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:52,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:24:52,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 62 [2022-01-31 11:24:53,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:24:53,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 21 [2022-01-31 11:24:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:24:53,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:24:55,309 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_179 Int) (v_ArrVal_182 Int)) (let ((.cse0 (select |c_#memory_int| |c_main_~#sum~0.base|))) (or (<= (+ v_ArrVal_182 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse0 |main_~#sum~0.offset| v_ArrVal_182)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))) (* c_~N~0 3)) (not (<= v_ArrVal_179 0)) (not (<= v_ArrVal_182 (+ v_ArrVal_179 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse0 |main_~#sum~0.offset| v_ArrVal_179)) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))))))) is different from false [2022-01-31 11:24:57,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_179 Int) (v_ArrVal_177 Int) (v_ArrVal_182 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_177)))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_182 (+ v_ArrVal_179 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_179)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (not (<= v_ArrVal_179 0)) (<= (+ v_ArrVal_182 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_182)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))) (* 3 ~N~0)) (let ((.cse2 (mod c_main_~i~0 4))) (and (or (not (<= v_ArrVal_177 .cse2)) (and (not (= 0 .cse2)) (< c_main_~i~0 0))) (< .cse2 (+ v_ArrVal_177 4)))))))) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:25:00,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_179 Int) (v_ArrVal_177 Int) (~N~0 Int) (v_ArrVal_182 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) v_ArrVal_177)))) (let ((.cse2 (+ c_main_~i~0 1)) (.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_182 (+ v_ArrVal_179 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_179)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (not (<= v_ArrVal_179 0)) (not (< .cse2 ~N~0)) (let ((.cse3 (mod .cse2 4))) (and (< .cse3 (+ v_ArrVal_177 4)) (or (and (not (= .cse3 0)) (< .cse2 0)) (not (<= v_ArrVal_177 .cse3))))) (<= (+ v_ArrVal_182 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_182)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))) (* 3 ~N~0)))))) is different from false [2022-01-31 11:25:00,283 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:25:00,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2072 treesize of output 2018 [2022-01-31 11:25:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-01-31 11:25:00,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170469904] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:25:00,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:25:00,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 40 [2022-01-31 11:25:00,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779357606] [2022-01-31 11:25:00,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:25:00,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-31 11:25:00,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:25:00,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-31 11:25:00,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1172, Unknown=3, NotChecked=216, Total=1560 [2022-01-31 11:25:00,916 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 40 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 37 states have internal predecessors, (69), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:25:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:25:03,874 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-01-31 11:25:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 11:25:03,874 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 37 states have internal predecessors, (69), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-01-31 11:25:03,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:25:03,875 INFO L225 Difference]: With dead ends: 65 [2022-01-31 11:25:03,875 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 11:25:03,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=253, Invalid=1736, Unknown=3, NotChecked=264, Total=2256 [2022-01-31 11:25:03,877 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:25:03,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 162 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2022-01-31 11:25:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 11:25:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-01-31 11:25:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:25:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-01-31 11:25:03,881 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 36 [2022-01-31 11:25:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:25:03,881 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-01-31 11:25:03,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 37 states have internal predecessors, (69), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:25:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-01-31 11:25:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 11:25:03,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:25:03,882 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:25:03,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 11:25:04,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:25:04,083 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:25:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:25:04,084 INFO L85 PathProgramCache]: Analyzing trace with hash -558616897, now seen corresponding path program 6 times [2022-01-31 11:25:04,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:25:04,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524637573] [2022-01-31 11:25:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:25:04,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:25:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:04,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:25:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:04,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:25:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:25:04,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:25:04,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524637573] [2022-01-31 11:25:04,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524637573] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:25:04,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106053271] [2022-01-31 11:25:04,187 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:25:04,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:25:04,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:25:04,192 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:25:04,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 11:25:04,260 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 11:25:04,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:25:04,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:25:04,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:25:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:25:04,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:25:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:25:04,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106053271] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:25:04,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:25:04,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:25:04,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918914850] [2022-01-31 11:25:04,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:25:04,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:25:04,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:25:04,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:25:04,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:25:04,494 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:25:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:25:04,719 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-01-31 11:25:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:25:04,720 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-01-31 11:25:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:25:04,721 INFO L225 Difference]: With dead ends: 55 [2022-01-31 11:25:04,721 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 11:25:04,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:25:04,722 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 50 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:25:04,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 55 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:25:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 11:25:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-01-31 11:25:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:25:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-01-31 11:25:04,726 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2022-01-31 11:25:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:25:04,726 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-01-31 11:25:04,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:25:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-01-31 11:25:04,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:25:04,727 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:25:04,727 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:25:04,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 11:25:04,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:25:04,951 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:25:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:25:04,951 INFO L85 PathProgramCache]: Analyzing trace with hash 722651280, now seen corresponding path program 7 times [2022-01-31 11:25:04,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:25:04,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662489017] [2022-01-31 11:25:04,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:25:04,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:25:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:05,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:25:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:25:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:25:05,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:25:05,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662489017] [2022-01-31 11:25:05,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662489017] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:25:05,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304237040] [2022-01-31 11:25:05,054 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:25:05,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:25:05,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:25:05,056 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:25:05,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 11:25:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:05,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:25:05,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:25:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:25:05,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:25:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:25:05,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304237040] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:25:05,364 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:25:05,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:25:05,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558931723] [2022-01-31 11:25:05,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:25:05,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:25:05,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:25:05,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:25:05,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:25:05,365 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:25:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:25:05,511 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-01-31 11:25:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:25:05,511 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 11:25:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:25:05,512 INFO L225 Difference]: With dead ends: 56 [2022-01-31 11:25:05,512 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 11:25:05,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 11:25:05,514 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:25:05,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 62 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:25:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 11:25:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-01-31 11:25:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:25:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-01-31 11:25:05,517 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2022-01-31 11:25:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:25:05,517 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-01-31 11:25:05,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:25:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-01-31 11:25:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 11:25:05,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:25:05,518 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:25:05,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 11:25:05,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:25:05,723 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:25:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:25:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash -722575244, now seen corresponding path program 8 times [2022-01-31 11:25:05,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:25:05,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788369537] [2022-01-31 11:25:05,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:25:05,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:25:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:25:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:06,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:25:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:25:06,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:25:06,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788369537] [2022-01-31 11:25:06,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788369537] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:25:06,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364793409] [2022-01-31 11:25:06,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:25:06,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:25:06,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:25:06,484 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:25:06,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 11:25:06,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:25:06,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:25:06,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-31 11:25:06,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:25:06,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:25:06,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 11:25:06,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:06,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2022-01-31 11:25:06,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:06,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:06,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:06,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2022-01-31 11:25:08,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:08,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:08,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:08,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 73 [2022-01-31 11:25:09,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:09,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:09,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:09,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:09,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:09,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:25:09,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 81 [2022-01-31 11:25:10,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:25:10,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:10,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:10,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:10,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 81 [2022-01-31 11:25:12,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:12,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:12,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:12,291 INFO L353 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-01-31 11:25:12,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 89 [2022-01-31 11:25:16,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:16,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:16,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:25:16,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:25:16,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 25 [2022-01-31 11:25:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:25:17,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:25:23,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_312 Int) (v_main_~i~0_100 Int) (v_ArrVal_310 Int) (v_ArrVal_314 Int)) (let ((.cse0 (select |c_#memory_int| |c_main_~#sum~0.base|)) (.cse1 (* c_main_~i~0 4))) (or (not (< v_main_~i~0_100 c_~N~0)) (not (<= v_ArrVal_314 (+ v_ArrVal_312 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse0 |main_~#sum~0.offset| v_ArrVal_312)) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset 8))))) (<= (+ v_ArrVal_314 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse0 |main_~#sum~0.offset| v_ArrVal_314)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_100)))) (* c_~N~0 3)) (< (+ v_main_~i~0_100 1) c_~N~0) (not (<= v_ArrVal_312 (+ v_ArrVal_310 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse0 |main_~#sum~0.offset| v_ArrVal_310)) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset 4))))) (not (<= v_ArrVal_310 0))))) is different from false [2022-01-31 11:25:39,020 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_312 Int) (v_main_~i~0_100 Int) (v_ArrVal_310 Int) (v_ArrVal_309 Int) (v_ArrVal_314 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_309)))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (<= (+ v_ArrVal_314 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_314)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_100)))) (* 3 ~N~0)) (not (<= v_ArrVal_312 (+ v_ArrVal_310 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_310)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (not (<= v_ArrVal_314 (+ v_ArrVal_312 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_312)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (< (+ v_main_~i~0_100 1) ~N~0) (let ((.cse2 (mod c_main_~i~0 4))) (and (< .cse2 (+ v_ArrVal_309 4)) (or (and (not (= 0 .cse2)) (< c_main_~i~0 0)) (not (<= v_ArrVal_309 .cse2))))) (not (< v_main_~i~0_100 ~N~0)) (not (<= v_ArrVal_310 0)))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:26:08,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_100 Int) (v_ArrVal_310 Int) (~N~0 Int)) (or (and (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_312 Int) (aux_div_v_main_~i~0_105_23 Int) (aux_mod_v_main_~i~0_105_23 Int) (v_ArrVal_309 Int) (v_ArrVal_314 Int)) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* aux_mod_v_main_~i~0_105_23 4) (* 16 aux_div_v_main_~i~0_105_23) c_main_~a~0.offset) v_ArrVal_309))) (.cse3 (* aux_div_v_main_~i~0_105_23 4))) (let ((.cse0 (+ aux_mod_v_main_~i~0_105_23 .cse3)) (.cse2 (select .cse1 |c_main_~#sum~0.base|))) (or (not (<= (+ c_main_~i~0 1) .cse0)) (<= (+ v_ArrVal_314 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |main_~#sum~0.offset| v_ArrVal_314)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_100)))) (* 3 ~N~0)) (> 0 aux_mod_v_main_~i~0_105_23) (< (+ aux_mod_v_main_~i~0_105_23 .cse3 1) ~N~0) (>= aux_mod_v_main_~i~0_105_23 4) (< aux_mod_v_main_~i~0_105_23 (+ v_ArrVal_309 4)) (not (< .cse0 ~N~0)) (not (<= v_ArrVal_314 (+ v_ArrVal_312 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |main_~#sum~0.offset| v_ArrVal_312)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (not (<= v_ArrVal_312 (+ v_ArrVal_310 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |main_~#sum~0.offset| v_ArrVal_310)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))))))) (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_312 Int) (aux_div_v_main_~i~0_105_23 Int) (aux_mod_v_main_~i~0_105_23 Int) (v_ArrVal_309 Int) (v_ArrVal_314 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* aux_mod_v_main_~i~0_105_23 4) (* 16 aux_div_v_main_~i~0_105_23) c_main_~a~0.offset) v_ArrVal_309))) (.cse7 (* aux_div_v_main_~i~0_105_23 4))) (let ((.cse4 (+ aux_mod_v_main_~i~0_105_23 .cse7)) (.cse6 (select .cse5 |c_main_~#sum~0.base|))) (or (not (<= (+ c_main_~i~0 1) .cse4)) (<= (+ v_ArrVal_314 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |main_~#sum~0.offset| v_ArrVal_314)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_100)))) (* 3 ~N~0)) (> 0 aux_mod_v_main_~i~0_105_23) (< (+ aux_mod_v_main_~i~0_105_23 .cse7 1) ~N~0) (< aux_mod_v_main_~i~0_105_23 v_ArrVal_309) (>= aux_mod_v_main_~i~0_105_23 4) (and (not (= (mod aux_mod_v_main_~i~0_105_23 4) 0)) (< .cse4 0)) (not (< .cse4 ~N~0)) (not (<= v_ArrVal_314 (+ v_ArrVal_312 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |main_~#sum~0.offset| v_ArrVal_312)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (not (<= v_ArrVal_312 (+ v_ArrVal_310 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |main_~#sum~0.offset| v_ArrVal_310)) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))))))))) (< (+ v_main_~i~0_100 1) ~N~0) (not (< v_main_~i~0_100 ~N~0)) (not (<= v_ArrVal_310 0)))) is different from false [2022-01-31 11:28:23,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_100 Int) (v_ArrVal_310 Int) (~N~0 Int) (v_ArrVal_307 Int)) (or (and (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_312 Int) (aux_div_v_main_~i~0_105_23 Int) (aux_mod_v_main_~i~0_105_23 Int) (v_ArrVal_309 Int) (v_ArrVal_314 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_307) (+ (* aux_mod_v_main_~i~0_105_23 4) (* 16 aux_div_v_main_~i~0_105_23) c_main_~a~0.offset) v_ArrVal_309))) (.cse3 (* aux_div_v_main_~i~0_105_23 4))) (let ((.cse2 (+ aux_mod_v_main_~i~0_105_23 .cse3)) (.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_312 (+ (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_310)) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) v_ArrVal_310))) (not (<= (+ c_main_~i~0 1) .cse2)) (> 0 aux_mod_v_main_~i~0_105_23) (< (+ aux_mod_v_main_~i~0_105_23 .cse3 1) ~N~0) (>= aux_mod_v_main_~i~0_105_23 4) (< aux_mod_v_main_~i~0_105_23 (+ v_ArrVal_309 4)) (not (< .cse2 ~N~0)) (<= (+ v_ArrVal_314 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_314)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_100)))) (* 3 ~N~0)) (not (<= v_ArrVal_314 (+ v_ArrVal_312 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_312)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))))) (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_312 Int) (aux_div_v_main_~i~0_105_23 Int) (aux_mod_v_main_~i~0_105_23 Int) (v_ArrVal_309 Int) (v_ArrVal_314 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_307) (+ (* aux_mod_v_main_~i~0_105_23 4) (* 16 aux_div_v_main_~i~0_105_23) c_main_~a~0.offset) v_ArrVal_309))) (.cse7 (* aux_div_v_main_~i~0_105_23 4))) (let ((.cse6 (+ aux_mod_v_main_~i~0_105_23 .cse7)) (.cse5 (select .cse4 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_312 (+ (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_310)) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) v_ArrVal_310))) (not (<= (+ c_main_~i~0 1) .cse6)) (> 0 aux_mod_v_main_~i~0_105_23) (< (+ aux_mod_v_main_~i~0_105_23 .cse7 1) ~N~0) (< aux_mod_v_main_~i~0_105_23 v_ArrVal_309) (>= aux_mod_v_main_~i~0_105_23 4) (and (not (= (mod aux_mod_v_main_~i~0_105_23 4) 0)) (< .cse6 0)) (not (< .cse6 ~N~0)) (<= (+ v_ArrVal_314 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_314)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_100)))) (* 3 ~N~0)) (not (<= v_ArrVal_314 (+ v_ArrVal_312 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_312)) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))))))) (< (+ v_main_~i~0_100 1) ~N~0) (let ((.cse8 (mod c_main_~i~0 4))) (and (or (and (not (= 0 .cse8)) (< c_main_~i~0 0)) (not (<= v_ArrVal_307 .cse8))) (< .cse8 (+ v_ArrVal_307 4)))) (not (< v_main_~i~0_100 ~N~0)) (not (<= v_ArrVal_310 0)))) is different from false [2022-01-31 11:29:30,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_100 Int) (v_ArrVal_310 Int) (~N~0 Int) (v_ArrVal_307 Int)) (or (and (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_312 Int) (aux_div_v_main_~i~0_105_23 Int) (aux_mod_v_main_~i~0_105_23 Int) (v_ArrVal_309 Int) (v_ArrVal_314 Int)) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) v_ArrVal_307) (+ (* aux_mod_v_main_~i~0_105_23 4) (* 16 aux_div_v_main_~i~0_105_23) c_main_~a~0.offset) v_ArrVal_309))) (.cse0 (* aux_div_v_main_~i~0_105_23 4))) (let ((.cse3 (+ aux_mod_v_main_~i~0_105_23 .cse0)) (.cse2 (select .cse1 |c_main_~#sum~0.base|))) (or (> 0 aux_mod_v_main_~i~0_105_23) (< (+ aux_mod_v_main_~i~0_105_23 .cse0 1) ~N~0) (not (<= v_ArrVal_314 (+ v_ArrVal_312 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |main_~#sum~0.offset| v_ArrVal_312)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (< aux_mod_v_main_~i~0_105_23 v_ArrVal_309) (>= aux_mod_v_main_~i~0_105_23 4) (and (not (= (mod aux_mod_v_main_~i~0_105_23 4) 0)) (< .cse3 0)) (not (< .cse3 ~N~0)) (<= (+ v_ArrVal_314 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |main_~#sum~0.offset| v_ArrVal_314)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_100)))) (* 3 ~N~0)) (not (<= (+ c_main_~i~0 2) .cse3)) (not (<= v_ArrVal_312 (+ v_ArrVal_310 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |main_~#sum~0.offset| v_ArrVal_310)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))))))) (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_312 Int) (aux_div_v_main_~i~0_105_23 Int) (aux_mod_v_main_~i~0_105_23 Int) (v_ArrVal_309 Int) (v_ArrVal_314 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) v_ArrVal_307) (+ (* aux_mod_v_main_~i~0_105_23 4) (* 16 aux_div_v_main_~i~0_105_23) c_main_~a~0.offset) v_ArrVal_309))) (.cse4 (* aux_div_v_main_~i~0_105_23 4))) (let ((.cse7 (+ aux_mod_v_main_~i~0_105_23 .cse4)) (.cse6 (select .cse5 |c_main_~#sum~0.base|))) (or (> 0 aux_mod_v_main_~i~0_105_23) (< (+ aux_mod_v_main_~i~0_105_23 .cse4 1) ~N~0) (not (<= v_ArrVal_314 (+ v_ArrVal_312 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |main_~#sum~0.offset| v_ArrVal_312)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (>= aux_mod_v_main_~i~0_105_23 4) (< aux_mod_v_main_~i~0_105_23 (+ v_ArrVal_309 4)) (not (< .cse7 ~N~0)) (<= (+ v_ArrVal_314 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |main_~#sum~0.offset| v_ArrVal_314)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_100)))) (* 3 ~N~0)) (not (<= (+ c_main_~i~0 2) .cse7)) (not (<= v_ArrVal_312 (+ v_ArrVal_310 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |main_~#sum~0.offset| v_ArrVal_310)) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))))))))) (< (+ v_main_~i~0_100 1) ~N~0) (let ((.cse9 (+ c_main_~i~0 1))) (let ((.cse8 (mod .cse9 4))) (and (< .cse8 (+ v_ArrVal_307 4)) (or (and (not (= .cse8 0)) (< .cse9 0)) (not (<= v_ArrVal_307 .cse8)))))) (not (< v_main_~i~0_100 ~N~0)) (not (<= v_ArrVal_310 0)))) is different from false [2022-01-31 11:29:30,145 INFO L353 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2022-01-31 11:29:30,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68343 treesize of output 67488 [2022-01-31 11:29:30,325 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-31 11:29:30,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 11:29:30,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-31 11:29:30,539 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) 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-01-31 11:29:30,543 INFO L158 Benchmark]: Toolchain (without parser) took 295431.47ms. Allocated memory was 179.3MB in the beginning and 329.3MB in the end (delta: 149.9MB). Free memory was 124.8MB in the beginning and 174.1MB in the end (delta: -49.4MB). Peak memory consumption was 174.8MB. Max. memory is 8.0GB. [2022-01-31 11:29:30,543 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 11:29:30,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.98ms. Allocated memory was 179.3MB in the beginning and 273.7MB in the end (delta: 94.4MB). Free memory was 124.6MB in the beginning and 246.5MB in the end (delta: -121.9MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-01-31 11:29:30,543 INFO L158 Benchmark]: Boogie Preprocessor took 45.66ms. Allocated memory is still 273.7MB. Free memory was 246.5MB in the beginning and 245.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 11:29:30,544 INFO L158 Benchmark]: RCFGBuilder took 248.41ms. Allocated memory is still 273.7MB. Free memory was 245.0MB in the beginning and 231.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-31 11:29:30,544 INFO L158 Benchmark]: IcfgTransformer took 32.68ms. Allocated memory is still 273.7MB. Free memory was 231.9MB in the beginning and 230.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 11:29:30,544 INFO L158 Benchmark]: TraceAbstraction took 294830.59ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 229.8MB in the beginning and 174.1MB in the end (delta: 55.6MB). Peak memory consumption was 185.4MB. Max. memory is 8.0GB. [2022-01-31 11:29:30,545 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 179.3MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.98ms. Allocated memory was 179.3MB in the beginning and 273.7MB in the end (delta: 94.4MB). Free memory was 124.6MB in the beginning and 246.5MB in the end (delta: -121.9MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.66ms. Allocated memory is still 273.7MB. Free memory was 246.5MB in the beginning and 245.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 248.41ms. Allocated memory is still 273.7MB. Free memory was 245.0MB in the beginning and 231.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 32.68ms. Allocated memory is still 273.7MB. Free memory was 231.9MB in the beginning and 230.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 294830.59ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 229.8MB in the beginning and 174.1MB in the end (delta: 55.6MB). Peak memory consumption was 185.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-31 11:29:30,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...