/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/res2o.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:35:27,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:35:27,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:35:27,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:35:27,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:35:27,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:35:27,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:35:27,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:35:27,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:35:27,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:35:27,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:35:27,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:35:27,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:35:27,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:35:27,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:35:27,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:35:27,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:35:27,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:35:27,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:35:27,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:35:27,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:35:27,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:35:27,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:35:27,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:35:27,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:35:27,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:35:27,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:35:27,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:35:27,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:35:27,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:35:27,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:35:27,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:35:27,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:35:27,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:35:27,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:35:27,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:35:27,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:35:27,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:35:27,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:35:27,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:35:27,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:35:27,988 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:35:27,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:35:27,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:35:27,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:35:27,995 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:35:27,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:35:27,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:35:27,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:35:27,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:35:27,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:35:27,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:35:27,996 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:35:27,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:35:27,996 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:35:27,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:35:27,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:35:27,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:35:27,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:35:27,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:35:27,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:35:27,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:35:27,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:35:27,997 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:35:27,997 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:35:28,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:35:28,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:35:28,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:35:28,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:35:28,156 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:35:28,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/res2o.c [2022-01-31 11:35:28,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940527956/10a3626f02d84e8497ab35cd251b189e/FLAGf6c02372d [2022-01-31 11:35:28,549 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:35:28,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res2o.c [2022-01-31 11:35:28,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940527956/10a3626f02d84e8497ab35cd251b189e/FLAGf6c02372d [2022-01-31 11:35:28,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940527956/10a3626f02d84e8497ab35cd251b189e [2022-01-31 11:35:28,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:35:28,565 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:35:28,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:35:28,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:35:28,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:35:28,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:35:28" (1/1) ... [2022-01-31 11:35:28,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be1b262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:28, skipping insertion in model container [2022-01-31 11:35:28,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:35:28" (1/1) ... [2022-01-31 11:35:28,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:35:28,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:35:28,677 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/res2o.c[588,601] [2022-01-31 11:35:28,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:35:28,697 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:35:28,712 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/res2o.c[588,601] [2022-01-31 11:35:28,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:35:28,740 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:35:28,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:28 WrapperNode [2022-01-31 11:35:28,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:35:28,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:35:28,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:35:28,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:35:28,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:28" (1/1) ... [2022-01-31 11:35:28,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:28" (1/1) ... [2022-01-31 11:35:28,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:28" (1/1) ... [2022-01-31 11:35:28,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:28" (1/1) ... [2022-01-31 11:35:28,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:28" (1/1) ... [2022-01-31 11:35:28,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:28" (1/1) ... [2022-01-31 11:35:28,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:28" (1/1) ... [2022-01-31 11:35:28,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:35:28,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:35:28,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:35:28,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:35:28,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:28" (1/1) ... [2022-01-31 11:35:28,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:35:28,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:28,807 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:35:28,814 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:35:28,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:35:28,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:35:28,834 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:35:28,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:35:28,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:35:28,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:35:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:35:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:35:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:35:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:35:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:35:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:35:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:35:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:35:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:35:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:35:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:35:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:35:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:35:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:35:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:35:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:35:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:35:28,903 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:35:28,907 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:35:29,059 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:35:29,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:35:29,064 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-31 11:35:29,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:35:29 BoogieIcfgContainer [2022-01-31 11:35:29,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:35:29,066 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:35:29,066 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:35:29,067 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:35:29,069 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:35:29" (1/1) ... [2022-01-31 11:35:29,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:35:29 BasicIcfg [2022-01-31 11:35:29,085 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:35:29,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:35:29,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:35:29,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:35:29,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:35:28" (1/4) ... [2022-01-31 11:35:29,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc42c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:35:29, skipping insertion in model container [2022-01-31 11:35:29,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:28" (2/4) ... [2022-01-31 11:35:29,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc42c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:35:29, skipping insertion in model container [2022-01-31 11:35:29,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:35:29" (3/4) ... [2022-01-31 11:35:29,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc42c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:35:29, skipping insertion in model container [2022-01-31 11:35:29,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:35:29" (4/4) ... [2022-01-31 11:35:29,090 INFO L111 eAbstractionObserver]: Analyzing ICFG res2o.cJordan [2022-01-31 11:35:29,093 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:35:29,093 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:35:29,121 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:35:29,126 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:35:29,126 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:35:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 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:35:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 11:35:29,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:29,141 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, 1, 1, 1] [2022-01-31 11:35:29,141 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:29,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:29,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1706366241, now seen corresponding path program 1 times [2022-01-31 11:35:29,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:29,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499143889] [2022-01-31 11:35:29,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:29,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:29,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:35:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:29,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:35:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:29,302 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:35:29,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:29,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499143889] [2022-01-31 11:35:29,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499143889] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:35:29,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:35:29,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:35:29,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613736533] [2022-01-31 11:35:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:35:29,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:35:29,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:29,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:35:29,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:35:29,327 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 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 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (4), 3 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:35:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:29,378 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-01-31 11:35:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:35:29,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (4), 3 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 29 [2022-01-31 11:35:29,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:29,385 INFO L225 Difference]: With dead ends: 43 [2022-01-31 11:35:29,385 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 11:35:29,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:35:29,388 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:35:29,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:35:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 11:35:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-01-31 11:35:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:35:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-01-31 11:35:29,410 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2022-01-31 11:35:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:29,411 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-01-31 11:35:29,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (4), 3 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:35:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-01-31 11:35:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 11:35:29,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:29,412 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, 1, 1, 1] [2022-01-31 11:35:29,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:35:29,412 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1900685157, now seen corresponding path program 1 times [2022-01-31 11:35:29,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:29,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736768453] [2022-01-31 11:35:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:29,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:29,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:35:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:29,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:35:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:29,506 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:35:29,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:29,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736768453] [2022-01-31 11:35:29,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736768453] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:35:29,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:35:29,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:35:29,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538315441] [2022-01-31 11:35:29,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:35:29,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:35:29,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:29,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:35:29,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:35:29,509 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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:35:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:29,618 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-01-31 11:35:29,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:35:29,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 29 [2022-01-31 11:35:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:29,620 INFO L225 Difference]: With dead ends: 48 [2022-01-31 11:35:29,620 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 11:35:29,623 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:35:29,624 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:35:29,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 28 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:35:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 11:35:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2022-01-31 11:35:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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:35:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-01-31 11:35:29,629 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 29 [2022-01-31 11:35:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:29,629 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-01-31 11:35:29,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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:35:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-01-31 11:35:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 11:35:29,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:29,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:35:29,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:35:29,630 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 965116009, now seen corresponding path program 1 times [2022-01-31 11:35:29,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:29,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377211818] [2022-01-31 11:35:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:29,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:30,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:35:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:35:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:35:30,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:30,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377211818] [2022-01-31 11:35:30,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377211818] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:35:30,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852915553] [2022-01-31 11:35:30,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:30,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:35:30,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:30,647 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:35:30,655 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:35:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:30,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-31 11:35:30,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:35:30,874 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 11 treesize of output 7 [2022-01-31 11:35:30,904 INFO L353 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-01-31 11:35:30,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 34 [2022-01-31 11:35:30,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-01-31 11:35:31,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-01-31 11:35:31,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-01-31 11:35:31,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-01-31 11:35:31,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 11:35:32,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2022-01-31 11:35:32,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2022-01-31 11:35:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:35:32,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:35:42,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:42,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:42,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:42,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:42,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:42,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:35:42,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852915553] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:35:42,127 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:35:42,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 46 [2022-01-31 11:35:42,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863543419] [2022-01-31 11:35:42,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:35:42,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-31 11:35:42,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:42,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-31 11:35:42,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1786, Unknown=3, NotChecked=0, Total=2070 [2022-01-31 11:35:42,132 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 46 states, 44 states have (on average 2.022727272727273) internal successors, (89), 43 states have internal predecessors, (89), 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:35:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:44,113 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-01-31 11:35:44,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-31 11:35:44,113 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.022727272727273) internal successors, (89), 43 states have internal predecessors, (89), 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 41 [2022-01-31 11:35:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:44,115 INFO L225 Difference]: With dead ends: 85 [2022-01-31 11:35:44,115 INFO L226 Difference]: Without dead ends: 79 [2022-01-31 11:35:44,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 58 SyntacticMatches, 11 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=472, Invalid=3065, Unknown=3, NotChecked=0, Total=3540 [2022-01-31 11:35:44,126 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:35:44,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 159 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 171 Invalid, 0 Unknown, 184 Unchecked, 0.1s Time] [2022-01-31 11:35:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-31 11:35:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2022-01-31 11:35:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 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:35:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-01-31 11:35:44,138 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 41 [2022-01-31 11:35:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:44,138 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-01-31 11:35:44,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 2.022727272727273) internal successors, (89), 43 states have internal predecessors, (89), 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:35:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-01-31 11:35:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 11:35:44,139 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:44,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:35:44,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 11:35:44,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:35:44,340 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:44,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1242422827, now seen corresponding path program 2 times [2022-01-31 11:35:44,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:44,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996115812] [2022-01-31 11:35:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:44,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:35:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:44,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:35:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:35:44,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:44,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996115812] [2022-01-31 11:35:44,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996115812] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:35:44,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615408914] [2022-01-31 11:35:44,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:35:44,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:35:44,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:44,421 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:35:44,422 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:35:44,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:35:44,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:35:44,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:35:44,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:35:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:35:44,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:35:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:35:44,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615408914] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:35:44,682 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:35:44,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-01-31 11:35:44,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180268157] [2022-01-31 11:35:44,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:35:44,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:35:44,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:44,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:35:44,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:35:44,684 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 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:35:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:45,054 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-01-31 11:35:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:35:45,056 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 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 43 [2022-01-31 11:35:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:45,057 INFO L225 Difference]: With dead ends: 85 [2022-01-31 11:35:45,057 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 11:35:45,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-01-31 11:35:45,058 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 133 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:35:45,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 74 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:35:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 11:35:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-01-31 11:35:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 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:35:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-01-31 11:35:45,062 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 43 [2022-01-31 11:35:45,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:45,062 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-01-31 11:35:45,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 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:35:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-01-31 11:35:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 11:35:45,063 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:45,063 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-01-31 11:35:45,082 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:35:45,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 11:35:45,264 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:45,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:45,264 INFO L85 PathProgramCache]: Analyzing trace with hash -357451593, now seen corresponding path program 3 times [2022-01-31 11:35:45,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:45,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8132546] [2022-01-31 11:35:45,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:45,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:47,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:35:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:35:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:35:47,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:47,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8132546] [2022-01-31 11:35:47,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8132546] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:35:47,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474403972] [2022-01-31 11:35:47,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:35:47,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:35:47,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:47,708 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:35:47,709 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:35:47,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:35:47,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:35:47,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 90 conjunts are in the unsatisfiable core [2022-01-31 11:35:47,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:35:47,818 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 11 treesize of output 7 [2022-01-31 11:35:47,840 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 11:35:47,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 27 [2022-01-31 11:35:47,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:47,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:35:48,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:48,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:48,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-31 11:35:48,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:48,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:48,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-01-31 11:35:48,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:48,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:48,519 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 11:35:48,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 60 [2022-01-31 11:35:48,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:48,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:48,995 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:35:48,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 68 [2022-01-31 11:35:49,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:49,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:49,283 INFO L353 Elim1Store]: treesize reduction 31, result has 29.5 percent of original size [2022-01-31 11:35:49,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 84 [2022-01-31 11:35:49,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:49,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:49,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:49,901 INFO L353 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-01-31 11:35:49,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 90 [2022-01-31 11:35:50,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:50,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:50,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:50,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 84 [2022-01-31 11:35:50,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:50,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:50,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:50,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:50,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2022-01-31 11:35:51,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:51,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:51,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:51,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:51,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 85 [2022-01-31 11:35:51,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:51,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:51,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:51,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:51,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 90 [2022-01-31 11:35:52,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:52,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:52,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:52,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 85 [2022-01-31 11:35:52,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:52,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:52,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:52,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 31 [2022-01-31 11:35:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:35:53,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:37:40,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_75 Int) (v_main_~i~0_72 Int) (v_ArrVal_269 Int) (v_ArrVal_278 Int) (v_ArrVal_266 Int) (v_ArrVal_276 Int) (v_ArrVal_264 Int) (~N~0 Int) (v_ArrVal_274 Int) (v_ArrVal_262 Int) (v_ArrVal_272 Int) (v_ArrVal_271 Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| c_main_~b~0.base (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset) v_ArrVal_262) (+ (* v_main_~i~0_75 4) c_main_~b~0.offset) v_ArrVal_264)))) (store .cse2 c_main_~c~0.base (store (store (select .cse2 c_main_~c~0.base) c_main_~c~0.offset v_ArrVal_266) (+ (* v_main_~i~0_72 4) c_main_~c~0.offset) v_ArrVal_269))))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_266 1)) (not (<= v_ArrVal_272 (+ (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_271)) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) v_ArrVal_271))) (not (<= v_ArrVal_269 1)) (not (<= v_ArrVal_276 (+ v_ArrVal_274 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_274)) c_main_~b~0.base) (+ 4 c_main_~b~0.offset))))) (< (+ v_main_~i~0_72 1) ~N~0) (< (+ v_main_~i~0_75 1) ~N~0) (not (<= v_main_~i~0_75 (+ c_main_~i~0 1))) (not (<= v_ArrVal_271 (+ (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset) (select .cse1 |c_main_~#sum~0.offset|)))) (not (<= v_ArrVal_262 1)) (not (<= v_main_~i~0_72 1)) (not (<= v_ArrVal_278 (+ v_ArrVal_276 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_276)) c_main_~c~0.base) c_main_~c~0.offset)))) (not (< 1 ~N~0)) (<= (+ v_ArrVal_278 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_278)) c_main_~c~0.base) (+ c_main_~c~0.offset 4))) (* 3 ~N~0)) (not (<= v_ArrVal_264 1)) (not (<= v_ArrVal_274 (+ v_ArrVal_272 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_272)) c_main_~b~0.base) c_main_~b~0.offset)))))))) is different from false [2022-01-31 11:39:48,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_75 Int) (v_main_~i~0_72 Int) (v_ArrVal_269 Int) (v_ArrVal_278 Int) (v_ArrVal_266 Int) (v_ArrVal_276 Int) (v_ArrVal_264 Int) (v_ArrVal_274 Int) (~N~0 Int) (v_ArrVal_262 Int) (v_ArrVal_261 Int) (v_ArrVal_272 Int) (v_ArrVal_271 Int)) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) v_ArrVal_261)))) (store .cse3 c_main_~b~0.base (store (store (select .cse3 c_main_~b~0.base) c_main_~b~0.offset v_ArrVal_262) (+ (* v_main_~i~0_75 4) c_main_~b~0.offset) v_ArrVal_264))))) (store .cse2 c_main_~c~0.base (store (store (select .cse2 c_main_~c~0.base) c_main_~c~0.offset v_ArrVal_266) (+ (* v_main_~i~0_72 4) c_main_~c~0.offset) v_ArrVal_269))))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_261 1)) (not (<= v_ArrVal_266 1)) (not (<= v_ArrVal_269 1)) (< (+ v_main_~i~0_72 1) ~N~0) (not (<= v_main_~i~0_75 1)) (< (+ v_main_~i~0_75 1) ~N~0) (not (<= v_ArrVal_262 1)) (not (<= v_main_~i~0_72 1)) (not (<= v_ArrVal_276 (+ v_ArrVal_274 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_274)) c_main_~b~0.base) (+ 4 c_main_~b~0.offset))))) (not (<= v_ArrVal_274 (+ v_ArrVal_272 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_272)) c_main_~b~0.base) c_main_~b~0.offset)))) (not (< 1 ~N~0)) (not (<= v_ArrVal_278 (+ v_ArrVal_276 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_276)) c_main_~c~0.base) c_main_~c~0.offset)))) (not (<= v_ArrVal_264 1)) (<= (+ v_ArrVal_278 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_278)) c_main_~c~0.base) (+ c_main_~c~0.offset 4))) (* 3 ~N~0)) (not (<= v_ArrVal_271 (+ (select .cse1 |c_main_~#sum~0.offset|) (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset)))) (not (<= v_ArrVal_272 (+ v_ArrVal_271 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_271)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))))))) is different from false [2022-01-31 11:39:56,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_75 Int) (v_ArrVal_259 Int) (v_main_~i~0_72 Int) (v_ArrVal_269 Int) (v_ArrVal_278 Int) (v_ArrVal_266 Int) (v_ArrVal_276 Int) (v_ArrVal_264 Int) (v_ArrVal_274 Int) (~N~0 Int) (v_ArrVal_262 Int) (v_ArrVal_261 Int) (v_ArrVal_272 Int) (v_ArrVal_271 Int)) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base (let ((.cse4 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset) v_ArrVal_259) (+ .cse4 c_main_~a~0.offset 4) v_ArrVal_261))))) (store .cse3 c_main_~b~0.base (store (store (select .cse3 c_main_~b~0.base) c_main_~b~0.offset v_ArrVal_262) (+ (* v_main_~i~0_75 4) c_main_~b~0.offset) v_ArrVal_264))))) (store .cse2 c_main_~c~0.base (store (store (select .cse2 c_main_~c~0.base) c_main_~c~0.offset v_ArrVal_266) (+ (* v_main_~i~0_72 4) c_main_~c~0.offset) v_ArrVal_269))))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_261 1)) (not (<= v_ArrVal_266 1)) (<= (+ v_ArrVal_278 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_278)) c_main_~c~0.base) (+ c_main_~c~0.offset 4))) (* 3 ~N~0)) (not (<= v_ArrVal_276 (+ v_ArrVal_274 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_274)) c_main_~b~0.base) (+ 4 c_main_~b~0.offset))))) (not (<= v_ArrVal_271 (+ (select .cse1 |c_main_~#sum~0.offset|) (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset)))) (not (<= v_ArrVal_269 1)) (< (+ v_main_~i~0_72 1) ~N~0) (not (<= v_main_~i~0_75 1)) (< (+ v_main_~i~0_75 1) ~N~0) (not (<= v_ArrVal_272 (+ v_ArrVal_271 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_271)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (not (<= v_ArrVal_262 1)) (not (<= v_main_~i~0_72 1)) (not (< 1 ~N~0)) (not (<= v_ArrVal_278 (+ v_ArrVal_276 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_276)) c_main_~c~0.base) c_main_~c~0.offset)))) (not (<= v_ArrVal_274 (+ v_ArrVal_272 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_272)) c_main_~b~0.base) c_main_~b~0.offset)))) (not (<= v_ArrVal_264 1)) (not (<= v_ArrVal_259 1)))))) is different from false [2022-01-31 11:39:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-31 11:39:56,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474403972] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:56,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:39:56,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33, 33] total 94 [2022-01-31 11:39:56,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251713188] [2022-01-31 11:39:56,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:56,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-01-31 11:39:56,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:56,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-01-31 11:39:56,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=7386, Unknown=79, NotChecked=540, Total=8742 [2022-01-31 11:39:56,651 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 94 states, 92 states have (on average 1.315217391304348) internal successors, (121), 91 states have internal predecessors, (121), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:40:36,781 WARN L228 SmtUtils]: Spent 9.86s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:41:06,270 WARN L228 SmtUtils]: Spent 10.33s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:41:41,316 WARN L228 SmtUtils]: Spent 9.48s on a formula simplification that was a NOOP. DAG size: 125 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:42:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:42:02,644 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-01-31 11:42:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-31 11:42:02,645 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 92 states have (on average 1.315217391304348) internal successors, (121), 91 states have internal predecessors, (121), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2022-01-31 11:42:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:42:02,646 INFO L225 Difference]: With dead ends: 115 [2022-01-31 11:42:02,646 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 11:42:02,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5545 ImplicationChecksByTransitivity, 341.0s TimeCoverageRelationStatistics Valid=1608, Invalid=14804, Unknown=112, NotChecked=768, Total=17292 [2022-01-31 11:42:02,650 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 896 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:42:02,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 322 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 340 Invalid, 0 Unknown, 896 Unchecked, 0.2s Time] [2022-01-31 11:42:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 11:42:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2022-01-31 11:42:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 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:42:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2022-01-31 11:42:02,655 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 53 [2022-01-31 11:42:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:42:02,655 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2022-01-31 11:42:02,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 92 states have (on average 1.315217391304348) internal successors, (121), 91 states have internal predecessors, (121), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:42:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-01-31 11:42:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:42:02,657 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:42:02,657 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-01-31 11:42:02,674 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:42:02,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:42:02,874 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:42:02,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:42:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1696547783, now seen corresponding path program 4 times [2022-01-31 11:42:02,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:42:02,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143212581] [2022-01-31 11:42:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:42:02,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:42:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:02,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:42:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:42:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:42:02,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:42:02,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143212581] [2022-01-31 11:42:02,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143212581] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:42:02,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650467844] [2022-01-31 11:42:02,964 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:42:02,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:42:02,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:42:02,965 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:42:02,967 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:42:03,034 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:42:03,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:42:03,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:42:03,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:42:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:42:03,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:42:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:42:03,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650467844] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:42:03,256 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:42:03,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:42:03,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154602275] [2022-01-31 11:42:03,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:42:03,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:42:03,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:42:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:42:03,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:42:03,258 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 14 states have internal predecessors, (54), 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:42:03,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:42:03,491 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-01-31 11:42:03,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:42:03,491 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 14 states have internal predecessors, (54), 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 55 [2022-01-31 11:42:03,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:42:03,493 INFO L225 Difference]: With dead ends: 144 [2022-01-31 11:42:03,493 INFO L226 Difference]: Without dead ends: 107 [2022-01-31 11:42:03,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:42:03,494 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 123 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:42:03,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 59 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:42:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-31 11:42:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2022-01-31 11:42:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 83 states have internal predecessors, (93), 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:42:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-01-31 11:42:03,502 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 55 [2022-01-31 11:42:03,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:42:03,502 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-01-31 11:42:03,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 14 states have internal predecessors, (54), 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:42:03,502 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-01-31 11:42:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 11:42:03,503 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:42:03,503 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-01-31 11:42:03,520 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:42:03,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:42:03,713 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:42:03,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:42:03,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1466703967, now seen corresponding path program 5 times [2022-01-31 11:42:03,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:42:03,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570468869] [2022-01-31 11:42:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:42:03,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:42:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:03,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:42:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:42:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 11:42:03,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:42:03,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570468869] [2022-01-31 11:42:03,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570468869] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:42:03,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326740418] [2022-01-31 11:42:03,847 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:42:03,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:42:03,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:42:03,848 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:42:03,849 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:42:04,181 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:42:04,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:42:04,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:42:04,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:42:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 11:42:04,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:42:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 11:42:04,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326740418] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:42:04,401 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:42:04,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:42:04,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113599592] [2022-01-31 11:42:04,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:42:04,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:42:04,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:42:04,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:42:04,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:42:04,403 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 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:42:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:42:04,630 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-01-31 11:42:04,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:42:04,630 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 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 59 [2022-01-31 11:42:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:42:04,631 INFO L225 Difference]: With dead ends: 78 [2022-01-31 11:42:04,631 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 11:42:04,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 11:42:04,632 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 83 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:42:04,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 61 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:42:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 11:42:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2022-01-31 11:42:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 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:42:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2022-01-31 11:42:04,635 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 59 [2022-01-31 11:42:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:42:04,636 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2022-01-31 11:42:04,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 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:42:04,636 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-01-31 11:42:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 11:42:04,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:42:04,637 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:42:04,655 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:42:04,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:42:04,848 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:42:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:42:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash -588127867, now seen corresponding path program 6 times [2022-01-31 11:42:04,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:42:04,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914307273] [2022-01-31 11:42:04,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:42:04,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:42:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:08,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:42:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:08,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:42:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:42:08,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:42:08,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914307273] [2022-01-31 11:42:08,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914307273] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:42:08,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188006427] [2022-01-31 11:42:08,898 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:42:08,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:42:08,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:42:08,899 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:42:08,899 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:42:09,038 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:42:09,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:42:09,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 129 conjunts are in the unsatisfiable core [2022-01-31 11:42:09,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:42:09,076 INFO L353 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-01-31 11:42:09,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 34 [2022-01-31 11:42:09,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:42:09,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-01-31 11:42:09,254 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-31 11:42:09,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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:42:09,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:09,420 INFO L353 Elim1Store]: treesize reduction 32, result has 28.9 percent of original size [2022-01-31 11:42:09,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 53 [2022-01-31 11:42:09,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:09,966 INFO L353 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-01-31 11:42:09,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 67 [2022-01-31 11:42:10,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:10,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:10,252 INFO L353 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-01-31 11:42:10,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 82 [2022-01-31 11:42:10,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:10,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:10,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:10,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:10,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:10,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:10,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 89 [2022-01-31 11:42:11,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 91 [2022-01-31 11:42:11,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,445 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 11:42:11,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 111 [2022-01-31 11:42:11,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:11,812 INFO L353 Elim1Store]: treesize reduction 32, result has 28.9 percent of original size [2022-01-31 11:42:11,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 13 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 126 [2022-01-31 11:42:12,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:12,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 132 [2022-01-31 11:42:13,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:13,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 133 [2022-01-31 11:42:13,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:13,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 127 [2022-01-31 11:42:14,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:14,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 132 [2022-01-31 11:42:14,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:14,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 135 [2022-01-31 11:42:15,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:15,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 135 [2022-01-31 11:42:16,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:16,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:16,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:16,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:16,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:16,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:16,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:16,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 130 [2022-01-31 11:42:17,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:17,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:17,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:17,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:17,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:17,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:17,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:17,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 131 [2022-01-31 11:42:17,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:17,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:17,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:17,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:17,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:17,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:17,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 13 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 121 [2022-01-31 11:42:18,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:18,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:18,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:18,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:18,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:18,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 14 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 42 [2022-01-31 11:42:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:42:18,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:42:50,764 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 101 [2022-01-31 11:42:50,764 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-01-31 11:42:50,766 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-31 11:42:50,785 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:42:50,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:42:50,968 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 47 more [2022-01-31 11:42:50,973 INFO L158 Benchmark]: Toolchain (without parser) took 442407.64ms. Allocated memory was 182.5MB in the beginning and 281.0MB in the end (delta: 98.6MB). Free memory was 125.3MB in the beginning and 170.9MB in the end (delta: -45.6MB). Peak memory consumption was 53.7MB. Max. memory is 8.0GB. [2022-01-31 11:42:50,973 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 11:42:50,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.28ms. Allocated memory was 182.5MB in the beginning and 233.8MB in the end (delta: 51.4MB). Free memory was 125.1MB in the beginning and 207.0MB in the end (delta: -81.9MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-01-31 11:42:50,974 INFO L158 Benchmark]: Boogie Preprocessor took 39.56ms. Allocated memory is still 233.8MB. Free memory was 207.0MB in the beginning and 204.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 11:42:50,974 INFO L158 Benchmark]: RCFGBuilder took 282.73ms. Allocated memory is still 233.8MB. Free memory was 204.9MB in the beginning and 191.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-31 11:42:50,974 INFO L158 Benchmark]: IcfgTransformer took 18.91ms. Allocated memory is still 233.8MB. Free memory was 191.2MB in the beginning and 189.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 11:42:50,974 INFO L158 Benchmark]: TraceAbstraction took 441887.04ms. Allocated memory was 233.8MB in the beginning and 281.0MB in the end (delta: 47.2MB). Free memory was 189.1MB in the beginning and 170.9MB in the end (delta: 18.3MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. [2022-01-31 11:42:50,975 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.28ms. Allocated memory was 182.5MB in the beginning and 233.8MB in the end (delta: 51.4MB). Free memory was 125.1MB in the beginning and 207.0MB in the end (delta: -81.9MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.56ms. Allocated memory is still 233.8MB. Free memory was 207.0MB in the beginning and 204.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 282.73ms. Allocated memory is still 233.8MB. Free memory was 204.9MB in the beginning and 191.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 18.91ms. Allocated memory is still 233.8MB. Free memory was 191.2MB in the beginning and 189.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 441887.04ms. Allocated memory was 233.8MB in the beginning and 281.0MB in the end (delta: 47.2MB). Free memory was 189.1MB in the beginning and 170.9MB in the end (delta: 18.3MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...