/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/s1lif.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:36:09,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:36:09,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:36:09,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:36:09,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:36:09,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:36:09,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:36:09,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:36:09,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:36:09,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:36:09,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:36:09,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:36:09,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:36:09,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:36:09,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:36:09,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:36:09,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:36:09,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:36:09,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:36:09,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:36:09,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:36:09,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:36:09,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:36:09,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:36:09,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:36:09,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:36:09,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:36:09,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:36:09,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:36:09,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:36:09,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:36:09,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:36:09,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:36:09,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:36:09,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:36:09,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:36:09,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:36:09,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:36:09,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:36:09,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:36:09,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:36:09,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:36:09,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:36:09,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:36:09,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:36:09,952 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:36:09,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:36:09,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:36:09,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:36:09,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:36:09,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:36:09,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:36:09,953 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:36:09,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:36:09,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:36:09,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:36:09,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:36:09,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:36:09,954 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:36:09,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:36:09,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:36:09,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:36:09,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:36:09,954 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:36:09,954 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:36:10,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:36:10,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:36:10,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:36:10,110 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:36:10,111 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:36:10,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s1lif.c [2022-01-31 11:36:10,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf2f76dc/7b6b92eb70004068836404192bca7404/FLAG3ae52626b [2022-01-31 11:36:10,508 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:36:10,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s1lif.c [2022-01-31 11:36:10,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf2f76dc/7b6b92eb70004068836404192bca7404/FLAG3ae52626b [2022-01-31 11:36:10,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf2f76dc/7b6b92eb70004068836404192bca7404 [2022-01-31 11:36:10,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:36:10,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:36:10,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:36:10,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:36:10,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:36:10,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:36:10" (1/1) ... [2022-01-31 11:36:10,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:36:10, skipping insertion in model container [2022-01-31 11:36:10,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:36:10" (1/1) ... [2022-01-31 11:36:10,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:36:10,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:36:11,062 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/s1lif.c[588,601] [2022-01-31 11:36:11,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:36:11,085 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:36:11,094 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/s1lif.c[588,601] [2022-01-31 11:36:11,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:36:11,114 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:36:11,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:36:11 WrapperNode [2022-01-31 11:36:11,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:36:11,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:36:11,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:36:11,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:36:11,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:36:11" (1/1) ... [2022-01-31 11:36:11,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:36:11" (1/1) ... [2022-01-31 11:36:11,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:36:11" (1/1) ... [2022-01-31 11:36:11,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:36:11" (1/1) ... [2022-01-31 11:36:11,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:36:11" (1/1) ... [2022-01-31 11:36:11,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:36:11" (1/1) ... [2022-01-31 11:36:11,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:36:11" (1/1) ... [2022-01-31 11:36:11,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:36:11,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:36:11,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:36:11,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:36:11,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:36:11" (1/1) ... [2022-01-31 11:36:11,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:36:11,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:11,162 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:36:11,164 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:36:11,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:36:11,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:36:11,202 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:36:11,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:36:11,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:36:11,203 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:36:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:36:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:36:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:36:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:36:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:36:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:36:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:36:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:36:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:36:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:36:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:36:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:36:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:36:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:36:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:36:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:36:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:36:11,251 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:36:11,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:36:11,429 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:36:11,433 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:36:11,433 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 11:36:11,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:36:11 BoogieIcfgContainer [2022-01-31 11:36:11,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:36:11,435 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:36:11,435 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:36:11,440 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:36:11,442 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:36:11" (1/1) ... [2022-01-31 11:36:11,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:36:11 BasicIcfg [2022-01-31 11:36:11,455 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:36:11,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:36:11,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:36:11,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:36:11,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:36:10" (1/4) ... [2022-01-31 11:36:11,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111bfb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:36:11, skipping insertion in model container [2022-01-31 11:36:11,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:36:11" (2/4) ... [2022-01-31 11:36:11,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111bfb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:36:11, skipping insertion in model container [2022-01-31 11:36:11,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:36:11" (3/4) ... [2022-01-31 11:36:11,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111bfb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:36:11, skipping insertion in model container [2022-01-31 11:36:11,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:36:11" (4/4) ... [2022-01-31 11:36:11,475 INFO L111 eAbstractionObserver]: Analyzing ICFG s1lif.cJordan [2022-01-31 11:36:11,478 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:36:11,478 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:36:11,518 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:36:11,522 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:36:11,522 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:36:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 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:36:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:36:11,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:11,536 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] [2022-01-31 11:36:11,537 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2015912082, now seen corresponding path program 1 times [2022-01-31 11:36:11,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:11,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751276647] [2022-01-31 11:36:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:11,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:11,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:11,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:11,716 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:36:11,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:11,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751276647] [2022-01-31 11:36:11,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751276647] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:36:11,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:36:11,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:36:11,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468214888] [2022-01-31 11:36:11,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:36:11,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:36:11,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:11,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:36:11,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:36:11,773 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:36:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:11,813 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-01-31 11:36:11,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:36:11,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-01-31 11:36:11,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:11,819 INFO L225 Difference]: With dead ends: 35 [2022-01-31 11:36:11,819 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 11:36:11,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:36:11,822 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:11,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:36:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 11:36:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-31 11:36:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:36:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-01-31 11:36:11,848 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2022-01-31 11:36:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:11,849 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-01-31 11:36:11,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:36:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-01-31 11:36:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:36:11,850 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:11,850 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] [2022-01-31 11:36:11,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:36:11,851 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:11,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:11,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1605612235, now seen corresponding path program 1 times [2022-01-31 11:36:11,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:11,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914778996] [2022-01-31 11:36:11,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:11,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:11,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:11,959 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:36:11,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:11,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914778996] [2022-01-31 11:36:11,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914778996] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:36:11,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:36:11,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:36:11,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250778498] [2022-01-31 11:36:11,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:36:11,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:36:11,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:11,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:36:11,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:36:11,962 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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:36:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:12,055 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-01-31 11:36:12,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:36:12,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 23 [2022-01-31 11:36:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:12,058 INFO L225 Difference]: With dead ends: 35 [2022-01-31 11:36:12,058 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 11:36:12,062 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:36:12,063 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:12,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 25 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:36:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 11:36:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-01-31 11:36:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:36:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-01-31 11:36:12,073 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-01-31 11:36:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:12,073 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-01-31 11:36:12,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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:36:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-01-31 11:36:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:36:12,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:12,079 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] [2022-01-31 11:36:12,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:36:12,079 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:12,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1735281572, now seen corresponding path program 1 times [2022-01-31 11:36:12,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:12,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404688721] [2022-01-31 11:36:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:12,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:12,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:36:12,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:12,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404688721] [2022-01-31 11:36:12,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404688721] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:12,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944627162] [2022-01-31 11:36:12,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:12,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:12,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:12,491 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:36:12,506 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:36:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:12,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 11:36:12,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:12,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:36:12,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:36:12,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:36:12,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-01-31 11:36:12,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-01-31 11:36:13,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-01-31 11:36:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:36:13,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:13,336 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:36:13,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-01-31 11:36:13,391 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:36:13,391 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-01-31 11:36:13,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:13,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-01-31 11:36:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:36:13,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944627162] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:13,428 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:13,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 32 [2022-01-31 11:36:13,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236818130] [2022-01-31 11:36:13,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:13,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 11:36:13,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:13,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 11:36:13,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2022-01-31 11:36:13,431 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 32 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 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:36:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:14,156 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-01-31 11:36:14,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 11:36:14,157 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 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 30 [2022-01-31 11:36:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:14,158 INFO L225 Difference]: With dead ends: 58 [2022-01-31 11:36:14,158 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 11:36:14,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=341, Invalid=1551, Unknown=0, NotChecked=0, Total=1892 [2022-01-31 11:36:14,159 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 47 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:14,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 120 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 464 Invalid, 0 Unknown, 29 Unchecked, 0.3s Time] [2022-01-31 11:36:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 11:36:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2022-01-31 11:36:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 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:36:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-01-31 11:36:14,164 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-01-31 11:36:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:14,165 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-01-31 11:36:14,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 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:36:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-01-31 11:36:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:36:14,165 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:14,165 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] [2022-01-31 11:36:14,196 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:36:14,383 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:36:14,383 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:14,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:14,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1606198853, now seen corresponding path program 1 times [2022-01-31 11:36:14,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:14,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454599733] [2022-01-31 11:36:14,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:14,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:14,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:36:14,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:14,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454599733] [2022-01-31 11:36:14,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454599733] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:14,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776039112] [2022-01-31 11:36:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:14,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:14,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:14,502 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:36:14,503 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:36:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:14,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 11:36:14,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:14,567 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:36:14,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 11:36:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:36:14,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:14,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-01-31 11:36:14,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-01-31 11:36:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:36:14,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776039112] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:14,706 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:14,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-01-31 11:36:14,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636959136] [2022-01-31 11:36:14,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:14,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 11:36:14,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:14,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 11:36:14,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 11:36:14,708 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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:36:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:14,787 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-01-31 11:36:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 11:36:14,791 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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 30 [2022-01-31 11:36:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:14,791 INFO L225 Difference]: With dead ends: 47 [2022-01-31 11:36:14,791 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 11:36:14,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-01-31 11:36:14,792 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:14,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 77 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:36:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 11:36:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-01-31 11:36:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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:36:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-01-31 11:36:14,795 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 30 [2022-01-31 11:36:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:14,796 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-01-31 11:36:14,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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:36:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-01-31 11:36:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:36:14,796 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:14,796 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] [2022-01-31 11:36:14,840 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:36:15,004 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:36:15,005 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:15,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1325106111, now seen corresponding path program 2 times [2022-01-31 11:36:15,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:15,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019675925] [2022-01-31 11:36:15,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:15,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:15,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:36:15,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:15,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019675925] [2022-01-31 11:36:15,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019675925] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:15,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374676846] [2022-01-31 11:36:15,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:36:15,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:15,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:15,054 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:36:15,055 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:36:15,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:36:15,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:15,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:36:15,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:36:15,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:36:15,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374676846] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:15,190 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:15,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:36:15,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299947664] [2022-01-31 11:36:15,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:15,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:36:15,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:15,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:36:15,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:36:15,192 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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:36:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:15,299 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-01-31 11:36:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:36:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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 32 [2022-01-31 11:36:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:15,303 INFO L225 Difference]: With dead ends: 63 [2022-01-31 11:36:15,303 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 11:36:15,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:36:15,306 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:15,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 65 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:36:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 11:36:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-01-31 11:36:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:36:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-31 11:36:15,316 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2022-01-31 11:36:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:15,317 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-31 11:36:15,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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:36:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-31 11:36:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:36:15,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:15,318 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] [2022-01-31 11:36:15,335 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:36:15,535 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:36:15,535 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:15,535 INFO L85 PathProgramCache]: Analyzing trace with hash -366582984, now seen corresponding path program 3 times [2022-01-31 11:36:15,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:15,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674408465] [2022-01-31 11:36:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:15,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:15,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:15,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:36:15,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:15,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674408465] [2022-01-31 11:36:15,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674408465] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:15,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203949557] [2022-01-31 11:36:15,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:36:15,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:15,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:15,614 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:36:15,628 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:36:15,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:36:15,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:15,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:36:15,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:36:15,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:36:15,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203949557] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:15,780 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:15,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:36:15,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945755351] [2022-01-31 11:36:15,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:15,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:36:15,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:15,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:36:15,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:36:15,781 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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:36:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:15,902 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-01-31 11:36:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:36:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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 32 [2022-01-31 11:36:15,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:15,905 INFO L225 Difference]: With dead ends: 41 [2022-01-31 11:36:15,907 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 11:36:15,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 11:36:15,910 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:15,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 62 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:36:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 11:36:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-01-31 11:36:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 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:36:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-01-31 11:36:15,918 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-01-31 11:36:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:15,918 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-01-31 11:36:15,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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:36:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-01-31 11:36:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 11:36:15,919 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:15,919 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 11:36:15,946 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:36:16,138 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:36:16,138 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:16,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:16,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1933376935, now seen corresponding path program 4 times [2022-01-31 11:36:16,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:16,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708892409] [2022-01-31 11:36:16,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:16,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:16,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:16,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:36:16,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:16,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708892409] [2022-01-31 11:36:16,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708892409] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:16,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808676293] [2022-01-31 11:36:16,895 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:36:16,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:16,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:16,912 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:36:16,939 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:36:17,001 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:36:17,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:17,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-31 11:36:17,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:17,044 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:36:17,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:17,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:36:17,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:17,130 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:36:17,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:17,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 11:36:17,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:17,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:17,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-01-31 11:36:17,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:17,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:17,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:17,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-01-31 11:36:17,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:17,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 11:36:17,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:17,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-01-31 11:36:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:36:17,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:18,765 INFO L353 Elim1Store]: treesize reduction 52, result has 41.6 percent of original size [2022-01-31 11:36:18,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 554 treesize of output 290 [2022-01-31 11:36:18,846 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-31 11:36:18,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:18,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 68 [2022-01-31 11:36:18,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse5 (+ c_main_~a~0.offset 4))) (or (not (= 2 (select v_arrayElimArr_4 c_main_~a~0.offset))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse0 (* (- 1) .cse4)) (.cse1 (* (- 1) (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 2 .cse4))) c_main_~a~0.base) .cse5)))) (and (<= (div (+ (- 2) .cse0 .cse1) (- 2)) (+ c_main_~i~0 1)) (<= (+ c_main_~i~0 2) (div (+ (- 3) .cse0 .cse1) (- 2)))))))) (not (= (+ (- 1) (select v_arrayElimArr_4 .cse5)) 1))))) is different from false [2022-01-31 11:36:19,011 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse5 (+ c_main_~a~0.offset 4))) (or (not (= 2 (select v_arrayElimArr_4 c_main_~a~0.offset))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse0 (* (- 1) .cse4)) (.cse1 (* (- 1) (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 2 .cse4))) c_main_~a~0.base) .cse5)))) (and (<= (+ c_main_~i~0 3) (div (+ (- 3) .cse0 .cse1) (- 2))) (<= (div (+ (- 2) .cse0 .cse1) (- 2)) (+ c_main_~i~0 2))))))) (not (= (+ (- 1) (select v_arrayElimArr_4 .cse5)) 1))))) is different from false [2022-01-31 11:36:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-31 11:36:19,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808676293] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:19,064 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:19,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 55 [2022-01-31 11:36:19,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037200690] [2022-01-31 11:36:19,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:19,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-01-31 11:36:19,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-01-31 11:36:19,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=2408, Unknown=2, NotChecked=206, Total=2970 [2022-01-31 11:36:19,066 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 52 states have internal predecessors, (73), 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:36:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:23,534 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-01-31 11:36:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 11:36:23,535 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 52 states have internal predecessors, (73), 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 37 [2022-01-31 11:36:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:23,544 INFO L225 Difference]: With dead ends: 73 [2022-01-31 11:36:23,545 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 11:36:23,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=536, Invalid=3630, Unknown=2, NotChecked=254, Total=4422 [2022-01-31 11:36:23,546 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 52 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:23,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 180 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 852 Invalid, 0 Unknown, 151 Unchecked, 0.6s Time] [2022-01-31 11:36:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 11:36:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-01-31 11:36:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 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:36:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-01-31 11:36:23,549 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 37 [2022-01-31 11:36:23,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:23,549 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-01-31 11:36:23,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 52 states have internal predecessors, (73), 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:36:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-01-31 11:36:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 11:36:23,550 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:23,550 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 11:36:23,571 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:36:23,766 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:36:23,767 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:23,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:23,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1856031736, now seen corresponding path program 1 times [2022-01-31 11:36:23,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:23,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528104453] [2022-01-31 11:36:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:23,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:23,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:36:23,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:23,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528104453] [2022-01-31 11:36:23,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528104453] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:23,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551630651] [2022-01-31 11:36:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:23,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:23,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:23,909 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:36:23,911 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:36:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:23,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 11:36:23,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:23,991 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 13 treesize of output 9 [2022-01-31 11:36:24,033 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:36:24,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:36:24,079 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 11:36:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:36:24,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:24,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-01-31 11:36:24,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-01-31 11:36:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:36:24,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551630651] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:24,287 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:24,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 19 [2022-01-31 11:36:24,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133058543] [2022-01-31 11:36:24,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:24,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 11:36:24,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 11:36:24,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:36:24,288 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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:36:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:24,590 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-01-31 11:36:24,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:36:24,590 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-01-31 11:36:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:24,591 INFO L225 Difference]: With dead ends: 59 [2022-01-31 11:36:24,591 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 11:36:24,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-01-31 11:36:24,591 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:24,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 97 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:36:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 11:36:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-01-31 11:36:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 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:36:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-01-31 11:36:24,594 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 37 [2022-01-31 11:36:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:24,594 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-01-31 11:36:24,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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:36:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-01-31 11:36:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:36:24,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:24,595 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2022-01-31 11:36:24,618 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:36:24,807 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:36:24,807 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -65976708, now seen corresponding path program 5 times [2022-01-31 11:36:24,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:24,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635332214] [2022-01-31 11:36:24,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:24,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:24,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:24,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:36:24,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:24,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635332214] [2022-01-31 11:36:24,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635332214] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:24,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755033856] [2022-01-31 11:36:24,946 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:36:24,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:24,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:24,947 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:36:24,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 11:36:25,058 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:36:25,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:25,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:36:25,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:36:25,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:36:25,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755033856] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:25,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:25,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:36:25,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587057960] [2022-01-31 11:36:25,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:25,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:36:25,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:25,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:36:25,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:36:25,221 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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:36:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:25,412 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-01-31 11:36:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:36:25,413 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 11:36:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:25,413 INFO L225 Difference]: With dead ends: 77 [2022-01-31 11:36:25,413 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 11:36:25,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 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:36:25,414 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:25,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 61 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:36:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 11:36:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-01-31 11:36:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 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:36:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-01-31 11:36:25,416 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 39 [2022-01-31 11:36:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:25,416 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-01-31 11:36:25,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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:36:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-01-31 11:36:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:36:25,417 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:25,417 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2022-01-31 11:36:25,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-31 11:36:25,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:25,629 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:25,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:25,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1588667389, now seen corresponding path program 6 times [2022-01-31 11:36:25,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:25,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672533820] [2022-01-31 11:36:25,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:25,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:25,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:25,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:36:25,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:25,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672533820] [2022-01-31 11:36:25,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672533820] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:25,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077960819] [2022-01-31 11:36:25,739 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:36:25,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:25,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:25,755 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:36:25,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 11:36:25,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:36:25,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:25,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:36:25,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:36:25,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:36:25,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077960819] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:25,959 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:25,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:36:25,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375132175] [2022-01-31 11:36:25,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:25,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:36:25,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:25,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:36:25,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:36:25,960 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 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:36:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:26,096 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-01-31 11:36:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:36:26,096 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 11:36:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:26,097 INFO L225 Difference]: With dead ends: 48 [2022-01-31 11:36:26,097 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 11:36:26,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 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:36:26,097 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 68 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:26,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 70 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:36:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 11:36:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-01-31 11:36:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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:36:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-01-31 11:36:26,099 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 39 [2022-01-31 11:36:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:26,100 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-01-31 11:36:26,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 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:36:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-01-31 11:36:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:36:26,100 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:26,100 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 11:36:26,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 11:36:26,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 11:36:26,316 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:26,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash 347994970, now seen corresponding path program 7 times [2022-01-31 11:36:26,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:26,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010387560] [2022-01-31 11:36:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:26,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:27,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:36:27,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:27,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010387560] [2022-01-31 11:36:27,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010387560] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:27,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697141280] [2022-01-31 11:36:27,349 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:36:27,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:27,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:27,364 INFO L229 MonitoredProcess]: Starting monitored process 10 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:36:27,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 11:36:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:27,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 75 conjunts are in the unsatisfiable core [2022-01-31 11:36:27,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:27,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:36:27,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:36:27,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:36:27,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:36:27,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:36:27,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 11:36:27,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:27,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-01-31 11:36:28,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:28,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:28,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:28,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-01-31 11:36:28,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:28,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:28,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:28,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:28,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:28,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2022-01-31 11:36:28,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:28,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:28,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:28,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:28,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 56 [2022-01-31 11:36:28,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2022-01-31 11:36:28,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 32 [2022-01-31 11:36:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:36:28,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:31,527 INFO L353 Elim1Store]: treesize reduction 476, result has 26.2 percent of original size [2022-01-31 11:36:31,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 6 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 39 case distinctions, treesize of input 26144 treesize of output 8286 [2022-01-31 11:36:32,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2022-01-31 11:36:32,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 55 [2022-01-31 11:36:32,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 161 [2022-01-31 11:36:32,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 159 [2022-01-31 11:36:32,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:36:32,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-01-31 11:36:34,428 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse0 (+ c_main_~a~0.offset 8)) (.cse1 (+ c_main_~a~0.offset 4))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= 2 (select v_arrayElimArr_6 c_main_~a~0.offset))) (not (= (+ (- 1) (select v_arrayElimArr_6 .cse1)) 1)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 2))) c_main_~a~0.base) .cse1))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 2 .cse4))) c_main_~a~0.base) .cse0))) (and (<= (div (+ .cse2 .cse3 .cse4 1) 2) c_main_~i~0) (<= (+ c_main_~i~0 1) (div (+ .cse2 2 .cse3 .cse4) 2))))))))))) is different from false [2022-01-31 11:36:36,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse0 (+ c_main_~a~0.offset 8)) (.cse6 (+ c_main_~a~0.offset 4))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= 2 (select v_arrayElimArr_6 c_main_~a~0.offset))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 2))) c_main_~a~0.base) .cse6))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 2 .cse3))) c_main_~a~0.base) .cse0))) (and (<= (div (+ .cse1 .cse2 .cse3 1) 2) (+ c_main_~i~0 1)) (<= (+ c_main_~i~0 2) (div (+ .cse1 2 .cse2 .cse3) 2)))))))) (not (= (+ (- 1) (select v_arrayElimArr_6 .cse6)) 1))))) is different from false [2022-01-31 11:36:39,475 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse0 (+ c_main_~a~0.offset 8)) (.cse1 (+ c_main_~a~0.offset 4))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= 2 (select v_arrayElimArr_6 c_main_~a~0.offset))) (not (= (+ (- 1) (select v_arrayElimArr_6 .cse1)) 1)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 2))) c_main_~a~0.base) .cse1))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 2 .cse4))) c_main_~a~0.base) .cse0))) (and (<= (div (+ .cse2 .cse3 .cse4 1) 2) (+ c_main_~i~0 2)) (<= (+ c_main_~i~0 3) (div (+ .cse2 2 .cse3 .cse4) 2))))))))))) is different from false [2022-01-31 11:36:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-31 11:36:39,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697141280] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:39,761 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:39,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 71 [2022-01-31 11:36:39,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559153502] [2022-01-31 11:36:39,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:39,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-01-31 11:36:39,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:39,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-01-31 11:36:39,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=4023, Unknown=3, NotChecked=402, Total=4970 [2022-01-31 11:36:39,763 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 71 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 68 states have internal predecessors, (97), 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:38:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:38:10,260 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2022-01-31 11:38:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-31 11:38:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 68 states have internal predecessors, (97), 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 44 [2022-01-31 11:38:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:38:10,261 INFO L225 Difference]: With dead ends: 89 [2022-01-31 11:38:10,262 INFO L226 Difference]: Without dead ends: 85 [2022-01-31 11:38:10,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 102 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 94.0s TimeCoverageRelationStatistics Valid=1145, Invalid=8944, Unknown=23, NotChecked=600, Total=10712 [2022-01-31 11:38:10,264 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 97 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-01-31 11:38:10,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 233 Invalid, 1875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1308 Invalid, 0 Unknown, 259 Unchecked, 6.9s Time] [2022-01-31 11:38:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-31 11:38:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2022-01-31 11:38:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 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:38:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-01-31 11:38:10,269 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 44 [2022-01-31 11:38:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:38:10,269 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-01-31 11:38:10,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 68 states have internal predecessors, (97), 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:38:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-01-31 11:38:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:38:10,270 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:38:10,270 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:38:10,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-31 11:38:10,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:38:10,473 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:38:10,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:38:10,473 INFO L85 PathProgramCache]: Analyzing trace with hash -162539207, now seen corresponding path program 2 times [2022-01-31 11:38:10,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:38:10,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182021945] [2022-01-31 11:38:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:38:10,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:38:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:11,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:38:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:11,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:38:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:38:11,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:38:11,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182021945] [2022-01-31 11:38:11,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182021945] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:38:11,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110830790] [2022-01-31 11:38:11,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:38:11,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:38:11,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:38:11,615 INFO L229 MonitoredProcess]: Starting monitored process 11 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:38:11,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 11:38:11,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:38:11,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:38:11,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:38:11,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:38:12,108 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 13 treesize of output 9 [2022-01-31 11:38:12,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:12,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:38:12,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:12,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:38:12,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 11:38:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:38:13,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:38:14,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-01-31 11:38:14,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-01-31 11:38:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:38:14,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110830790] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:38:14,401 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:38:14,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2022-01-31 11:38:14,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668204886] [2022-01-31 11:38:14,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:38:14,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:38:14,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:38:14,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:38:14,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2022-01-31 11:38:14,402 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 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:38:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:38:18,226 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2022-01-31 11:38:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:38:18,226 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 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 44 [2022-01-31 11:38:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:38:18,227 INFO L225 Difference]: With dead ends: 71 [2022-01-31 11:38:18,227 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 11:38:18,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=247, Invalid=1393, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 11:38:18,228 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 46 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:38:18,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 148 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 11:38:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 11:38:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-01-31 11:38:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 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:38:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-01-31 11:38:18,230 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 44 [2022-01-31 11:38:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:38:18,230 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-01-31 11:38:18,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 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:38:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-01-31 11:38:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 11:38:18,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:38:18,231 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2022-01-31 11:38:18,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 11:38:18,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 11:38:18,432 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:38:18,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:38:18,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1899103037, now seen corresponding path program 8 times [2022-01-31 11:38:18,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:38:18,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342605651] [2022-01-31 11:38:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:38:18,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:38:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:38:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:18,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:38:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:38:18,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:38:18,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342605651] [2022-01-31 11:38:18,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342605651] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:38:18,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240777941] [2022-01-31 11:38:18,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:38:18,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:38:18,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:38:18,965 INFO L229 MonitoredProcess]: Starting monitored process 12 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:38:18,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 11:38:19,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:38:19,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:38:19,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:38:19,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:38:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:38:19,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:38:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:38:20,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240777941] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:38:20,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:38:20,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:38:20,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72128132] [2022-01-31 11:38:20,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:38:20,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:38:20,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:38:20,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:38:20,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:38:20,182 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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:38:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:38:21,883 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-01-31 11:38:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:38:21,884 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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 46 [2022-01-31 11:38:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:38:21,884 INFO L225 Difference]: With dead ends: 82 [2022-01-31 11:38:21,884 INFO L226 Difference]: Without dead ends: 62 [2022-01-31 11:38:21,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 11:38:21,885 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 77 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:38:21,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 62 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 11:38:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-31 11:38:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-01-31 11:38:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 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:38:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-01-31 11:38:21,887 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 46 [2022-01-31 11:38:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:38:21,887 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-01-31 11:38:21,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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:38:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-01-31 11:38:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 11:38:21,888 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:38:21,888 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2022-01-31 11:38:21,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-01-31 11:38:22,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 11:38:22,088 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:38:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:38:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2111057532, now seen corresponding path program 9 times [2022-01-31 11:38:22,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:38:22,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859261394] [2022-01-31 11:38:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:38:22,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:38:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:38:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:22,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:38:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:38:22,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:38:22,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859261394] [2022-01-31 11:38:22,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859261394] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:38:22,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595911706] [2022-01-31 11:38:22,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:38:22,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:38:22,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:38:22,660 INFO L229 MonitoredProcess]: Starting monitored process 13 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:38:22,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 11:38:22,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:38:22,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:38:22,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:38:22,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:38:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:38:23,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:38:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:38:23,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595911706] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:38:23,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:38:23,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:38:23,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855761491] [2022-01-31 11:38:23,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:38:23,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:38:23,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:38:23,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:38:23,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:38:23,993 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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:38:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:38:25,587 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-01-31 11:38:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:38:25,588 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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 49 [2022-01-31 11:38:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:38:25,588 INFO L225 Difference]: With dead ends: 55 [2022-01-31 11:38:25,588 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 11:38:25,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:38:25,589 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 102 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:38:25,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 50 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 11:38:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 11:38:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-01-31 11:38:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:38:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-01-31 11:38:25,591 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 49 [2022-01-31 11:38:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:38:25,591 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-01-31 11:38:25,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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:38:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-01-31 11:38:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 11:38:25,591 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:38:25,591 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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:38:25,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 11:38:25,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 11:38:25,792 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:38:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:38:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash 981661415, now seen corresponding path program 10 times [2022-01-31 11:38:25,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:38:25,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89137920] [2022-01-31 11:38:25,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:38:25,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:38:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:36,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:38:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:36,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:38:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:36,183 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:38:36,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:38:36,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89137920] [2022-01-31 11:38:36,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89137920] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:38:36,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422806035] [2022-01-31 11:38:36,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:38:36,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:38:36,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:38:36,189 INFO L229 MonitoredProcess]: Starting monitored process 14 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:38:36,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 11:38:36,255 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:38:36,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:38:36,257 WARN L261 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 92 conjunts are in the unsatisfiable core [2022-01-31 11:38:36,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:38:36,293 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:38:36,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:36,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:38:36,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:36,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:38:37,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:37,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:38:37,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:37,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:38:39,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:39,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 11:38:40,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:40,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:40,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-01-31 11:38:41,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:41,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:41,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:41,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:41,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2022-01-31 11:38:42,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:42,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:42,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:42,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:42,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:42,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:42,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:42,697 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 0 case distinctions, treesize of input 65 treesize of output 61 [2022-01-31 11:38:43,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:43,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:43,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:43,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:43,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:43,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:43,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:43,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:43,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:43,769 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2022-01-31 11:38:44,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:44,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:44,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:44,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:44,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:44,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:44,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:44,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:44,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:44,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:44,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:44,748 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2022-01-31 11:38:45,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:45,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:45,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:45,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:45,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:45,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:45,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:45,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:45,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:45,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:45,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:45,700 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2022-01-31 11:38:46,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:46,658 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 0 case distinctions, treesize of input 65 treesize of output 57 [2022-01-31 11:38:47,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:47,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2022-01-31 11:38:48,024 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:38:48,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:39:12,265 WARN L228 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 793 DAG size of output: 324 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-31 11:39:12,266 INFO L353 Elim1Store]: treesize reduction 3907, result has 18.3 percent of original size [2022-01-31 11:39:12,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 23 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 27 new quantified variables, introduced 190 case distinctions, treesize of input 13998198 treesize of output 3283632 [2022-01-31 11:39:20,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 39 [2022-01-31 11:39:20,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:20,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 39 [2022-01-31 11:39:21,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 49 treesize of output 35 [2022-01-31 11:39:21,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 [2022-01-31 11:39:21,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 49 treesize of output 35 [2022-01-31 11:39:21,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 39 [2022-01-31 11:39:21,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 [2022-01-31 11:39:21,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 [2022-01-31 11:39:21,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 [2022-01-31 11:39:21,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:21,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7871 treesize of output 7577 [2022-01-31 11:39:22,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 49 treesize of output 35 [2022-01-31 11:39:22,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 39 [2022-01-31 11:39:22,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 49 treesize of output 35 [2022-01-31 11:39:22,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 662 treesize of output 500 [2022-01-31 11:39:22,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 31 [2022-01-31 11:39:22,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 31 [2022-01-31 11:39:22,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 31 [2022-01-31 11:39:22,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 31 [2022-01-31 11:39:22,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 31 [2022-01-31 11:39:22,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 348 treesize of output 306 [2022-01-31 11:39:22,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 109 treesize of output 71 [2022-01-31 11:39:22,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 treesize of output 23 [2022-01-31 11:39:22,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:39:22,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 47 treesize of output 29 [2022-01-31 11:39:23,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_24 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ c_main_~a~0.offset 12)) (.cse2 (select v_arrayElimArr_24 c_main_~a~0.offset)) (.cse7 (+ c_main_~a~0.offset 8)) (.cse8 (+ c_main_~a~0.offset 4))) (or (not (= (+ (- 1) (select v_arrayElimArr_24 .cse0)) 1)) (= (+ (* 2 ~N~0) 1) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_24))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse6))) c_main_~a~0.base) .cse8))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse6))) c_main_~a~0.base) .cse7))) (+ .cse1 .cse2 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse6))) c_main_~a~0.base) .cse0) .cse6 1))))))) (not (= (+ (- 1) .cse2) 1)) (not (= (select v_arrayElimArr_24 .cse7) 2)) (< (+ c_main_~i~0 1) ~N~0) (not (= (select v_arrayElimArr_24 .cse8) 2)) (not (< c_main_~i~0 ~N~0))))) is different from false [2022-01-31 11:39:23,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_24 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ c_main_~a~0.offset 12)) (.cse2 (select v_arrayElimArr_24 c_main_~a~0.offset)) (.cse7 (+ c_main_~a~0.offset 8)) (.cse8 (+ c_main_~a~0.offset 4))) (or (not (= (+ (- 1) (select v_arrayElimArr_24 .cse0)) 1)) (= (+ (* 2 ~N~0) 1) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_24))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse6))) c_main_~a~0.base) .cse8))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse6))) c_main_~a~0.base) .cse7))) (+ .cse1 .cse2 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse6))) c_main_~a~0.base) .cse0) .cse6 1))))))) (not (= (+ (- 1) .cse2) 1)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= (select v_arrayElimArr_24 .cse7) 2)) (not (= (select v_arrayElimArr_24 .cse8) 2)) (< (+ c_main_~i~0 2) ~N~0)))) is different from false [2022-01-31 11:39:23,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_24 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ c_main_~a~0.offset 12)) (.cse2 (select v_arrayElimArr_24 c_main_~a~0.offset)) (.cse7 (+ c_main_~a~0.offset 8)) (.cse8 (+ c_main_~a~0.offset 4))) (or (not (= (+ (- 1) (select v_arrayElimArr_24 .cse0)) 1)) (< (+ c_main_~i~0 3) ~N~0) (= (+ (* 2 ~N~0) 1) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_24))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse6))) c_main_~a~0.base) .cse8))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse6))) c_main_~a~0.base) .cse7))) (+ .cse1 .cse2 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse6))) c_main_~a~0.base) .cse0) .cse6 1))))))) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= (+ (- 1) .cse2) 1)) (not (= (select v_arrayElimArr_24 .cse7) 2)) (not (= (select v_arrayElimArr_24 .cse8) 2))))) is different from false [2022-01-31 11:39:24,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_24 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ c_main_~a~0.offset 12)) (.cse2 (select v_arrayElimArr_24 c_main_~a~0.offset)) (.cse7 (+ c_main_~a~0.offset 8)) (.cse8 (+ c_main_~a~0.offset 4))) (or (< (+ c_main_~i~0 4) ~N~0) (not (= (+ (- 1) (select v_arrayElimArr_24 .cse0)) 1)) (= (+ (* 2 ~N~0) 1) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_24))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse6))) c_main_~a~0.base) .cse8))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse6))) c_main_~a~0.base) .cse7))) (+ .cse1 .cse2 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse6))) c_main_~a~0.base) .cse0) .cse6 1))))))) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= (+ (- 1) .cse2) 1)) (not (= (select v_arrayElimArr_24 .cse7) 2)) (not (= (select v_arrayElimArr_24 .cse8) 2))))) is different from false [2022-01-31 11:39:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-01-31 11:39:24,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422806035] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:24,645 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:39:24,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 32] total 92 [2022-01-31 11:39:24,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336655974] [2022-01-31 11:39:24,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:24,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-01-31 11:39:24,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-01-31 11:39:24,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=794, Invalid=6874, Unknown=4, NotChecked=700, Total=8372 [2022-01-31 11:39:24,648 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 92 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 89 states have internal predecessors, (118), 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:06,216 WARN L228 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 225 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:40:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:40:07,664 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-01-31 11:40:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 11:40:07,666 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 89 states have internal predecessors, (118), 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 51 [2022-01-31 11:40:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:40:07,666 INFO L225 Difference]: With dead ends: 96 [2022-01-31 11:40:07,666 INFO L226 Difference]: Without dead ends: 92 [2022-01-31 11:40:07,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 104 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4043 ImplicationChecksByTransitivity, 64.5s TimeCoverageRelationStatistics Valid=1069, Invalid=9245, Unknown=4, NotChecked=812, Total=11130 [2022-01-31 11:40:07,669 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 55 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:40:07,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 293 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1885 Invalid, 0 Unknown, 270 Unchecked, 10.6s Time] [2022-01-31 11:40:07,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-31 11:40:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2022-01-31 11:40:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 65 states have internal predecessors, (72), 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:40:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2022-01-31 11:40:07,671 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 51 [2022-01-31 11:40:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:40:07,671 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2022-01-31 11:40:07,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 89 states have internal predecessors, (118), 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:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-01-31 11:40:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 11:40:07,672 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:40:07,672 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:40:07,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 11:40:07,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 11:40:07,872 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:40:07,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:40:07,873 INFO L85 PathProgramCache]: Analyzing trace with hash -15410938, now seen corresponding path program 3 times [2022-01-31 11:40:07,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:40:07,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771362929] [2022-01-31 11:40:07,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:40:07,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:40:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:40:09,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:40:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:40:09,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:40:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:40:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:40:09,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:40:09,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771362929] [2022-01-31 11:40:09,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771362929] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:40:09,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369832987] [2022-01-31 11:40:09,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:40:09,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:40:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:40:09,132 INFO L229 MonitoredProcess]: Starting monitored process 15 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:40:09,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 11:40:09,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:40:09,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:40:09,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 11:40:09,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:40:09,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 11:40:10,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:10,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:40:10,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:10,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:40:11,111 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-31 11:40:11,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-01-31 11:40:12,015 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-31 11:40:12,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2022-01-31 11:40:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:40:12,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:40:15,031 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_213 Int) (main_~i~0 Int) (v_ArrVal_701 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_213)) (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (<= (+ 2 v_main_~i~0_213) c_~N~0))) is different from false [2022-01-31 11:40:17,275 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_213 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int) (v_main_~i~0_215 Int)) (or (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_699) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (<= (+ 2 v_main_~i~0_213) c_~N~0) (not (<= (+ v_main_~i~0_215 1) v_main_~i~0_213)))) is different from false [2022-01-31 11:40:19,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_216 Int)) (or (not (<= v_main_~i~0_216 (+ c_main_~i~0 1))) (forall ((v_main_~i~0_213 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int) (v_main_~i~0_215 Int)) (or (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_216)) v_ArrVal_699) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (<= (+ 2 v_main_~i~0_213) c_~N~0) (not (<= (+ v_main_~i~0_215 1) v_main_~i~0_213)))))) is different from false [2022-01-31 11:40:21,819 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_main_~i~0_213 Int) (v_main_~i~0_216 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int) (v_main_~i~0_215 Int)) (or (not (<= v_main_~i~0_216 (+ c_main_~i~0 1))) (not (< v_main_~i~0_213 c_~N~0)) (<= (+ 2 v_main_~i~0_213) c_~N~0) (not (<= (+ v_main_~i~0_215 1) v_main_~i~0_213)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_698) (+ c_main_~a~0.offset (* 4 v_main_~i~0_216)) v_ArrVal_699) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1))) is different from false [2022-01-31 11:40:24,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_217 Int)) (or (forall ((v_ArrVal_698 Int) (v_main_~i~0_213 Int) (v_main_~i~0_216 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int) (v_main_~i~0_215 Int)) (or (not (<= v_main_~i~0_216 (+ v_main_~i~0_217 1))) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_217) c_main_~a~0.offset) v_ArrVal_698) (+ c_main_~a~0.offset (* 4 v_main_~i~0_216)) v_ArrVal_699) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (not (< v_main_~i~0_213 c_~N~0)) (<= (+ 2 v_main_~i~0_213) c_~N~0) (not (<= (+ v_main_~i~0_215 1) v_main_~i~0_213)))) (not (<= v_main_~i~0_217 0)))) is different from false [2022-01-31 11:40:41,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-01-31 11:40:41,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1838 treesize of output 1814 [2022-01-31 11:40:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 20 not checked. [2022-01-31 11:40:43,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369832987] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:40:43,196 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:40:43,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 41 [2022-01-31 11:40:43,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132502143] [2022-01-31 11:40:43,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:40:43,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-31 11:40:43,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:40:43,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-31 11:40:43,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1018, Unknown=11, NotChecked=360, Total=1640 [2022-01-31 11:40:43,197 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 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:41:08,281 WARN L228 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:41:18,202 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~a~0.offset 0) (exists ((v_main_~i~0_203 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_203) c_main_~a~0.offset)) 1) (<= 3 v_main_~i~0_203) (<= c_~N~0 (+ v_main_~i~0_203 1)) (< v_main_~i~0_203 c_~N~0))) (forall ((v_main_~i~0_217 Int)) (or (forall ((v_ArrVal_698 Int) (v_main_~i~0_213 Int) (v_main_~i~0_216 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int) (v_main_~i~0_215 Int)) (or (not (<= v_main_~i~0_216 (+ v_main_~i~0_217 1))) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_217) c_main_~a~0.offset) v_ArrVal_698) (+ c_main_~a~0.offset (* 4 v_main_~i~0_216)) v_ArrVal_699) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (not (< v_main_~i~0_213 c_~N~0)) (<= (+ 2 v_main_~i~0_213) c_~N~0) (not (<= (+ v_main_~i~0_215 1) v_main_~i~0_213)))) (not (<= v_main_~i~0_217 0))))) is different from false [2022-01-31 11:41:20,214 WARN L838 $PredicateComparison]: unable to prove that (and (or (< 4 c_~N~0) (= 1 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_~N~0 4) (- 4))))) (forall ((v_ArrVal_698 Int) (v_main_~i~0_213 Int) (v_main_~i~0_216 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int) (v_main_~i~0_215 Int)) (or (not (<= v_main_~i~0_216 (+ c_main_~i~0 1))) (not (< v_main_~i~0_213 c_~N~0)) (<= (+ 2 v_main_~i~0_213) c_~N~0) (not (<= (+ v_main_~i~0_215 1) v_main_~i~0_213)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_698) (+ c_main_~a~0.offset (* 4 v_main_~i~0_216)) v_ArrVal_699) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1))) (= c_main_~i~0 0) (<= c_main_~i~0 0) (= c_main_~a~0.offset 0) (exists ((v_main_~i~0_203 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_203) c_main_~a~0.offset)) 1) (<= 3 v_main_~i~0_203) (<= c_~N~0 (+ v_main_~i~0_203 1)) (< v_main_~i~0_203 c_~N~0))) (<= 4 c_~N~0)) is different from false [2022-01-31 11:41:22,223 WARN L838 $PredicateComparison]: unable to prove that (and (or (< 4 c_~N~0) (= 1 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_~N~0 4) (- 4))))) (= c_main_~i~0 0) (<= c_main_~i~0 0) (= c_main_~a~0.offset 0) (exists ((v_main_~i~0_203 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_203) c_main_~a~0.offset)) 1) (<= 3 v_main_~i~0_203) (<= c_~N~0 (+ v_main_~i~0_203 1)) (< v_main_~i~0_203 c_~N~0))) (<= 4 c_~N~0) (forall ((v_main_~i~0_216 Int)) (or (not (<= v_main_~i~0_216 (+ c_main_~i~0 1))) (forall ((v_main_~i~0_213 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int) (v_main_~i~0_215 Int)) (or (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_216)) v_ArrVal_699) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (<= (+ 2 v_main_~i~0_213) c_~N~0) (not (<= (+ v_main_~i~0_215 1) v_main_~i~0_213))))))) is different from false [2022-01-31 11:41:24,231 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~i~0 1) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_213 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int) (v_main_~i~0_215 Int)) (or (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_699) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (<= (+ 2 v_main_~i~0_213) c_~N~0) (not (<= (+ v_main_~i~0_215 1) v_main_~i~0_213)))) (exists ((v_main_~i~0_203 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_203) c_main_~a~0.offset)) 1) (<= 3 v_main_~i~0_203) (<= c_~N~0 (+ v_main_~i~0_203 1)) (< v_main_~i~0_203 c_~N~0)))) is different from false [2022-01-31 11:41:26,242 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~i~0 3))) (and (<= .cse0 c_~N~0) (or (< .cse0 c_~N~0) (= 1 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_~N~0 4) (- 4))))) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_213 Int) (main_~i~0 Int) (v_ArrVal_701 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_213)) (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (<= (+ 2 v_main_~i~0_213) c_~N~0))) (exists ((v_main_~i~0_203 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_203) c_main_~a~0.offset)) 1) (<= 3 v_main_~i~0_203) (<= c_~N~0 (+ v_main_~i~0_203 1)) (< v_main_~i~0_203 c_~N~0))))) is different from false [2022-01-31 11:41:28,250 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~i~0 2))) (and (<= .cse0 c_~N~0) (= c_main_~a~0.offset 0) (or (< .cse0 c_~N~0) (= 1 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_~N~0 4) (- 4))))) (forall ((v_main_~i~0_213 Int) (main_~i~0 Int) (v_ArrVal_701 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_213)) (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (<= (+ 2 v_main_~i~0_213) c_~N~0))) (exists ((v_main_~i~0_203 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_203) c_main_~a~0.offset)) 1) (<= 3 v_main_~i~0_203) (<= c_~N~0 (+ v_main_~i~0_203 1)) (< v_main_~i~0_203 c_~N~0))))) is different from false [2022-01-31 11:41:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:31,552 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-01-31 11:41:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-31 11:41:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 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 51 [2022-01-31 11:41:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:31,553 INFO L225 Difference]: With dead ends: 83 [2022-01-31 11:41:31,553 INFO L226 Difference]: Without dead ends: 83 [2022-01-31 11:41:31,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 76.9s TimeCoverageRelationStatistics Valid=392, Invalid=1695, Unknown=27, NotChecked=1078, Total=3192 [2022-01-31 11:41:31,554 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:31,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 110 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 295 Invalid, 0 Unknown, 235 Unchecked, 1.3s Time] [2022-01-31 11:41:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-31 11:41:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-01-31 11:41:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 70 states have internal predecessors, (79), 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:41:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2022-01-31 11:41:31,556 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 51 [2022-01-31 11:41:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:31,556 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2022-01-31 11:41:31,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 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:41:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-01-31 11:41:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 11:41:31,556 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:31,556 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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:41:31,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-31 11:41:31,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:31,771 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash 967200650, now seen corresponding path program 11 times [2022-01-31 11:41:31,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:31,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288274582] [2022-01-31 11:41:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:31,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:32,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:32,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:41:32,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:32,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288274582] [2022-01-31 11:41:32,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288274582] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:41:32,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791737722] [2022-01-31 11:41:32,732 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:41:32,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:32,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:32,733 INFO L229 MonitoredProcess]: Starting monitored process 16 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:41:32,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 11:41:32,889 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 11:41:32,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:32,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:41:32,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:41:33,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:41:34,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791737722] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:34,160 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:41:34,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 11:41:34,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722806644] [2022-01-31 11:41:34,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:34,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:41:34,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:34,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:41:34,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:41:34,161 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 20 states have internal predecessors, (70), 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:41:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:36,032 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-01-31 11:41:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:41:36,032 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 20 states have internal predecessors, (70), 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 53 [2022-01-31 11:41:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:36,033 INFO L225 Difference]: With dead ends: 117 [2022-01-31 11:41:36,033 INFO L226 Difference]: Without dead ends: 91 [2022-01-31 11:41:36,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:41:36,033 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 111 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:36,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 60 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 11:41:36,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-31 11:41:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2022-01-31 11:41:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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:41:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-01-31 11:41:36,035 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 53 [2022-01-31 11:41:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:36,035 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-01-31 11:41:36,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 20 states have internal predecessors, (70), 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:41:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-01-31 11:41:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 11:41:36,036 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:36,036 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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:41:36,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-31 11:41:36,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 11:41:36,237 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:36,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:36,237 INFO L85 PathProgramCache]: Analyzing trace with hash -315397749, now seen corresponding path program 12 times [2022-01-31 11:41:36,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:36,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400868798] [2022-01-31 11:41:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:36,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:37,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:41:37,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:37,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400868798] [2022-01-31 11:41:37,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400868798] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:41:37,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154969367] [2022-01-31 11:41:37,024 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:41:37,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:37,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:37,026 INFO L229 MonitoredProcess]: Starting monitored process 17 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:41:37,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-31 11:41:37,121 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 11:41:37,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:37,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:41:37,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:41:38,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:41:38,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154969367] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:38,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:41:38,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 11:41:38,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915307855] [2022-01-31 11:41:38,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:38,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:41:38,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:41:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:41:38,678 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 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:41:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:40,714 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-01-31 11:41:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 11:41:40,715 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 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 53 [2022-01-31 11:41:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:40,715 INFO L225 Difference]: With dead ends: 72 [2022-01-31 11:41:40,715 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 11:41:40,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 11:41:40,716 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 123 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:40,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 56 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 11:41:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 11:41:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2022-01-31 11:41:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 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:41:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-01-31 11:41:40,717 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 53 [2022-01-31 11:41:40,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:40,718 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-01-31 11:41:40,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 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:41:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-01-31 11:41:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 11:41:40,718 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:40,718 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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:41:40,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 11:41:40,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-31 11:41:40,931 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:40,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash -151111848, now seen corresponding path program 13 times [2022-01-31 11:41:40,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:40,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247347901] [2022-01-31 11:41:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:40,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:52,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:41:52,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247347901] [2022-01-31 11:41:52,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247347901] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:41:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210892109] [2022-01-31 11:41:52,433 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:41:52,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:52,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:52,438 INFO L229 MonitoredProcess]: Starting monitored process 18 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:41:52,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-31 11:41:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:52,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 113 conjunts are in the unsatisfiable core [2022-01-31 11:41:52,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:52,557 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:41:52,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:41:52,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:41:52,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:41:53,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:41:53,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:41:54,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:41:55,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 11:41:57,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:57,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2022-01-31 11:41:58,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:58,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:58,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:58,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2022-01-31 11:41:59,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,947 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 0 case distinctions, treesize of input 71 treesize of output 63 [2022-01-31 11:42:01,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2022-01-31 11:42:02,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:02,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:02,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:02,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:02,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:02,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:02,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:02,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:02,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:02,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:02,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:02,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:02,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2022-01-31 11:42:03,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:03,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:03,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 80 [2022-01-31 11:42:04,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:04,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:04,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2022-01-31 11:42:06,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:06,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:06,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:06,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:06,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:06,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:06,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:06,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:06,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:42:06,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:06,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:06,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:06,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 94 [2022-01-31 11:42:07,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 67 [2022-01-31 11:42:08,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 38 [2022-01-31 11:42:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:42:09,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:35,396 WARN L228 SmtUtils]: Spent 1.74m on a formula simplification. DAG size of input: 4992 DAG size of output: 1730 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-31 11:44:35,401 INFO L353 Elim1Store]: treesize reduction 32760, result has 13.4 percent of original size [2022-01-31 11:44:35,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 106 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 111 new quantified variables, introduced 1070 case distinctions, treesize of input 382250167504 treesize of output 66947246016