/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/ms5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:25:17,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:25:17,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:25:17,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:25:17,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:25:17,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:25:17,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:25:17,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:25:17,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:25:17,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:25:17,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:25:17,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:25:17,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:25:17,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:25:17,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:25:17,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:25:17,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:25:17,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:25:17,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:25:17,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:25:17,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:25:17,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:25:17,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:25:17,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:25:17,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:25:17,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:25:17,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:25:17,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:25:17,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:25:17,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:25:17,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:25:17,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:25:17,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:25:17,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:25:17,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:25:17,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:25:17,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:25:17,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:25:17,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:25:17,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:25:17,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:25:17,431 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:25:17,437 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:25:17,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:25:17,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:25:17,438 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:25:17,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:25:17,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:25:17,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:25:17,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:25:17,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:25:17,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:25:17,439 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:25:17,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:25:17,439 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:25:17,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:25:17,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:25:17,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:25:17,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:25:17,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:25:17,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:25:17,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:25:17,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:25:17,441 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:25:17,441 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:25:17,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:25:17,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:25:17,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:25:17,625 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:25:17,639 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:25:17,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ms5.c [2022-01-31 11:25:17,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8ec61af/0f8c4e24c8ba4ff3895157d152f16fcb/FLAG1fd39fc8d [2022-01-31 11:25:18,059 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:25:18,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms5.c [2022-01-31 11:25:18,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8ec61af/0f8c4e24c8ba4ff3895157d152f16fcb/FLAG1fd39fc8d [2022-01-31 11:25:18,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8ec61af/0f8c4e24c8ba4ff3895157d152f16fcb [2022-01-31 11:25:18,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:25:18,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:25:18,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:25:18,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:25:18,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:25:18,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:25:18" (1/1) ... [2022-01-31 11:25:18,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cbe191c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:18, skipping insertion in model container [2022-01-31 11:25:18,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:25:18" (1/1) ... [2022-01-31 11:25:18,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:25:18,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:25:18,208 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/ms5.c[586,599] [2022-01-31 11:25:18,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:25:18,222 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:25:18,229 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/ms5.c[586,599] [2022-01-31 11:25:18,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:25:18,240 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:25:18,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:18 WrapperNode [2022-01-31 11:25:18,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:25:18,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:25:18,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:25:18,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:25:18,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:18" (1/1) ... [2022-01-31 11:25:18,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:18" (1/1) ... [2022-01-31 11:25:18,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:18" (1/1) ... [2022-01-31 11:25:18,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:18" (1/1) ... [2022-01-31 11:25:18,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:18" (1/1) ... [2022-01-31 11:25:18,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:18" (1/1) ... [2022-01-31 11:25:18,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:18" (1/1) ... [2022-01-31 11:25:18,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:25:18,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:25:18,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:25:18,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:25:18,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:18" (1/1) ... [2022-01-31 11:25:18,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:25:18,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:25:18,293 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:25:18,297 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:25:18,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:25:18,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:25:18,320 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:25:18,320 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:25:18,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:25:18,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:25:18,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:25:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:25:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:25:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:25:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:25:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:25:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:25:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:25:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:25:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:25:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:25:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:25:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:25:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:25:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:25:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:25:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:25:18,384 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:25:18,385 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:25:18,534 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:25:18,538 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:25:18,538 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 11:25:18,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:25:18 BoogieIcfgContainer [2022-01-31 11:25:18,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:25:18,540 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:25:18,540 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:25:18,540 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:25:18,542 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:25:18" (1/1) ... [2022-01-31 11:25:18,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:25:18 BasicIcfg [2022-01-31 11:25:18,553 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:25:18,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:25:18,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:25:18,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:25:18,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:25:18" (1/4) ... [2022-01-31 11:25:18,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364ae905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:25:18, skipping insertion in model container [2022-01-31 11:25:18,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:18" (2/4) ... [2022-01-31 11:25:18,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364ae905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:25:18, skipping insertion in model container [2022-01-31 11:25:18,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:25:18" (3/4) ... [2022-01-31 11:25:18,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364ae905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:25:18, skipping insertion in model container [2022-01-31 11:25:18,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:25:18" (4/4) ... [2022-01-31 11:25:18,558 INFO L111 eAbstractionObserver]: Analyzing ICFG ms5.cJordan [2022-01-31 11:25:18,570 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:25:18,570 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:25:18,610 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:25:18,616 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:25:18,616 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:25:18,626 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:25:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 11:25:18,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:25:18,642 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:25:18,643 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:25:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:25:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash -219332792, now seen corresponding path program 1 times [2022-01-31 11:25:18,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:25:18,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293522573] [2022-01-31 11:25:18,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:25:18,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:25:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:25:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:18,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:25:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:18,840 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:25:18,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:25:18,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293522573] [2022-01-31 11:25:18,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293522573] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:25:18,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:25:18,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:25:18,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358271212] [2022-01-31 11:25:18,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:25:18,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:25:18,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:25:18,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:25:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:25:18,869 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:25:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:25:18,922 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-01-31 11:25:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:25:18,924 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:25:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:25:18,931 INFO L225 Difference]: With dead ends: 32 [2022-01-31 11:25:18,931 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 11:25:18,932 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:25:18,936 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:25:18,936 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.0s Time] [2022-01-31 11:25:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 11:25:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 11:25:18,957 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:25:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-01-31 11:25:18,958 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-01-31 11:25:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:25:18,959 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-01-31 11:25:18,960 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:25:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-01-31 11:25:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 11:25:18,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:25:18,961 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:25:18,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:25:18,961 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:25:18,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:25:18,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1681189413, now seen corresponding path program 1 times [2022-01-31 11:25:18,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:25:18,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793224784] [2022-01-31 11:25:18,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:25:18,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:25:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:19,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:25:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:19,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:25:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:19,083 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:25:19,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:25:19,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793224784] [2022-01-31 11:25:19,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793224784] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:25:19,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:25:19,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:25:19,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126887440] [2022-01-31 11:25:19,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:25:19,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:25:19,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:25:19,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:25:19,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:25:19,086 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:25:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:25:19,153 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-01-31 11:25:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:25:19,153 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:25:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:25:19,155 INFO L225 Difference]: With dead ends: 30 [2022-01-31 11:25:19,155 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 11:25:19,158 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:25:19,160 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:25:19,160 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.0s Time] [2022-01-31 11:25:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 11:25:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-01-31 11:25:19,166 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:25:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-01-31 11:25:19,166 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2022-01-31 11:25:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:25:19,167 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-01-31 11:25:19,167 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:25:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-01-31 11:25:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 11:25:19,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:25:19,168 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:25:19,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:25:19,168 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:25:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:25:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash 982061835, now seen corresponding path program 1 times [2022-01-31 11:25:19,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:25:19,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24812006] [2022-01-31 11:25:19,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:25:19,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:25:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:19,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:25:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:19,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:25:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:19,276 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:25:19,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:25:19,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24812006] [2022-01-31 11:25:19,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24812006] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:25:19,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:25:19,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 11:25:19,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594515042] [2022-01-31 11:25:19,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:25:19,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 11:25:19,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:25:19,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 11:25:19,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 11:25:19,279 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:25:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:25:19,378 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-01-31 11:25:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 11:25:19,379 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:25:19,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:25:19,380 INFO L225 Difference]: With dead ends: 35 [2022-01-31 11:25:19,380 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 11:25:19,382 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:25:19,386 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:25:19,387 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:25:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 11:25:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-31 11:25:19,390 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:25:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-01-31 11:25:19,390 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2022-01-31 11:25:19,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:25:19,390 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-01-31 11:25:19,391 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:25:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-01-31 11:25:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 11:25:19,391 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:25:19,391 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:25:19,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 11:25:19,391 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:25:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:25:19,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1617004712, now seen corresponding path program 1 times [2022-01-31 11:25:19,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:25:19,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116924379] [2022-01-31 11:25:19,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:25:19,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:25:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:19,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:25:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:19,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:25:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:19,455 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:25:19,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:25:19,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116924379] [2022-01-31 11:25:19,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116924379] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:25:19,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088759287] [2022-01-31 11:25:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:25:19,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:25:19,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:25:19,460 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:25:19,460 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:25:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:19,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:25:19,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:25:19,617 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:25:19,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:25:19,677 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:25:19,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088759287] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:25:19,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:25:19,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:25:19,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582594914] [2022-01-31 11:25:19,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:25:19,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:25:19,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:25:19,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:25:19,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:25:19,679 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:25:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:25:19,791 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-01-31 11:25:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:25:19,792 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:25:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:25:19,792 INFO L225 Difference]: With dead ends: 40 [2022-01-31 11:25:19,792 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 11:25:19,793 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:25:19,793 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:25:19,794 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:25:19,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 11:25:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-01-31 11:25:19,796 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:25:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-01-31 11:25:19,796 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2022-01-31 11:25:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:25:19,797 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-01-31 11:25:19,797 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:25:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-01-31 11:25:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:25:19,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:25:19,797 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:25:19,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 11:25:20,027 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:25:20,028 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:25:20,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:25:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash 66776460, now seen corresponding path program 2 times [2022-01-31 11:25:20,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:25:20,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628339448] [2022-01-31 11:25:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:25:20,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:25:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:20,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:25:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:20,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:25:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:20,403 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:25:20,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:25:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628339448] [2022-01-31 11:25:20,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628339448] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:25:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699155876] [2022-01-31 11:25:20,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:25:20,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:25:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:25:20,405 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:25:20,406 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:25:20,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:25:20,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:25:20,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 11:25:20,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:25:20,510 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:20,569 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:20,692 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 21 treesize of output 20 [2022-01-31 11:25:20,821 INFO L353 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-01-31 11:25:20,822 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 45 treesize of output 39 [2022-01-31 11:25:21,019 INFO L353 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-01-31 11:25:21,019 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 32 treesize of output 13 [2022-01-31 11:25:21,087 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:25:21,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:25:21,596 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:25:21,778 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:25:21,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699155876] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:25:21,779 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:25:21,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 41 [2022-01-31 11:25:21,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344841930] [2022-01-31 11:25:21,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:25:21,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-31 11:25:21,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:25:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-31 11:25:21,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 11:25:21,781 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:25:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:25:22,527 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-01-31 11:25:22,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 11:25:22,528 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:25:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:25:22,529 INFO L225 Difference]: With dead ends: 62 [2022-01-31 11:25:22,529 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 11:25:22,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=499, Invalid=3161, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 11:25:22,530 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:25:22,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 103 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 464 Invalid, 0 Unknown, 129 Unchecked, 0.2s Time] [2022-01-31 11:25:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 11:25:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-01-31 11:25:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-01-31 11:25:22,534 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2022-01-31 11:25:22,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:25:22,534 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-01-31 11:25:22,534 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:25:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-01-31 11:25:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 11:25:22,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:25:22,535 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:25:22,554 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:25:22,751 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:25:22,752 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:25:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:25:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1772479453, now seen corresponding path program 3 times [2022-01-31 11:25:22,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:25:22,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27396617] [2022-01-31 11:25:22,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:25:22,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:25:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:25:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:25:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:25:23,228 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:25:23,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:25:23,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27396617] [2022-01-31 11:25:23,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27396617] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:25:23,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845165784] [2022-01-31 11:25:23,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:25:23,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:25:23,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:25:23,230 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:25:23,259 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:25:23,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 11:25:23,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:25:23,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-31 11:25:23,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:25:23,357 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:23,427 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:23,500 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:25:23,500 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:25:23,632 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:25:23,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:25:23,720 INFO L353 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-01-31 11:25:23,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 51 [2022-01-31 11:25:23,882 INFO L353 Elim1Store]: treesize reduction 87, result has 1.1 percent of original size [2022-01-31 11:25:23,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 63 [2022-01-31 11:25:25,430 INFO L353 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-01-31 11:25:25,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 21 [2022-01-31 11:25:25,504 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:25:25,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:25:56,264 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-31 11:25:56,265 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 1074 treesize of output 1040 [2022-01-31 11:25:59,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:25:59,451 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-31 11:25:59,468 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:25:59,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845165784] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:25:59,468 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:25:59,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 49 [2022-01-31 11:25:59,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515139718] [2022-01-31 11:25:59,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:25:59,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-01-31 11:25:59,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:25:59,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-01-31 11:25:59,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=2018, Unknown=13, NotChecked=0, Total=2352 [2022-01-31 11:25:59,470 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 49 states, 47 states have (on average 1.574468085106383) internal successors, (74), 46 states have internal predecessors, (74), 4 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:26:19,436 WARN L228 SmtUtils]: Spent 7.89s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:26:50,866 WARN L228 SmtUtils]: Spent 28.13s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:27:47,770 WARN L228 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:27:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:27:48,750 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2022-01-31 11:27:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-31 11:27:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.574468085106383) internal successors, (74), 46 states have internal predecessors, (74), 4 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 36 [2022-01-31 11:27:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:27:48,753 INFO L225 Difference]: With dead ends: 94 [2022-01-31 11:27:48,753 INFO L226 Difference]: Without dead ends: 86 [2022-01-31 11:27:48,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 142.3s TimeCoverageRelationStatistics Valid=872, Invalid=4946, Unknown=34, NotChecked=0, Total=5852 [2022-01-31 11:27:48,755 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:27:48,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 98 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 428 Invalid, 0 Unknown, 216 Unchecked, 0.3s Time] [2022-01-31 11:27:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-31 11:27:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2022-01-31 11:27:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 59 states have internal predecessors, (70), 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:27:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-01-31 11:27:48,759 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 36 [2022-01-31 11:27:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:27:48,760 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-01-31 11:27:48,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.574468085106383) internal successors, (74), 46 states have internal predecessors, (74), 4 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:27:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-01-31 11:27:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 11:27:48,760 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:27:48,761 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2022-01-31 11:27:48,782 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:27:48,961 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:27:48,961 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:27:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:27:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash -750398229, now seen corresponding path program 4 times [2022-01-31 11:27:48,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:27:48,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557843947] [2022-01-31 11:27:48,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:27:48,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:27:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:27:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:27:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:27:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:27:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:27:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 11:27:49,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:27:49,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557843947] [2022-01-31 11:27:49,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557843947] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:27:49,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715064642] [2022-01-31 11:27:49,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:27:49,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:27:49,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:27:49,024 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:27:49,024 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:27:49,067 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:27:49,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:27:49,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-31 11:27:49,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:27:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 11:27:49,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 11:27:49,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715064642] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:27:49,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 11:27:49,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-01-31 11:27:49,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311733611] [2022-01-31 11:27:49,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:27:49,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:27:49,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:27:49,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:27:49,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 11:27:49,126 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:27:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:27:49,150 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-01-31 11:27:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 11:27:49,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-01-31 11:27:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:27:49,151 INFO L225 Difference]: With dead ends: 65 [2022-01-31 11:27:49,152 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 11:27:49,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 11:27:49,152 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:27:49,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 51 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:27:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 11:27:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2022-01-31 11:27:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 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:27:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-01-31 11:27:49,169 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 37 [2022-01-31 11:27:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:27:49,169 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-01-31 11:27:49,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:27:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-01-31 11:27:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 11:27:49,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:27:49,170 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2022-01-31 11:27:49,186 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:27:49,374 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:27:49,374 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:27:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:27:49,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1747617708, now seen corresponding path program 5 times [2022-01-31 11:27:49,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:27:49,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466602285] [2022-01-31 11:27:49,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:27:49,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:27:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:27:49,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:27:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:27:49,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:27:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:27:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:27:49,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:27:49,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466602285] [2022-01-31 11:27:49,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466602285] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:27:49,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752578183] [2022-01-31 11:27:49,459 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:27:49,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:27:49,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:27:49,460 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:27:49,460 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:27:49,508 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-31 11:27:49,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:27:49,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 11:27:49,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:27:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:27:49,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:27:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:27:49,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752578183] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:27:49,709 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:27:49,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-01-31 11:27:49,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322852488] [2022-01-31 11:27:49,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:27:49,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 11:27:49,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:27:49,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 11:27:49,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-01-31 11:27:49,711 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 19 states have internal predecessors, (58), 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:27:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:27:49,933 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-01-31 11:27:49,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:27:49,934 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 19 states have internal predecessors, (58), 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 37 [2022-01-31 11:27:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:27:49,934 INFO L225 Difference]: With dead ends: 86 [2022-01-31 11:27:49,934 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 11:27:49,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2022-01-31 11:27:49,935 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 90 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:27:49,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 53 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:27:49,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 11:27:49,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2022-01-31 11:27:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 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:27:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-01-31 11:27:49,938 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 37 [2022-01-31 11:27:49,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:27:49,939 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-01-31 11:27:49,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 19 states have internal predecessors, (58), 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:27:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-01-31 11:27:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 11:27:49,939 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:27:49,939 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:27:49,961 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:27:50,155 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:27:50,156 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:27:50,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:27:50,156 INFO L85 PathProgramCache]: Analyzing trace with hash -722575244, now seen corresponding path program 6 times [2022-01-31 11:27:50,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:27:50,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010771836] [2022-01-31 11:27:50,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:27:50,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:27:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:27:50,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:27:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:27:50,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:27:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:27:50,865 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:27:50,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:27:50,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010771836] [2022-01-31 11:27:50,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010771836] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:27:50,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760092994] [2022-01-31 11:27:50,866 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:27:50,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:27:50,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:27:50,867 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:27:50,868 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:27:50,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 11:27:50,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:27:50,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-31 11:27:50,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:27:51,071 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:27:51,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:51,146 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 32 treesize of output 31 [2022-01-31 11:27:51,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:51,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:51,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:51,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-01-31 11:27:52,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:52,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:52,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:52,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:52,763 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 44 treesize of output 49 [2022-01-31 11:27:53,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:53,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:53,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:53,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:53,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:53,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:53,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:27:53,362 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 68 treesize of output 59 [2022-01-31 11:27:54,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:54,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:54,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:54,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:54,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2022-01-31 11:27:55,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:55,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:55,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:55,042 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-01-31 11:27:55,042 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 71 treesize of output 63 [2022-01-31 11:27:57,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:57,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:57,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:27:57,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:27:57,023 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 59 treesize of output 19 [2022-01-31 11:27:57,166 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:27:57,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:28:35,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_236 Int) (|main_~#sum~0.offset| Int) (v_ArrVal_243 Int) (v_ArrVal_241 Int) (v_main_~i~0_69 Int) (v_ArrVal_238 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_236)))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_243 (+ v_ArrVal_241 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_241)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (let ((.cse2 (mod c_main_~i~0 5))) (and (or (and (not (= .cse2 0)) (< c_main_~i~0 0)) (not (<= v_ArrVal_236 .cse2))) (< .cse2 (+ v_ArrVal_236 5)))) (not (< v_main_~i~0_69 ~N~0)) (not (<= v_ArrVal_238 0)) (not (<= v_ArrVal_241 (+ v_ArrVal_238 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_238)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (< (+ v_main_~i~0_69 1) ~N~0) (<= (+ v_ArrVal_243 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_243)) c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_69 4)))) (* ~N~0 4)))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:29:04,696 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_main_~i~0_69 Int) (v_ArrVal_238 Int)) (or (not (< v_main_~i~0_69 ~N~0)) (not (<= v_ArrVal_238 0)) (and (forall ((v_ArrVal_236 Int) (|main_~#sum~0.offset| Int) (aux_mod_v_main_~i~0_74_22 Int) (v_ArrVal_243 Int) (v_ArrVal_241 Int) (aux_div_v_main_~i~0_74_22 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 20 aux_div_v_main_~i~0_74_22) (* aux_mod_v_main_~i~0_74_22 4) c_main_~a~0.offset) v_ArrVal_236))) (.cse3 (* 5 aux_div_v_main_~i~0_74_22))) (let ((.cse2 (+ aux_mod_v_main_~i~0_74_22 .cse3)) (.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (> 0 aux_mod_v_main_~i~0_74_22) (not (<= v_ArrVal_243 (+ v_ArrVal_241 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_241)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (<= (+ v_ArrVal_243 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_243)) c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_69 4)))) (* ~N~0 4)) (and (< .cse2 0) (not (= (mod aux_mod_v_main_~i~0_74_22 5) 0))) (< aux_mod_v_main_~i~0_74_22 v_ArrVal_236) (< (+ aux_mod_v_main_~i~0_74_22 .cse3 1) ~N~0) (not (<= (+ c_main_~i~0 1) .cse2)) (not (< .cse2 ~N~0)) (not (<= v_ArrVal_241 (+ v_ArrVal_238 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_238)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (>= aux_mod_v_main_~i~0_74_22 5))))) (forall ((v_ArrVal_236 Int) (|main_~#sum~0.offset| Int) (aux_mod_v_main_~i~0_74_22 Int) (v_ArrVal_243 Int) (v_ArrVal_241 Int) (aux_div_v_main_~i~0_74_22 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 20 aux_div_v_main_~i~0_74_22) (* aux_mod_v_main_~i~0_74_22 4) c_main_~a~0.offset) v_ArrVal_236))) (.cse6 (* 5 aux_div_v_main_~i~0_74_22))) (let ((.cse7 (+ aux_mod_v_main_~i~0_74_22 .cse6)) (.cse5 (select .cse4 |c_main_~#sum~0.base|))) (or (> 0 aux_mod_v_main_~i~0_74_22) (not (<= v_ArrVal_243 (+ v_ArrVal_241 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_241)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (<= (+ v_ArrVal_243 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_243)) c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_69 4)))) (* ~N~0 4)) (< aux_mod_v_main_~i~0_74_22 (+ v_ArrVal_236 5)) (< (+ aux_mod_v_main_~i~0_74_22 .cse6 1) ~N~0) (not (<= (+ c_main_~i~0 1) .cse7)) (not (< .cse7 ~N~0)) (not (<= v_ArrVal_241 (+ v_ArrVal_238 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_238)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (>= aux_mod_v_main_~i~0_74_22 5)))))) (< (+ v_main_~i~0_69 1) ~N~0))) is different from false [2022-01-31 11:30:15,303 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_234 Int) (~N~0 Int) (v_main_~i~0_69 Int) (v_ArrVal_238 Int)) (or (and (forall ((v_ArrVal_236 Int) (|main_~#sum~0.offset| Int) (aux_mod_v_main_~i~0_74_22 Int) (v_ArrVal_243 Int) (v_ArrVal_241 Int) (aux_div_v_main_~i~0_74_22 Int)) (let ((.cse3 (* 5 aux_div_v_main_~i~0_74_22)) (.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_234) (+ (* 20 aux_div_v_main_~i~0_74_22) (* aux_mod_v_main_~i~0_74_22 4) c_main_~a~0.offset) v_ArrVal_236)))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|)) (.cse2 (+ aux_mod_v_main_~i~0_74_22 .cse3))) (or (> 0 aux_mod_v_main_~i~0_74_22) (not (<= v_ArrVal_241 (+ v_ArrVal_238 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_238)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (not (<= v_ArrVal_243 (+ v_ArrVal_241 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_241)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (and (< .cse2 0) (not (= (mod aux_mod_v_main_~i~0_74_22 5) 0))) (< aux_mod_v_main_~i~0_74_22 v_ArrVal_236) (<= (+ v_ArrVal_243 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_243)) c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_69 4)))) (* ~N~0 4)) (< (+ aux_mod_v_main_~i~0_74_22 .cse3 1) ~N~0) (not (<= (+ c_main_~i~0 1) .cse2)) (not (< .cse2 ~N~0)) (>= aux_mod_v_main_~i~0_74_22 5))))) (forall ((v_ArrVal_236 Int) (|main_~#sum~0.offset| Int) (aux_mod_v_main_~i~0_74_22 Int) (v_ArrVal_243 Int) (v_ArrVal_241 Int) (aux_div_v_main_~i~0_74_22 Int)) (let ((.cse6 (* 5 aux_div_v_main_~i~0_74_22)) (.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_234) (+ (* 20 aux_div_v_main_~i~0_74_22) (* aux_mod_v_main_~i~0_74_22 4) c_main_~a~0.offset) v_ArrVal_236)))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|)) (.cse7 (+ aux_mod_v_main_~i~0_74_22 .cse6))) (or (> 0 aux_mod_v_main_~i~0_74_22) (not (<= v_ArrVal_241 (+ v_ArrVal_238 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_238)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (not (<= v_ArrVal_243 (+ v_ArrVal_241 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_241)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (<= (+ v_ArrVal_243 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_243)) c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_69 4)))) (* ~N~0 4)) (< aux_mod_v_main_~i~0_74_22 (+ v_ArrVal_236 5)) (< (+ aux_mod_v_main_~i~0_74_22 .cse6 1) ~N~0) (not (<= (+ c_main_~i~0 1) .cse7)) (not (< .cse7 ~N~0)) (>= aux_mod_v_main_~i~0_74_22 5)))))) (not (< v_main_~i~0_69 ~N~0)) (not (<= v_ArrVal_238 0)) (let ((.cse8 (mod c_main_~i~0 5))) (and (< .cse8 (+ v_ArrVal_234 5)) (or (and (not (= .cse8 0)) (< c_main_~i~0 0)) (not (<= v_ArrVal_234 .cse8))))) (< (+ v_main_~i~0_69 1) ~N~0))) is different from false [2022-01-31 11:31:25,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_234 Int) (~N~0 Int) (v_main_~i~0_69 Int) (v_ArrVal_238 Int)) (or (not (< v_main_~i~0_69 ~N~0)) (and (forall ((v_ArrVal_236 Int) (|main_~#sum~0.offset| Int) (aux_mod_v_main_~i~0_74_22 Int) (v_ArrVal_243 Int) (v_ArrVal_241 Int) (aux_div_v_main_~i~0_74_22 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 4) v_ArrVal_234) (+ (* 20 aux_div_v_main_~i~0_74_22) (* aux_mod_v_main_~i~0_74_22 4) c_main_~a~0.offset) v_ArrVal_236))) (.cse3 (* 5 aux_div_v_main_~i~0_74_22))) (let ((.cse2 (+ aux_mod_v_main_~i~0_74_22 .cse3)) (.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (> 0 aux_mod_v_main_~i~0_74_22) (<= (+ v_ArrVal_243 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_243)) c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_69 4)))) (* ~N~0 4)) (not (<= (+ c_main_~i~0 2) .cse2)) (< aux_mod_v_main_~i~0_74_22 (+ v_ArrVal_236 5)) (< (+ aux_mod_v_main_~i~0_74_22 .cse3 1) ~N~0) (not (<= v_ArrVal_243 (+ v_ArrVal_241 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_241)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (not (< .cse2 ~N~0)) (not (<= v_ArrVal_241 (+ v_ArrVal_238 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_238)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (>= aux_mod_v_main_~i~0_74_22 5))))) (forall ((v_ArrVal_236 Int) (|main_~#sum~0.offset| Int) (aux_mod_v_main_~i~0_74_22 Int) (v_ArrVal_243 Int) (v_ArrVal_241 Int) (aux_div_v_main_~i~0_74_22 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 4) v_ArrVal_234) (+ (* 20 aux_div_v_main_~i~0_74_22) (* aux_mod_v_main_~i~0_74_22 4) c_main_~a~0.offset) v_ArrVal_236))) (.cse7 (* 5 aux_div_v_main_~i~0_74_22))) (let ((.cse6 (+ aux_mod_v_main_~i~0_74_22 .cse7)) (.cse5 (select .cse4 |c_main_~#sum~0.base|))) (or (> 0 aux_mod_v_main_~i~0_74_22) (<= (+ v_ArrVal_243 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_243)) c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_69 4)))) (* ~N~0 4)) (and (< .cse6 0) (not (= (mod aux_mod_v_main_~i~0_74_22 5) 0))) (< aux_mod_v_main_~i~0_74_22 v_ArrVal_236) (not (<= (+ c_main_~i~0 2) .cse6)) (< (+ aux_mod_v_main_~i~0_74_22 .cse7 1) ~N~0) (not (<= v_ArrVal_243 (+ v_ArrVal_241 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_241)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (not (< .cse6 ~N~0)) (not (<= v_ArrVal_241 (+ v_ArrVal_238 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |main_~#sum~0.offset| v_ArrVal_238)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (>= aux_mod_v_main_~i~0_74_22 5)))))) (not (<= v_ArrVal_238 0)) (< (+ v_main_~i~0_69 1) ~N~0) (let ((.cse9 (+ c_main_~i~0 1))) (let ((.cse8 (mod .cse9 5))) (and (< .cse8 (+ v_ArrVal_234 5)) (or (and (< .cse9 0) (not (= .cse8 0))) (not (<= v_ArrVal_234 .cse8)))))))) is different from false [2022-01-31 11:31:25,399 INFO L353 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2022-01-31 11:31:25,400 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 45547 treesize of output 44968 [2022-01-31 11:31:25,529 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-31 11:31:25,549 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:31:25,731 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:31:25,732 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:31:25,734 INFO L158 Benchmark]: Toolchain (without parser) took 367657.54ms. Allocated memory was 189.8MB in the beginning and 288.4MB in the end (delta: 98.6MB). Free memory was 141.2MB in the beginning and 196.6MB in the end (delta: -55.4MB). Peak memory consumption was 150.9MB. Max. memory is 8.0GB. [2022-01-31 11:31:25,734 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 11:31:25,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.71ms. Allocated memory is still 189.8MB. Free memory was 140.9MB in the beginning and 165.9MB in the end (delta: -25.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-01-31 11:31:25,734 INFO L158 Benchmark]: Boogie Preprocessor took 29.31ms. Allocated memory is still 189.8MB. Free memory was 165.9MB in the beginning and 164.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 11:31:25,735 INFO L158 Benchmark]: RCFGBuilder took 268.14ms. Allocated memory is still 189.8MB. Free memory was 164.3MB in the beginning and 152.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 11:31:25,735 INFO L158 Benchmark]: IcfgTransformer took 13.64ms. Allocated memory is still 189.8MB. Free memory was 152.8MB in the beginning and 151.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 11:31:25,735 INFO L158 Benchmark]: TraceAbstraction took 367179.35ms. Allocated memory was 189.8MB in the beginning and 288.4MB in the end (delta: 98.6MB). Free memory was 151.2MB in the beginning and 196.6MB in the end (delta: -45.4MB). Peak memory consumption was 161.1MB. Max. memory is 8.0GB. [2022-01-31 11:31:25,736 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.10ms. Allocated memory is still 189.8MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 161.71ms. Allocated memory is still 189.8MB. Free memory was 140.9MB in the beginning and 165.9MB in the end (delta: -25.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.31ms. Allocated memory is still 189.8MB. Free memory was 165.9MB in the beginning and 164.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 268.14ms. Allocated memory is still 189.8MB. Free memory was 164.3MB in the beginning and 152.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 13.64ms. Allocated memory is still 189.8MB. Free memory was 152.8MB in the beginning and 151.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 367179.35ms. Allocated memory was 189.8MB in the beginning and 288.4MB in the end (delta: 98.6MB). Free memory was 151.2MB in the beginning and 196.6MB in the end (delta: -45.4MB). Peak memory consumption was 161.1MB. 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:31:25,940 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-01-31 11:31:25,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...