/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/s2lif.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:37:49,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:37:49,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:37:49,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:37:49,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:37:49,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:37:49,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:37:49,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:37:49,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:37:49,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:37:49,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:37:49,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:37:49,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:37:49,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:37:49,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:37:49,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:37:49,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:37:49,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:37:49,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:37:49,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:37:49,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:37:49,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:37:49,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:37:49,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:37:49,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:37:49,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:37:49,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:37:49,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:37:49,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:37:49,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:37:49,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:37:49,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:37:49,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:37:49,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:37:49,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:37:49,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:37:49,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:37:49,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:37:49,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:37:49,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:37:49,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:37:49,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:37:49,870 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:37:49,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:37:49,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:37:49,872 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:37:49,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:37:49,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:37:49,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:37:49,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:37:49,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:37:49,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:37:49,874 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:37:49,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:37:49,874 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:37:49,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:37:49,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:37:49,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:37:49,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:37:49,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:37:49,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:37:49,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:37:49,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:37:49,875 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:37:49,875 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:37:50,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:37:50,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:37:50,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:37:50,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:37:50,090 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:37:50,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s2lif.c [2022-01-31 11:37:50,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12e4fd85/06eaa1b8bd8241e28172675ddee8be2d/FLAGbaf21873e [2022-01-31 11:37:50,442 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:37:50,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s2lif.c [2022-01-31 11:37:50,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12e4fd85/06eaa1b8bd8241e28172675ddee8be2d/FLAGbaf21873e [2022-01-31 11:37:50,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12e4fd85/06eaa1b8bd8241e28172675ddee8be2d [2022-01-31 11:37:50,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:37:50,868 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:37:50,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:37:50,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:37:50,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:37:50,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:37:50" (1/1) ... [2022-01-31 11:37:50,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11293ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:37:50, skipping insertion in model container [2022-01-31 11:37:50,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:37:50" (1/1) ... [2022-01-31 11:37:50,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:37:50,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:37:51,057 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/s2lif.c[588,601] [2022-01-31 11:37:51,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:37:51,074 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:37:51,084 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/s2lif.c[588,601] [2022-01-31 11:37:51,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:37:51,099 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:37:51,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:37:51 WrapperNode [2022-01-31 11:37:51,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:37:51,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:37:51,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:37:51,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:37:51,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:37:51" (1/1) ... [2022-01-31 11:37:51,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:37:51" (1/1) ... [2022-01-31 11:37:51,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:37:51" (1/1) ... [2022-01-31 11:37:51,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:37:51" (1/1) ... [2022-01-31 11:37:51,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:37:51" (1/1) ... [2022-01-31 11:37:51,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:37:51" (1/1) ... [2022-01-31 11:37:51,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:37:51" (1/1) ... [2022-01-31 11:37:51,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:37:51,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:37:51,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:37:51,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:37:51,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:37:51" (1/1) ... [2022-01-31 11:37:51,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:37:51,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:37:51,189 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:37:51,207 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:37:51,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:37:51,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:37:51,221 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:37:51,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:37:51,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:37:51,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:37:51,222 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:37:51,222 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:37:51,222 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:37:51,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:37:51,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:37:51,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:37:51,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:37:51,223 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:37:51,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:37:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:37:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:37:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:37:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:37:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:37:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:37:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:37:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:37:51,291 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:37:51,293 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:37:51,428 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:37:51,440 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:37:51,441 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 11:37:51,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:37:51 BoogieIcfgContainer [2022-01-31 11:37:51,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:37:51,442 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:37:51,442 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:37:51,443 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:37:51,445 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:37:51" (1/1) ... [2022-01-31 11:37:51,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:37:51 BasicIcfg [2022-01-31 11:37:51,457 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:37:51,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:37:51,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:37:51,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:37:51,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:37:50" (1/4) ... [2022-01-31 11:37:51,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576c4746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:37:51, skipping insertion in model container [2022-01-31 11:37:51,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:37:51" (2/4) ... [2022-01-31 11:37:51,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576c4746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:37:51, skipping insertion in model container [2022-01-31 11:37:51,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:37:51" (3/4) ... [2022-01-31 11:37:51,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576c4746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:37:51, skipping insertion in model container [2022-01-31 11:37:51,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:37:51" (4/4) ... [2022-01-31 11:37:51,479 INFO L111 eAbstractionObserver]: Analyzing ICFG s2lif.cJordan [2022-01-31 11:37:51,482 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:37:51,482 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:37:51,544 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:37:51,548 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:37:51,548 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:37:51,558 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:37:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:37:51,563 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:37:51,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:37:51,563 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:37:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:37:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2015912082, now seen corresponding path program 1 times [2022-01-31 11:37:51,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:37:51,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858314936] [2022-01-31 11:37:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:37:51,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:37:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:37:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:51,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:37:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:51,768 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:37:51,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:37:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858314936] [2022-01-31 11:37:51,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858314936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:37:51,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:37:51,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:37:51,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014808390] [2022-01-31 11:37:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:37:51,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:37:51,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:37:51,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:37:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:37:51,795 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:37:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:37:51,848 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-01-31 11:37:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:37:51,850 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:37:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:37:51,858 INFO L225 Difference]: With dead ends: 35 [2022-01-31 11:37:51,859 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 11:37:51,860 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:37:51,866 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:37:51,867 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:37:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 11:37:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-31 11:37:51,889 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:37:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-01-31 11:37:51,891 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2022-01-31 11:37:51,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:37:51,891 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-01-31 11:37:51,891 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:37:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-01-31 11:37:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:37:51,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:37:51,893 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:37:51,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:37:51,894 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:37:51,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:37:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1605612235, now seen corresponding path program 1 times [2022-01-31 11:37:51,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:37:51,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823365921] [2022-01-31 11:37:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:37:51,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:37:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:51,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:37:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:51,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:37:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:51,994 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:37:51,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:37:51,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823365921] [2022-01-31 11:37:51,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823365921] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:37:51,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:37:51,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:37:51,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730830670] [2022-01-31 11:37:51,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:37:51,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:37:51,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:37:51,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:37:51,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:37:51,997 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:37:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:37:52,051 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-01-31 11:37:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:37:52,052 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:37:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:37:52,053 INFO L225 Difference]: With dead ends: 35 [2022-01-31 11:37:52,053 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 11:37:52,053 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:37:52,054 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:37:52,054 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.0s Time] [2022-01-31 11:37:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 11:37:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-01-31 11:37:52,057 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:37:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-01-31 11:37:52,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-01-31 11:37:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:37:52,058 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-01-31 11:37:52,058 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:37:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-01-31 11:37:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:37:52,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:37:52,059 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:37:52,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:37:52,060 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:37:52,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:37:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1735281572, now seen corresponding path program 1 times [2022-01-31 11:37:52,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:37:52,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60225530] [2022-01-31 11:37:52,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:37:52,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:37:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:37:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:52,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:37:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:52,579 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:37:52,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:37:52,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60225530] [2022-01-31 11:37:52,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60225530] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:37:52,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426168603] [2022-01-31 11:37:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:37:52,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:37:52,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:37:52,581 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:37:52,582 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:37:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:52,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 11:37:52,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:37:52,726 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:37:52,746 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:37:52,791 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:37:52,938 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:37:53,043 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 36 treesize of output 23 [2022-01-31 11:37:53,102 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 10 [2022-01-31 11:37:53,137 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:37:53,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:37:53,390 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:37:53,391 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:37:53,431 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:37:53,432 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:37:53,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:37:53,435 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:37:53,469 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:37:53,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426168603] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:37:53,470 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:37:53,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 34 [2022-01-31 11:37:53,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362310615] [2022-01-31 11:37:53,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:37:53,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 11:37:53,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:37:53,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 11:37:53,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 11:37:53,472 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 34 states, 32 states have (on average 1.8125) internal successors, (58), 31 states have internal predecessors, (58), 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:37:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:37:54,015 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-01-31 11:37:54,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:37:54,016 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.8125) internal successors, (58), 31 states have internal predecessors, (58), 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:37:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:37:54,017 INFO L225 Difference]: With dead ends: 59 [2022-01-31 11:37:54,017 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 11:37:54,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 11:37:54,018 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:37:54,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 117 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 428 Invalid, 0 Unknown, 45 Unchecked, 0.3s Time] [2022-01-31 11:37:54,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 11:37:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2022-01-31 11:37:54,021 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:37:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-01-31 11:37:54,022 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-01-31 11:37:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:37:54,022 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-01-31 11:37:54,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.8125) internal successors, (58), 31 states have internal predecessors, (58), 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:37:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-01-31 11:37:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:37:54,023 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:37:54,023 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:37:54,040 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:37:54,240 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:37:54,240 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:37:54,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:37:54,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1606198853, now seen corresponding path program 1 times [2022-01-31 11:37:54,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:37:54,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237645922] [2022-01-31 11:37:54,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:37:54,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:37:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:37:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:37:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:54,336 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:37:54,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:37:54,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237645922] [2022-01-31 11:37:54,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237645922] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:37:54,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244295427] [2022-01-31 11:37:54,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:37:54,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:37:54,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:37:54,338 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:37:54,339 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:37:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:54,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 11:37:54,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:37:54,405 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:37:54,426 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:37:54,441 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:37:54,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:37:54,477 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:37:54,486 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:37:54,513 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:37:54,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244295427] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:37:54,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:37:54,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-01-31 11:37:54,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435834259] [2022-01-31 11:37:54,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:37:54,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 11:37:54,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:37:54,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 11:37:54,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 11:37:54,517 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:37:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:37:54,582 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-01-31 11:37:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 11:37:54,586 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:37:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:37:54,590 INFO L225 Difference]: With dead ends: 47 [2022-01-31 11:37:54,590 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 11:37:54,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-01-31 11:37:54,592 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:37:54,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 67 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:37:54,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 11:37:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-01-31 11:37:54,595 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:37:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-01-31 11:37:54,596 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 30 [2022-01-31 11:37:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:37:54,596 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-01-31 11:37:54,596 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:37:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-01-31 11:37:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:37:54,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:37:54,597 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:37:54,613 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:37:54,813 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:37:54,813 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:37:54,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:37:54,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1325106111, now seen corresponding path program 2 times [2022-01-31 11:37:54,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:37:54,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954066683] [2022-01-31 11:37:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:37:54,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:37:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:54,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:37:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:54,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:37:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:54,875 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:37:54,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:37:54,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954066683] [2022-01-31 11:37:54,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954066683] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:37:54,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292071197] [2022-01-31 11:37:54,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:37:54,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:37:54,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:37:54,877 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:37:54,878 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:37:54,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:37:54,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:37:54,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:37:54,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:37:55,001 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:37:55,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:37:55,049 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:37:55,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292071197] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:37:55,050 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:37:55,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:37:55,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19948014] [2022-01-31 11:37:55,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:37:55,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:37:55,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:37:55,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:37:55,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:37:55,051 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:37:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:37:55,166 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-01-31 11:37:55,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:37:55,166 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:37:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:37:55,168 INFO L225 Difference]: With dead ends: 63 [2022-01-31 11:37:55,168 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 11:37:55,168 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:37:55,169 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:37:55,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 47 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:37:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 11:37:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-01-31 11:37:55,172 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:37:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-31 11:37:55,173 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2022-01-31 11:37:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:37:55,173 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-31 11:37:55,173 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:37:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-31 11:37:55,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:37:55,174 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:37:55,174 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:37:55,192 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:37:55,393 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:37:55,393 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:37:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:37:55,394 INFO L85 PathProgramCache]: Analyzing trace with hash -366582984, now seen corresponding path program 3 times [2022-01-31 11:37:55,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:37:55,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713249328] [2022-01-31 11:37:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:37:55,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:37:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:55,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:37:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:37:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:55,444 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:37:55,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:37:55,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713249328] [2022-01-31 11:37:55,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713249328] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:37:55,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145880230] [2022-01-31 11:37:55,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:37:55,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:37:55,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:37:55,455 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:37:55,456 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:37:55,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:37:55,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:37:55,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:37:55,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:37:55,573 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:37:55,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:37:55,628 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:37:55,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145880230] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:37:55,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:37:55,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:37:55,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549490337] [2022-01-31 11:37:55,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:37:55,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:37:55,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:37:55,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:37:55,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:37:55,629 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:37:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:37:55,762 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-01-31 11:37:55,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:37:55,763 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:37:55,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:37:55,763 INFO L225 Difference]: With dead ends: 41 [2022-01-31 11:37:55,763 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 11:37:55,763 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:37:55,764 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 63 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:37:55,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 49 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:37:55,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 11:37:55,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-01-31 11:37:55,766 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:37:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-01-31 11:37:55,766 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-01-31 11:37:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:37:55,767 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-01-31 11:37:55,767 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:37:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-01-31 11:37:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 11:37:55,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:37:55,767 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:37:55,786 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:37:55,983 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:37:55,984 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:37:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:37:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1933376935, now seen corresponding path program 4 times [2022-01-31 11:37:55,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:37:55,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220958474] [2022-01-31 11:37:55,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:37:55,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:37:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:56,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:37:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:37:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:37:56,763 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:37:56,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:37:56,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220958474] [2022-01-31 11:37:56,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220958474] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:37:56,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789261859] [2022-01-31 11:37:56,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:37:56,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:37:56,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:37:56,765 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:37:56,799 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:37:56,812 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:37:56,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:37:56,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-31 11:37:56,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:37:56,839 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:37:56,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:37:56,871 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:37:56,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:37:56,919 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:37:57,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:37:57,123 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:37:57,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:37:57,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:37:57,272 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:37:57,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:37:57,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:37:57,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:37:57,418 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:37:57,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:37:57,518 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:37:57,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:37:57,609 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 49 treesize of output 21 [2022-01-31 11:37:57,662 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:37:57,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:37:58,449 INFO L353 Elim1Store]: treesize reduction 52, result has 41.6 percent of original size [2022-01-31 11:37:58,449 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:37:58,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:37:58,493 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 21 treesize of output 15 [2022-01-31 11:37:58,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 c_main_~a~0.offset)) (.cse5 (+ c_main_~a~0.offset 4))) (or (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse0 .cse1))) c_main_~a~0.base) .cse5))) (and (<= (div (+ (- 1) .cse0 .cse1 .cse2) 3) c_main_~i~0) (<= (+ c_main_~i~0 1) (div (+ .cse0 .cse1 .cse2) 3))))))) (not (= (+ (- 2) .cse1) 1)) (not (= (+ (- 2) (select v_arrayElimArr_4 .cse5)) 1))))) is different from false [2022-01-31 11:37:58,601 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 c_main_~a~0.offset)) (.cse5 (+ c_main_~a~0.offset 4))) (or (not (= (+ (- 2) .cse0) 1)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse0))) c_main_~a~0.base) .cse5))) (and (<= (+ c_main_~i~0 2) (div (+ .cse1 .cse0 .cse2) 3)) (<= (div (+ (- 1) .cse1 .cse0 .cse2) 3) (+ c_main_~i~0 1))))))) (not (= (+ (- 2) (select v_arrayElimArr_4 .cse5)) 1))))) is different from false [2022-01-31 11:37:58,668 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:37:58,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789261859] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:37:58,668 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:37:58,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 56 [2022-01-31 11:37:58,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956244339] [2022-01-31 11:37:58,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:37:58,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-31 11:37:58,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:37:58,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-31 11:37:58,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2504, Unknown=2, NotChecked=210, Total=3080 [2022-01-31 11:37:58,670 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 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:01,462 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse1 (select .cse9 c_main_~a~0.offset))) (let ((.cse8 (store .cse9 c_main_~a~0.offset (+ .cse1 2))) (.cse6 (+ c_main_~a~0.offset 4))) (let ((.cse0 (select .cse8 .cse6))) (or (not (= .cse0 1)) (not (= .cse1 1)) (< c_main_~i~0 c_~N~0) (= (let ((.cse7 (store .cse8 .cse6 (+ .cse0 2)))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse7))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse7 c_main_~a~0.offset)) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (+ .cse2 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) .cse6)))))) (* c_~N~0 3))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_4 c_main_~a~0.offset)) (.cse15 (+ c_main_~a~0.offset 4))) (or (not (= (+ (- 2) .cse10) 1)) (let ((.cse13 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_4))) (let ((.cse14 (select .cse13 |c_main_~#sum~0.base|))) (let ((.cse11 (select .cse14 |c_main_~#sum~0.offset|))) (let ((.cse12 (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ .cse11 .cse10))) c_main_~a~0.base) .cse15))) (and (<= (+ c_main_~i~0 2) (div (+ .cse11 .cse10 .cse12) 3)) (<= (div (+ (- 1) .cse11 .cse10 .cse12) 3) (+ c_main_~i~0 1))))))) (not (= (+ (- 2) (select v_arrayElimArr_4 .cse15)) 1)))))) is different from false [2022-01-31 11:38:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:38:04,302 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-01-31 11:38:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 11:38:04,303 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 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:38:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:38:04,303 INFO L225 Difference]: With dead ends: 74 [2022-01-31 11:38:04,303 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 11:38:04,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=554, Invalid=3615, Unknown=3, NotChecked=384, Total=4556 [2022-01-31 11:38:04,305 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:38:04,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 183 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 879 Invalid, 0 Unknown, 134 Unchecked, 1.2s Time] [2022-01-31 11:38:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 11:38:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2022-01-31 11:38:04,308 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:38:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-01-31 11:38:04,308 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 37 [2022-01-31 11:38:04,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:38:04,308 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-01-31 11:38:04,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 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:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-01-31 11:38:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 11:38:04,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:38:04,309 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:38:04,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-31 11:38:04,523 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:38:04,523 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:38:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:38:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1856031736, now seen corresponding path program 1 times [2022-01-31 11:38:04,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:38:04,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562642402] [2022-01-31 11:38:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:38:04,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:38:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:04,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:38:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:04,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:38:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:04,827 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:38:04,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:38:04,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562642402] [2022-01-31 11:38:04,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562642402] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:38:04,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773924424] [2022-01-31 11:38:04,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:38:04,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:38:04,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:38:04,828 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:38:04,829 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:38:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:04,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 11:38:04,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:38:04,942 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:05,037 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:38:05,037 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:38:05,099 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:38:05,151 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:38:05,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:38:05,317 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:05,320 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:05,355 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:38:05,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773924424] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:38:05,355 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:38:05,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 19 [2022-01-31 11:38:05,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329814584] [2022-01-31 11:38:05,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:38:05,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 11:38:05,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:38:05,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 11:38:05,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:38:05,357 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:38:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:38:05,863 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-01-31 11:38:05,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:38:05,863 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:38:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:38:05,865 INFO L225 Difference]: With dead ends: 59 [2022-01-31 11:38:05,865 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 11:38:05,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-01-31 11:38:05,866 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:38:05,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:38:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 11:38:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-01-31 11:38:05,876 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:38:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-01-31 11:38:05,876 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 37 [2022-01-31 11:38:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:38:05,876 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-01-31 11:38:05,876 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:38:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-01-31 11:38:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:38:05,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:38:05,877 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:38:05,894 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:38:06,089 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:38:06,089 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:38:06,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:38:06,090 INFO L85 PathProgramCache]: Analyzing trace with hash -65976708, now seen corresponding path program 5 times [2022-01-31 11:38:06,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:38:06,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169420234] [2022-01-31 11:38:06,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:38:06,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:38:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:38:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:06,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:38:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:06,220 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:38:06,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:38:06,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169420234] [2022-01-31 11:38:06,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169420234] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:38:06,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708966823] [2022-01-31 11:38:06,220 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:38:06,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:38:06,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:38:06,221 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:38:06,222 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:38:06,285 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:38:06,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:38:06,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:38:06,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:38:06,471 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:38:06,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:38:06,587 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:38:06,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708966823] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:38:06,588 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:38:06,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:38:06,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393162481] [2022-01-31 11:38:06,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:38:06,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:38:06,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:38:06,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:38:06,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:38:06,589 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:38:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:38:06,987 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-01-31 11:38:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:38:06,988 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:38:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:38:06,988 INFO L225 Difference]: With dead ends: 77 [2022-01-31 11:38:06,988 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 11:38:06,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:38:06,989 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 61 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:38:06,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 71 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:38:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 11:38:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-01-31 11:38:06,993 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:38:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-01-31 11:38:06,994 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 39 [2022-01-31 11:38:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:38:06,994 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-01-31 11:38:06,994 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:38:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-01-31 11:38:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:38:06,994 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:38:06,994 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:38:07,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 11:38:07,199 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:38:07,200 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:38:07,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:38:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1588667389, now seen corresponding path program 6 times [2022-01-31 11:38:07,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:38:07,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904872792] [2022-01-31 11:38:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:38:07,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:38:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:38:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:38:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:07,322 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:38:07,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:38:07,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904872792] [2022-01-31 11:38:07,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904872792] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:38:07,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202815627] [2022-01-31 11:38:07,322 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:38:07,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:38:07,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:38:07,323 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:38:07,324 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:38:07,420 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:38:07,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:38:07,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:38:07,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:38:07,561 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:38:07,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:38:07,647 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:38:07,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202815627] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:38:07,647 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:38:07,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:38:07,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467063679] [2022-01-31 11:38:07,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:38:07,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:38:07,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:38:07,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:38:07,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:38:07,649 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:38:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:38:07,895 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-01-31 11:38:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:38:07,896 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:38:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:38:07,896 INFO L225 Difference]: With dead ends: 48 [2022-01-31 11:38:07,896 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 11:38:07,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 11:38:07,897 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:38:07,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 56 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:38:07,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 11:38:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-01-31 11:38:07,905 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:38:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-01-31 11:38:07,906 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 39 [2022-01-31 11:38:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:38:07,906 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-01-31 11:38:07,906 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:38:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-01-31 11:38:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:38:07,908 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:38:07,910 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:38:07,926 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:38:08,126 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:38:08,126 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:38:08,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:38:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash 347994970, now seen corresponding path program 7 times [2022-01-31 11:38:08,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:38:08,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708681198] [2022-01-31 11:38:08,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:38:08,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:38:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:09,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:38:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:09,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:38:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:09,836 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:38:09,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:38:09,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708681198] [2022-01-31 11:38:09,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708681198] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:38:09,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518557604] [2022-01-31 11:38:09,837 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:38:09,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:38:09,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:38:09,844 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:38:09,844 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:38:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:38:09,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 75 conjunts are in the unsatisfiable core [2022-01-31 11:38:09,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:38:09,917 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:38:09,924 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:38:09,969 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:10,016 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:10,081 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:10,446 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:10,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:10,708 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:38:11,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:11,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:11,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:11,019 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:38:11,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:11,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:11,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:11,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:11,286 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 58 treesize of output 51 [2022-01-31 11:38:11,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:11,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:11,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:11,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:11,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:38:11,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:11,481 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 62 treesize of output 49 [2022-01-31 11:38:11,621 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 50 treesize of output 43 [2022-01-31 11:38:11,727 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 44 treesize of output 20 [2022-01-31 11:38:11,842 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:38:11,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:38:15,997 INFO L353 Elim1Store]: treesize reduction 476, result has 26.2 percent of original size [2022-01-31 11:38:15,998 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 51972 treesize of output 16128 [2022-01-31 11:38:16,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,195 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:38:16,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,223 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:38:16,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,238 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 487 treesize of output 445 [2022-01-31 11:38:16,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,393 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:38:16,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:38:16,406 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 163 treesize of output 137 [2022-01-31 11:38:19,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int))) (let ((.cse1 (+ c_main_~a~0.offset 8)) (.cse0 (+ c_main_~a~0.offset 4))) (or (not (= 3 (select v_arrayElimArr_7 c_main_~a~0.offset))) (not (= (+ (- 2) (select v_arrayElimArr_7 .cse0)) 1)) (not (= (+ (select v_arrayElimArr_7 .cse1) (- 2)) 1)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_7))) (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 3))) c_main_~a~0.base) .cse0))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 3 .cse4))) c_main_~a~0.base) .cse1))) (and (<= (div (+ .cse2 2 .cse3 .cse4) 3) c_main_~i~0) (<= (+ c_main_~i~0 1) (div (+ .cse2 3 .cse3 .cse4) 3))))))))))) is different from false [2022-01-31 11:38:22,518 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int))) (let ((.cse1 (+ c_main_~a~0.offset 8)) (.cse0 (+ c_main_~a~0.offset 4))) (or (not (= 3 (select v_arrayElimArr_7 c_main_~a~0.offset))) (not (= (+ (- 2) (select v_arrayElimArr_7 .cse0)) 1)) (not (= (+ (select v_arrayElimArr_7 .cse1) (- 2)) 1)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_7))) (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 3))) c_main_~a~0.base) .cse0))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 3 .cse4))) c_main_~a~0.base) .cse1))) (and (<= (div (+ .cse2 2 .cse3 .cse4) 3) (+ c_main_~i~0 1)) (<= (+ c_main_~i~0 2) (div (+ .cse2 3 .cse3 .cse4) 3))))))))))) is different from false [2022-01-31 11:38:25,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int))) (let ((.cse1 (+ c_main_~a~0.offset 8)) (.cse0 (+ c_main_~a~0.offset 4))) (or (not (= 3 (select v_arrayElimArr_7 c_main_~a~0.offset))) (not (= (+ (- 2) (select v_arrayElimArr_7 .cse0)) 1)) (not (= (+ (select v_arrayElimArr_7 .cse1) (- 2)) 1)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_7))) (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 3))) c_main_~a~0.base) .cse0))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 3 .cse4))) c_main_~a~0.base) .cse1))) (and (<= (div (+ .cse2 2 .cse3 .cse4) 3) (+ c_main_~i~0 2)) (<= (+ c_main_~i~0 3) (div (+ .cse2 3 .cse3 .cse4) 3))))))))))) is different from false [2022-01-31 11:38:26,219 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:38:26,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518557604] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:38:26,219 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:38:26,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 26] total 68 [2022-01-31 11:38:26,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734773227] [2022-01-31 11:38:26,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:38:26,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-31 11:38:26,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:38:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-31 11:38:26,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=3676, Unknown=3, NotChecked=384, Total=4556 [2022-01-31 11:38:26,221 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 68 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 65 states have internal predecessors, (88), 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:39:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:40,198 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-01-31 11:39:40,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 11:39:40,199 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 65 states have internal predecessors, (88), 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:39:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:40,200 INFO L225 Difference]: With dead ends: 84 [2022-01-31 11:39:40,200 INFO L226 Difference]: Without dead ends: 80 [2022-01-31 11:39:40,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1941 ImplicationChecksByTransitivity, 81.2s TimeCoverageRelationStatistics Valid=771, Invalid=5539, Unknown=22, NotChecked=474, Total=6806 [2022-01-31 11:39:40,201 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 59 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:40,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 221 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1232 Invalid, 0 Unknown, 257 Unchecked, 7.1s Time] [2022-01-31 11:39:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-31 11:39:40,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2022-01-31 11:39:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 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:39:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-01-31 11:39:40,204 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 44 [2022-01-31 11:39:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:40,204 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-01-31 11:39:40,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 65 states have internal predecessors, (88), 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:39:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-01-31 11:39:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:39:40,204 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:40,205 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:39:40,221 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:39:40,415 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:39:40,415 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash -162539207, now seen corresponding path program 2 times [2022-01-31 11:39:40,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:40,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644776269] [2022-01-31 11:39:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:40,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:41,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:39:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:41,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:39:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:41,518 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:39:41,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:39:41,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644776269] [2022-01-31 11:39:41,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644776269] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:39:41,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321509080] [2022-01-31 11:39:41,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:39:41,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:39:41,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:39:41,520 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:39:41,524 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:39:41,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:39:41,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:39:41,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:39:41,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:39:41,997 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:39:42,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:42,374 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:39:42,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:42,609 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:39:42,795 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:39:42,995 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:39:42,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:39:44,198 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:39:44,209 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:39:44,544 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:39:44,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321509080] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:44,545 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:39:44,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2022-01-31 11:39:44,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385838369] [2022-01-31 11:39:44,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:44,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:39:44,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:44,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:39:44,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2022-01-31 11:39:44,547 INFO L87 Difference]: Start difference. First operand 64 states and 71 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:39:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:48,180 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-01-31 11:39:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:39:48,180 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:39:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:48,181 INFO L225 Difference]: With dead ends: 72 [2022-01-31 11:39:48,181 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 11:39:48,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=247, Invalid=1393, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 11:39:48,182 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:48,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 124 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 11:39:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 11:39:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-01-31 11:39:48,184 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:39:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-01-31 11:39:48,184 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 44 [2022-01-31 11:39:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:48,184 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-01-31 11:39:48,184 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:39:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-01-31 11:39:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 11:39:48,185 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:48,185 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:39:48,201 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:39:48,395 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:39:48,395 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:48,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1899103037, now seen corresponding path program 8 times [2022-01-31 11:39:48,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:48,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367897752] [2022-01-31 11:39:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:48,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:48,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:39:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:39:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:48,987 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:39:48,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:39:48,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367897752] [2022-01-31 11:39:48,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367897752] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:39:49,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385441211] [2022-01-31 11:39:49,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:39:49,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:39:49,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:39:49,007 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:39:49,008 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:39:49,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:39:49,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:39:49,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:39:49,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:39:49,892 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:39:49,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:39:50,314 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:39:50,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385441211] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:50,314 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:39:50,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:39:50,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731488593] [2022-01-31 11:39:50,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:50,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:39:50,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:50,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:39:50,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:39:50,315 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:39:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:51,889 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-01-31 11:39:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:39:51,890 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:39:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:51,890 INFO L225 Difference]: With dead ends: 91 [2022-01-31 11:39:51,890 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 11:39:51,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 11:39:51,891 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 99 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:51,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 51 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 11:39:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 11:39:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2022-01-31 11:39:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 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:39:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-01-31 11:39:51,893 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 46 [2022-01-31 11:39:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:51,893 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-01-31 11:39:51,893 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:39:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-01-31 11:39:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 11:39:51,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:51,894 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:39:51,913 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:39:52,107 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:39:52,107 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:52,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1847163190, now seen corresponding path program 9 times [2022-01-31 11:39:52,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:52,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437919020] [2022-01-31 11:39:52,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:52,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:39:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:52,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:39:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:39:52,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:39:52,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437919020] [2022-01-31 11:39:52,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437919020] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:39:52,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254129190] [2022-01-31 11:39:52,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:39:52,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:39:52,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:39:52,768 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:39:52,770 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:39:52,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:39:52,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:39:52,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:39:52,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:39:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:39:53,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:39:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:39:54,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254129190] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:54,183 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:39:54,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:39:54,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042365710] [2022-01-31 11:39:54,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:54,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:39:54,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:54,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:39:54,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:39:54,184 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:39:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:56,274 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-01-31 11:39:56,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:39:56,275 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-01-31 11:39:56,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:56,275 INFO L225 Difference]: With dead ends: 55 [2022-01-31 11:39:56,275 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 11:39:56,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:39:56,276 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 83 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:56,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 62 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 11:39:56,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 11:39:56,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-01-31 11:39:56,278 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:39:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-01-31 11:39:56,279 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 46 [2022-01-31 11:39:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:56,279 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-01-31 11:39:56,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:39:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-01-31 11:39:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 11:39:56,279 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:56,279 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:39:56,298 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:39:56,488 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:39:56,488 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:56,489 INFO L85 PathProgramCache]: Analyzing trace with hash 981661415, now seen corresponding path program 10 times [2022-01-31 11:39:56,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:56,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466315676] [2022-01-31 11:39:56,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:56,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:40:06,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:40:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:40:06,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:40:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:40:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:40:06,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:40:06,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466315676] [2022-01-31 11:40:06,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466315676] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:40:06,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742879415] [2022-01-31 11:40:06,201 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:40:06,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:40:06,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:40:06,207 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:40:06,208 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:40:06,273 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:40:06,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:40:06,274 WARN L261 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 92 conjunts are in the unsatisfiable core [2022-01-31 11:40:06,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:40:06,332 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:40:06,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:06,616 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:40:06,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:06,976 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:40:07,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:07,394 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:40:07,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:07,729 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:40:09,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:09,459 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:40:10,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:10,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:10,645 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 53 treesize of output 39 [2022-01-31 11:40:12,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:12,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:12,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:12,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:12,142 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 64 treesize of output 53 [2022-01-31 11:40:13,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:13,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:13,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:13,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:13,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:13,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:13,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:13,555 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 63 treesize of output 59 [2022-01-31 11:40:14,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:14,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:14,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:14,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:14,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:14,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:14,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:14,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:40:14,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:14,792 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 69 treesize of output 65 [2022-01-31 11:40:15,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:15,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:15,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:15,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:15,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:15,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:15,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:15,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:15,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:15,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:15,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:40:15,849 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 74 treesize of output 68 [2022-01-31 11:40:16,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:16,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:16,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:16,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:16,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:16,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:16,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:16,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:16,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:16,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:40:16,968 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 77 treesize of output 71 [2022-01-31 11:40:18,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:18,012 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:40:18,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:40:18,660 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 43 treesize of output 19 [2022-01-31 11:40:19,498 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:40:19,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:40:44,816 WARN L228 SmtUtils]: Spent 6.67s on a formula simplification. DAG size of input: 792 DAG size of output: 323 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-31 11:40:44,818 INFO L353 Elim1Store]: treesize reduction 3907, result has 18.3 percent of original size [2022-01-31 11:40:44,821 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 10262562 treesize of output 2382882 [2022-01-31 11:40:53,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:40:53,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:40:53,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:40:53,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:40:53,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:40:53,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:40:53,224 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:40:53,318 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-31 11:40:53,378 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-31 11:40:53,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-01-31 11:40:53,578 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:53,579 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-31 11:40:53,583 INFO L158 Benchmark]: Toolchain (without parser) took 182714.93ms. Allocated memory was 250.6MB in the beginning and 590.3MB in the end (delta: 339.7MB). Free memory was 199.1MB in the beginning and 356.8MB in the end (delta: -157.7MB). Peak memory consumption was 339.2MB. Max. memory is 8.0GB. [2022-01-31 11:40:53,583 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 250.6MB. Free memory is still 215.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 11:40:53,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.76ms. Allocated memory is still 250.6MB. Free memory was 198.9MB in the beginning and 224.4MB in the end (delta: -25.5MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2022-01-31 11:40:53,583 INFO L158 Benchmark]: Boogie Preprocessor took 29.06ms. Allocated memory is still 250.6MB. Free memory was 224.4MB in the beginning and 222.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 11:40:53,584 INFO L158 Benchmark]: RCFGBuilder took 311.57ms. Allocated memory is still 250.6MB. Free memory was 222.7MB in the beginning and 210.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-31 11:40:53,584 INFO L158 Benchmark]: IcfgTransformer took 14.96ms. Allocated memory is still 250.6MB. Free memory was 210.8MB in the beginning and 209.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 11:40:53,584 INFO L158 Benchmark]: TraceAbstraction took 182124.45ms. Allocated memory was 250.6MB in the beginning and 590.3MB in the end (delta: 339.7MB). Free memory was 209.3MB in the beginning and 356.8MB in the end (delta: -147.5MB). Peak memory consumption was 348.4MB. Max. memory is 8.0GB. [2022-01-31 11:40:53,585 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 250.6MB. Free memory is still 215.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.76ms. Allocated memory is still 250.6MB. Free memory was 198.9MB in the beginning and 224.4MB in the end (delta: -25.5MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.06ms. Allocated memory is still 250.6MB. Free memory was 224.4MB in the beginning and 222.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 311.57ms. Allocated memory is still 250.6MB. Free memory was 222.7MB in the beginning and 210.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 14.96ms. Allocated memory is still 250.6MB. Free memory was 210.8MB in the beginning and 209.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 182124.45ms. Allocated memory was 250.6MB in the beginning and 590.3MB in the end (delta: 339.7MB). Free memory was 209.3MB in the beginning and 356.8MB in the end (delta: -147.5MB). Peak memory consumption was 348.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-31 11:40:53,811 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-01-31 11:40:53,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...