/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/s3lif.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:44:31,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:44:31,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:44:31,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:44:31,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:44:31,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:44:31,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:44:31,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:44:31,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:44:31,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:44:31,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:44:31,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:44:31,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:44:31,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:44:31,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:44:31,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:44:31,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:44:31,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:44:31,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:44:31,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:44:31,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:44:31,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:44:31,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:44:31,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:44:31,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:44:31,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:44:31,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:44:31,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:44:31,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:44:31,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:44:31,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:44:31,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:44:31,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:44:31,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:44:31,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:44:31,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:44:31,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:44:31,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:44:31,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:44:31,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:44:31,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:44:31,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:44:31,596 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:44:31,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:44:31,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:44:31,597 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:44:31,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:44:31,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:44:31,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:44:31,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:44:31,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:44:31,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:44:31,598 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:44:31,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:44:31,598 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:44:31,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:44:31,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:44:31,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:44:31,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:44:31,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:44:31,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:44:31,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:44:31,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:44:31,600 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:44:31,600 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:44:31,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:44:31,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:44:31,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:44:31,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:44:31,766 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:44:31,767 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s3lif.c [2022-01-31 11:44:31,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca4867082/dfb8c1dd400344a5b146020af99133ec/FLAG932b522b2 [2022-01-31 11:44:32,161 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:44:32,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s3lif.c [2022-01-31 11:44:32,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca4867082/dfb8c1dd400344a5b146020af99133ec/FLAG932b522b2 [2022-01-31 11:44:32,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca4867082/dfb8c1dd400344a5b146020af99133ec [2022-01-31 11:44:32,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:44:32,600 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:44:32,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:44:32,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:44:32,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:44:32,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:44:32" (1/1) ... [2022-01-31 11:44:32,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec101e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:32, skipping insertion in model container [2022-01-31 11:44:32,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:44:32" (1/1) ... [2022-01-31 11:44:32,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:44:32,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:44:32,706 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/s3lif.c[588,601] [2022-01-31 11:44:32,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:44:32,722 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:44:32,738 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/s3lif.c[588,601] [2022-01-31 11:44:32,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:44:32,780 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:44:32,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:32 WrapperNode [2022-01-31 11:44:32,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:44:32,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:44:32,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:44:32,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:44:32,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:32" (1/1) ... [2022-01-31 11:44:32,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:32" (1/1) ... [2022-01-31 11:44:32,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:32" (1/1) ... [2022-01-31 11:44:32,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:32" (1/1) ... [2022-01-31 11:44:32,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:32" (1/1) ... [2022-01-31 11:44:32,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:32" (1/1) ... [2022-01-31 11:44:32,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:32" (1/1) ... [2022-01-31 11:44:32,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:44:32,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:44:32,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:44:32,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:44:32,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:32" (1/1) ... [2022-01-31 11:44:32,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:44:32,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:32,834 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:44:32,838 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:44:32,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:44:32,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:44:32,861 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:44:32,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:44:32,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:44:32,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:44:32,861 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:44:32,861 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:44:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:44:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:44:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:44:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:44:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:44:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:44:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:44:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:44:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:44:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:44:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:44:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:44:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:44:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:44:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:44:32,907 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:44:32,908 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:44:33,034 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:44:33,038 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:44:33,038 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 11:44:33,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:44:33 BoogieIcfgContainer [2022-01-31 11:44:33,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:44:33,040 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:44:33,040 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:44:33,041 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:44:33,043 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:44:33" (1/1) ... [2022-01-31 11:44:33,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:44:33 BasicIcfg [2022-01-31 11:44:33,056 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:44:33,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:44:33,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:44:33,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:44:33,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:44:32" (1/4) ... [2022-01-31 11:44:33,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cec2431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:44:33, skipping insertion in model container [2022-01-31 11:44:33,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:32" (2/4) ... [2022-01-31 11:44:33,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cec2431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:44:33, skipping insertion in model container [2022-01-31 11:44:33,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:44:33" (3/4) ... [2022-01-31 11:44:33,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cec2431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:44:33, skipping insertion in model container [2022-01-31 11:44:33,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:44:33" (4/4) ... [2022-01-31 11:44:33,061 INFO L111 eAbstractionObserver]: Analyzing ICFG s3lif.cJordan [2022-01-31 11:44:33,079 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:44:33,079 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:44:33,109 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:44:33,127 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:44:33,127 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:44:33,151 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:44:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:44:33,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:33,157 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:44:33,158 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:33,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:33,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2015912082, now seen corresponding path program 1 times [2022-01-31 11:44:33,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:33,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691886963] [2022-01-31 11:44:33,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:33,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:33,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:33,375 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:44:33,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:33,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691886963] [2022-01-31 11:44:33,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691886963] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:44:33,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:44:33,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:44:33,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61975909] [2022-01-31 11:44:33,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:44:33,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:44:33,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:33,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:44:33,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:44:33,405 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:44:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:33,444 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-01-31 11:44:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:44:33,446 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:44:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:33,458 INFO L225 Difference]: With dead ends: 35 [2022-01-31 11:44:33,458 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 11:44:33,459 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:44:33,467 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:44:33,470 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:44:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 11:44:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-31 11:44:33,494 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:44:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-01-31 11:44:33,495 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2022-01-31 11:44:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:33,496 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-01-31 11:44:33,497 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:44:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-01-31 11:44:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:44:33,498 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:33,498 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:44:33,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:44:33,498 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1605612235, now seen corresponding path program 1 times [2022-01-31 11:44:33,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:33,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491185087] [2022-01-31 11:44:33,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:33,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:33,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:33,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:33,576 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:44:33,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:33,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491185087] [2022-01-31 11:44:33,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491185087] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:44:33,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:44:33,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:44:33,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461866011] [2022-01-31 11:44:33,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:44:33,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:44:33,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:33,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:44:33,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:44:33,579 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:44:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:33,671 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-01-31 11:44:33,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:44:33,672 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:44:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:33,673 INFO L225 Difference]: With dead ends: 35 [2022-01-31 11:44:33,673 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 11:44:33,673 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:44:33,674 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:33,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 25 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:44:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 11:44:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-01-31 11:44:33,677 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:44:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-01-31 11:44:33,678 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-01-31 11:44:33,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:33,678 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-01-31 11:44:33,678 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:44:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-01-31 11:44:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:44:33,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:33,679 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:44:33,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:44:33,680 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:33,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:33,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1735281572, now seen corresponding path program 1 times [2022-01-31 11:44:33,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:33,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587488245] [2022-01-31 11:44:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:33,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:34,115 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:44:34,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587488245] [2022-01-31 11:44:34,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587488245] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838783115] [2022-01-31 11:44:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:34,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:34,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:34,117 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:44:34,118 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:44:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:34,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 11:44:34,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:34,230 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:44:34,237 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:44:34,269 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:44:34,430 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:44:34,523 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:44:34,601 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 22 treesize of output 10 [2022-01-31 11:44:34,676 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:44:34,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:34,922 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:44:34,922 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:44:34,994 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:44:34,995 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:44:34,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:34,998 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:44:35,030 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:44:35,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838783115] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:35,031 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:44:35,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 33 [2022-01-31 11:44:35,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490555018] [2022-01-31 11:44:35,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:35,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 11:44:35,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:35,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 11:44:35,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 11:44:35,033 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 33 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 states have internal predecessors, (55), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:44:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:35,510 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-01-31 11:44:35,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:44:35,511 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 states have internal predecessors, (55), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-01-31 11:44:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:35,511 INFO L225 Difference]: With dead ends: 59 [2022-01-31 11:44:35,511 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 11:44:35,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=322, Invalid=1570, Unknown=0, NotChecked=0, Total=1892 [2022-01-31 11:44:35,513 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 47 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:35,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 96 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 375 Invalid, 0 Unknown, 7 Unchecked, 0.2s Time] [2022-01-31 11:44:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 11:44:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2022-01-31 11:44:35,516 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:44:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-01-31 11:44:35,517 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-01-31 11:44:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:35,517 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-01-31 11:44:35,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 states have internal predecessors, (55), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:44:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-01-31 11:44:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:44:35,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:35,518 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:44:35,538 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:44:35,731 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:44:35,732 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:35,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1606198853, now seen corresponding path program 1 times [2022-01-31 11:44:35,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:35,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426361842] [2022-01-31 11:44:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:35,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:35,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:35,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:35,857 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:44:35,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:35,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426361842] [2022-01-31 11:44:35,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426361842] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:35,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077107783] [2022-01-31 11:44:35,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:35,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:35,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:35,860 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:44:35,861 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:44:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:35,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 11:44:35,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:35,926 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:44:35,948 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:44:35,963 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:44:35,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:35,996 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:44:35,997 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:44:36,019 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:44:36,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077107783] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:36,019 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:44:36,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-01-31 11:44:36,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904937496] [2022-01-31 11:44:36,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:36,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 11:44:36,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:36,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 11:44:36,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 11:44:36,021 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:44:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:36,093 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-01-31 11:44:36,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 11:44:36,093 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:44:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:36,094 INFO L225 Difference]: With dead ends: 47 [2022-01-31 11:44:36,094 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 11:44:36,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-01-31 11:44:36,095 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:36,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 77 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:44:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 11:44:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-01-31 11:44:36,098 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:44:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-01-31 11:44:36,098 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 30 [2022-01-31 11:44:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:36,099 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-01-31 11:44:36,099 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:44:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-01-31 11:44:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:44:36,099 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:36,099 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:44:36,129 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:44:36,313 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:44:36,313 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:36,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1325106111, now seen corresponding path program 2 times [2022-01-31 11:44:36,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:36,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403673499] [2022-01-31 11:44:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:36,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:36,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:36,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:36,363 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:44:36,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:36,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403673499] [2022-01-31 11:44:36,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403673499] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:36,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137953074] [2022-01-31 11:44:36,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:44:36,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:36,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:36,365 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:44:36,366 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:44:36,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:44:36,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:44:36,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:44:36,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:36,477 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:44:36,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:36,522 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:44:36,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137953074] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:36,523 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:44:36,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:44:36,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040802718] [2022-01-31 11:44:36,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:36,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:44:36,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:36,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:44:36,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:44:36,524 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:44:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:36,645 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-01-31 11:44:36,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:44:36,646 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:44:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:36,647 INFO L225 Difference]: With dead ends: 63 [2022-01-31 11:44:36,647 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 11:44:36,648 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:44:36,648 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:36,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 65 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:44:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 11:44:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-01-31 11:44:36,652 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:44:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-31 11:44:36,652 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2022-01-31 11:44:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:36,652 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-31 11:44:36,653 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:44:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-31 11:44:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:44:36,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:36,653 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:44:36,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 11:44:36,875 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:44:36,875 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:36,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash -366582984, now seen corresponding path program 3 times [2022-01-31 11:44:36,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:36,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388932065] [2022-01-31 11:44:36,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:36,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:36,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:36,947 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:44:36,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:36,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388932065] [2022-01-31 11:44:36,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388932065] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:36,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145659880] [2022-01-31 11:44:36,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:44:36,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:36,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:36,958 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:44:36,965 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:44:37,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:44:37,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:44:37,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:44:37,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:37,087 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:44:37,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:37,160 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:44:37,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145659880] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:37,161 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:44:37,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:44:37,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490416461] [2022-01-31 11:44:37,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:37,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:44:37,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:37,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:44:37,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:44:37,162 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:44:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:37,304 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-01-31 11:44:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:44:37,305 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:44:37,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:37,305 INFO L225 Difference]: With dead ends: 41 [2022-01-31 11:44:37,305 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 11:44:37,305 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:44:37,306 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:37,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 62 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:44:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 11:44:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-01-31 11:44:37,308 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:44:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-01-31 11:44:37,309 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-01-31 11:44:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:37,309 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-01-31 11:44:37,309 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:44:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-01-31 11:44:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 11:44:37,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:37,310 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:44:37,330 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:44:37,526 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:44:37,527 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:37,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:37,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1933376935, now seen corresponding path program 4 times [2022-01-31 11:44:37,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:37,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590831060] [2022-01-31 11:44:37,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:37,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:38,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:38,423 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:44:38,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:38,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590831060] [2022-01-31 11:44:38,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590831060] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:38,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762102030] [2022-01-31 11:44:38,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:44:38,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:38,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:38,430 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:44:38,431 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:44:38,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:44:38,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:44:38,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-31 11:44:38,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:38,502 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:44:38,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:38,539 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:44:38,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:38,587 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:44:38,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:38,770 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:44:38,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:38,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:38,914 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:44:39,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:39,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:39,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:39,058 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:44:39,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:39,189 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:44:39,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:39,272 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 37 treesize of output 17 [2022-01-31 11:44:39,350 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:44:39,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:40,212 INFO L353 Elim1Store]: treesize reduction 52, result has 41.6 percent of original size [2022-01-31 11:44:40,213 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:44:40,280 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-31 11:44:40,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:40,305 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 77 treesize of output 63 [2022-01-31 11:44:40,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (+ c_main_~a~0.offset 4)) (.cse1 (select v_arrayElimArr_3 c_main_~a~0.offset))) (or (not (= (+ (select v_arrayElimArr_3 .cse0) (- 3)) 1)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_3))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) .cse0))) (and (<= (div (+ (- 1) .cse1 .cse2 .cse3) 4) c_main_~i~0) (<= (+ c_main_~i~0 1) (div (+ .cse1 .cse2 .cse3) 4))))))) (not (= (+ .cse1 (- 3)) 1))))) is different from false [2022-01-31 11:44:40,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse5 (+ c_main_~a~0.offset 4)) (.cse0 (select v_arrayElimArr_3 c_main_~a~0.offset))) (or (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_3))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse0 .cse2))) c_main_~a~0.base) .cse5))) (and (<= (+ c_main_~i~0 2) (div (+ .cse0 .cse1 .cse2) 4)) (<= (div (+ (- 1) .cse0 .cse1 .cse2) 4) (+ c_main_~i~0 1))))))) (not (= (+ (select v_arrayElimArr_3 .cse5) (- 3)) 1)) (not (= (+ .cse0 (- 3)) 1))))) is different from false [2022-01-31 11:44:40,512 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:44:40,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762102030] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:40,512 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:44:40,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 56 [2022-01-31 11:44:40,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396296774] [2022-01-31 11:44:40,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:40,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-31 11:44:40,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:40,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-31 11:44:40,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2524, Unknown=2, NotChecked=210, Total=3080 [2022-01-31 11:44:40,514 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:44:42,745 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) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse5 (+ c_main_~a~0.offset 4)) (.cse0 (select v_arrayElimArr_3 c_main_~a~0.offset))) (or (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_3))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse0 .cse2))) c_main_~a~0.base) .cse5))) (and (<= (+ c_main_~i~0 2) (div (+ .cse0 .cse1 .cse2) 4)) (<= (div (+ (- 1) .cse0 .cse1 .cse2) 4) (+ c_main_~i~0 1))))))) (not (= (+ (select v_arrayElimArr_3 .cse5) (- 3)) 1)) (not (= (+ .cse0 (- 3)) 1))))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (let ((.cse15 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse6 (select .cse15 c_main_~a~0.offset))) (let ((.cse14 (store .cse15 c_main_~a~0.offset (+ .cse6 3))) (.cse12 (+ c_main_~a~0.offset 4))) (let ((.cse7 (select .cse14 .cse12))) (or (not (= .cse6 1)) (not (= .cse7 1)) (< c_main_~i~0 c_~N~0) (= (let ((.cse13 (store .cse14 .cse12 (+ 3 .cse7)))) (let ((.cse10 (store |c_#memory_int| c_main_~a~0.base .cse13))) (let ((.cse11 (select .cse10 |c_main_~#sum~0.base|))) (let ((.cse8 (select .cse13 c_main_~a~0.offset)) (.cse9 (select .cse11 |c_main_~#sum~0.offset|))) (+ .cse8 .cse9 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse8 .cse9))) c_main_~a~0.base) .cse12)))))) (* c_~N~0 4)))))))) is different from false [2022-01-31 11:44:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:44,651 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-01-31 11:44:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 11:44:44,651 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:44:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:44,652 INFO L225 Difference]: With dead ends: 74 [2022-01-31 11:44:44,652 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 11:44:44,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=559, Invalid=3740, Unknown=3, NotChecked=390, Total=4692 [2022-01-31 11:44:44,654 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 58 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:44,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 200 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 929 Invalid, 0 Unknown, 114 Unchecked, 0.7s Time] [2022-01-31 11:44:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 11:44:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2022-01-31 11:44:44,657 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:44:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-01-31 11:44:44,657 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 37 [2022-01-31 11:44:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:44,657 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-01-31 11:44:44,658 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:44:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-01-31 11:44:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 11:44:44,658 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:44,658 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:44:44,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 11:44:44,859 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:44:44,859 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:44,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:44,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1856031736, now seen corresponding path program 1 times [2022-01-31 11:44:44,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:44,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477106487] [2022-01-31 11:44:44,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:44,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:45,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:45,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:45,025 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:44:45,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:45,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477106487] [2022-01-31 11:44:45,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477106487] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:45,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134426182] [2022-01-31 11:44:45,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:45,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:45,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:45,040 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:44:45,066 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:44:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:45,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 11:44:45,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:45,120 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:44:45,171 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:44:45,171 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:44:45,193 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:44:45,217 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:44:45,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:45,307 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:44:45,311 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:44:45,337 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:44:45,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134426182] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:45,338 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:44:45,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 19 [2022-01-31 11:44:45,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124120775] [2022-01-31 11:44:45,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:45,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 11:44:45,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:45,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 11:44:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:44:45,339 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:44:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:45,580 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-01-31 11:44:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:44:45,580 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:44:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:45,581 INFO L225 Difference]: With dead ends: 59 [2022-01-31 11:44:45,581 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 11:44:45,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-01-31 11:44:45,582 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:45,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 91 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:44:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 11:44:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-01-31 11:44:45,584 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:44:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-01-31 11:44:45,585 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 37 [2022-01-31 11:44:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:45,585 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-01-31 11:44:45,585 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:44:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-01-31 11:44:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:44:45,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:45,586 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:44:45,604 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:44:45,786 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:44:45,786 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:45,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:45,787 INFO L85 PathProgramCache]: Analyzing trace with hash -65976708, now seen corresponding path program 5 times [2022-01-31 11:44:45,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:45,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403808139] [2022-01-31 11:44:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:45,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:45,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:45,870 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:44:45,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:45,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403808139] [2022-01-31 11:44:45,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403808139] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:45,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224428037] [2022-01-31 11:44:45,871 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:44:45,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:45,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:45,895 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:44:45,907 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:44:45,962 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:44:45,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:44:45,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:44:45,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:46,064 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:44:46,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:46,132 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:44:46,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224428037] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:46,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:44:46,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:44:46,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905841068] [2022-01-31 11:44:46,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:46,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:44:46,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:46,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:44:46,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:44:46,134 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:44:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:46,276 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-01-31 11:44:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:44:46,277 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:44:46,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:46,277 INFO L225 Difference]: With dead ends: 77 [2022-01-31 11:44:46,277 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 11:44:46,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:44:46,278 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 70 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:46,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 56 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:44:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 11:44:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-01-31 11:44:46,281 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:44:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-01-31 11:44:46,281 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 39 [2022-01-31 11:44:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:46,281 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-01-31 11:44:46,282 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:44:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-01-31 11:44:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:44:46,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:46,282 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:44:46,304 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:44:46,495 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:44:46,496 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:46,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1588667389, now seen corresponding path program 6 times [2022-01-31 11:44:46,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:46,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934440220] [2022-01-31 11:44:46,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:46,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:46,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:46,575 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:44:46,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:46,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934440220] [2022-01-31 11:44:46,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934440220] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:46,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821485448] [2022-01-31 11:44:46,575 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:44:46,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:46,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:46,576 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:44:46,577 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:44:46,629 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:44:46,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:44:46,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:44:46,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:46,733 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:44:46,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:46,804 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:44:46,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821485448] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:46,804 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:44:46,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:44:46,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450928617] [2022-01-31 11:44:46,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:46,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:44:46,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:46,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:44:46,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:44:46,805 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:44:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:46,964 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-01-31 11:44:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:44:46,964 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:44:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:46,965 INFO L225 Difference]: With dead ends: 48 [2022-01-31 11:44:46,965 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 11:44:46,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 11:44:46,965 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 66 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:46,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 65 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:44:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 11:44:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-01-31 11:44:46,967 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:44:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-01-31 11:44:46,968 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 39 [2022-01-31 11:44:46,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:46,968 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-01-31 11:44:46,968 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:44:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-01-31 11:44:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:44:46,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:46,969 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:44:46,985 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:44:47,178 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:44:47,179 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:47,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash 347994970, now seen corresponding path program 7 times [2022-01-31 11:44:47,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:47,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708597896] [2022-01-31 11:44:47,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:47,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:48,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:48,352 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:44:48,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:48,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708597896] [2022-01-31 11:44:48,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708597896] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:48,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020146020] [2022-01-31 11:44:48,352 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:44:48,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:48,361 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:44:48,362 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:44:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:48,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 75 conjunts are in the unsatisfiable core [2022-01-31 11:44:48,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:48,450 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:44:48,455 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:44:48,467 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:44:48,487 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:44:48,588 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:44:48,810 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:44:48,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:48,959 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:44:49,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,122 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:44:49,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:49,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,273 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 60 treesize of output 53 [2022-01-31 11:44:49,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:49,404 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 64 treesize of output 51 [2022-01-31 11:44:49,544 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 58 treesize of output 47 [2022-01-31 11:44:49,644 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 58 treesize of output 26 [2022-01-31 11:44:49,723 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:44:49,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:52,459 INFO L353 Elim1Store]: treesize reduction 476, result has 26.2 percent of original size [2022-01-31 11:44:52,459 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 26108 treesize of output 8250 [2022-01-31 11:44:52,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,573 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 39 treesize of output 29 [2022-01-31 11:44:52,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,607 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 39 treesize of output 29 [2022-01-31 11:44:52,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,825 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 45 treesize of output 31 [2022-01-31 11:44:52,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,836 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 37 treesize of output 27 [2022-01-31 11:44:52,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,845 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 184 treesize of output 142 [2022-01-31 11:44:52,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:52,870 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 35 treesize of output 25 [2022-01-31 11:44:55,468 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int))) (let ((.cse1 (+ c_main_~a~0.offset 8)) (.cse2 (select v_arrayElimArr_10 c_main_~a~0.offset)) (.cse0 (+ c_main_~a~0.offset 4))) (or (not (= (+ (- 3) (select v_arrayElimArr_10 .cse0)) 1)) (not (= (select v_arrayElimArr_10 .cse1) 4)) (not (= (+ (- 3) .cse2) 1)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_10))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2))) c_main_~a~0.base) .cse0))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse2))) c_main_~a~0.base) .cse1))) (and (<= (+ c_main_~i~0 1) (div (+ .cse3 .cse4 .cse5 .cse2) 4)) (<= (div (+ (- 1) .cse3 .cse4 .cse5 .cse2) 4) c_main_~i~0)))))))))) is different from false [2022-01-31 11:44:58,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int))) (let ((.cse0 (+ c_main_~a~0.offset 4)) (.cse7 (+ c_main_~a~0.offset 8)) (.cse4 (select v_arrayElimArr_10 c_main_~a~0.offset))) (or (not (= (+ (- 3) (select v_arrayElimArr_10 .cse0)) 1)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_10))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse4))) c_main_~a~0.base) .cse0))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base) .cse7))) (and (<= (div (+ (- 1) .cse1 .cse2 .cse3 .cse4) 4) (+ c_main_~i~0 1)) (<= (+ c_main_~i~0 2) (div (+ .cse1 .cse2 .cse3 .cse4) 4)))))))) (not (= (select v_arrayElimArr_10 .cse7) 4)) (not (= (+ (- 3) .cse4) 1))))) is different from false [2022-01-31 11:45:02,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int))) (let ((.cse1 (+ c_main_~a~0.offset 8)) (.cse2 (select v_arrayElimArr_10 c_main_~a~0.offset)) (.cse0 (+ c_main_~a~0.offset 4))) (or (not (= (+ (- 3) (select v_arrayElimArr_10 .cse0)) 1)) (not (= (select v_arrayElimArr_10 .cse1) 4)) (not (= (+ (- 3) .cse2) 1)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_10))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2))) c_main_~a~0.base) .cse0))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse2))) c_main_~a~0.base) .cse1))) (and (<= (+ c_main_~i~0 3) (div (+ .cse3 .cse4 .cse5 .cse2) 4)) (<= (div (+ (- 1) .cse3 .cse4 .cse5 .cse2) 4) (+ c_main_~i~0 2))))))))))) is different from false [2022-01-31 11:45:03,016 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:45:03,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020146020] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:03,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:45:03,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 70 [2022-01-31 11:45:03,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184994671] [2022-01-31 11:45:03,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:03,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-01-31 11:45:03,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:03,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-01-31 11:45:03,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=3915, Unknown=3, NotChecked=396, Total=4830 [2022-01-31 11:45:03,019 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 70 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 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:46:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:46:56,885 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-01-31 11:46:56,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-01-31 11:46:56,886 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 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:46:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:46:56,887 INFO L225 Difference]: With dead ends: 94 [2022-01-31 11:46:56,887 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 11:46:56,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 104 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3497 ImplicationChecksByTransitivity, 117.1s TimeCoverageRelationStatistics Valid=1208, Invalid=9285, Unknown=25, NotChecked=612, Total=11130 [2022-01-31 11:46:56,890 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 97 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-01-31 11:46:56,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 234 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1365 Invalid, 0 Unknown, 199 Unchecked, 9.5s Time] [2022-01-31 11:46:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 11:46:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2022-01-31 11:46:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:46:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-01-31 11:46:56,894 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 44 [2022-01-31 11:46:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:46:56,894 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-01-31 11:46:56,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 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:46:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-01-31 11:46:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:46:56,895 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:46:56,895 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:46:56,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 11:46:57,108 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:46:57,109 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:46:57,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:46:57,109 INFO L85 PathProgramCache]: Analyzing trace with hash -162539207, now seen corresponding path program 2 times [2022-01-31 11:46:57,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:46:57,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772146417] [2022-01-31 11:46:57,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:46:57,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:46:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:46:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:46:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:46:58,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:46:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:46:58,564 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:46:58,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:46:58,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772146417] [2022-01-31 11:46:58,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772146417] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:46:58,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075740128] [2022-01-31 11:46:58,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:46:58,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:46:58,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:46:58,566 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:46:58,569 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:46:58,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:46:58,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:46:58,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:46:58,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:46:59,187 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:46:59,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:59,698 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:47:00,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:00,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 25 treesize of output 24 [2022-01-31 11:47:00,265 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:47:00,522 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:47:00,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:01,974 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:47:01,987 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:47:02,433 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:47:02,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075740128] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:02,433 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:47:02,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2022-01-31 11:47:02,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037361004] [2022-01-31 11:47:02,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:02,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:47:02,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:02,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:47:02,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2022-01-31 11:47:02,434 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:07,404 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2022-01-31 11:47:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:47:07,404 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:47:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:07,405 INFO L225 Difference]: With dead ends: 71 [2022-01-31 11:47:07,405 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 11:47:07,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=247, Invalid=1393, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 11:47:07,406 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 51 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:07,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 118 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-01-31 11:47:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 11:47:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-01-31 11:47:07,408 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:47:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-01-31 11:47:07,409 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 44 [2022-01-31 11:47:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:07,409 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-01-31 11:47:07,409 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:47:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-01-31 11:47:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 11:47:07,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:07,410 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:47:07,430 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:47:07,627 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:47:07,627 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:07,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1899103037, now seen corresponding path program 8 times [2022-01-31 11:47:07,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:07,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868534664] [2022-01-31 11:47:07,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:07,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:08,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:47:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:08,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:47:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:08,398 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:47:08,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:08,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868534664] [2022-01-31 11:47:08,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868534664] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:47:08,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108900299] [2022-01-31 11:47:08,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:47:08,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:08,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:08,399 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:47:08,400 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:47:08,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:47:08,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:08,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:47:08,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:09,546 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:47:09,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:10,105 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:47:10,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108900299] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:10,105 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:47:10,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:47:10,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798317002] [2022-01-31 11:47:10,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:10,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:47:10,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:10,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:47:10,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:47:10,106 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:47:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:11,908 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-01-31 11:47:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:47:11,908 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:47:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:11,909 INFO L225 Difference]: With dead ends: 82 [2022-01-31 11:47:11,909 INFO L226 Difference]: Without dead ends: 62 [2022-01-31 11:47:11,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 11:47:11,909 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 86 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:11,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 54 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 11:47:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-31 11:47:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-01-31 11:47:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:47:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-01-31 11:47:11,911 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 46 [2022-01-31 11:47:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:11,912 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-01-31 11:47:11,912 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:47:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-01-31 11:47:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 11:47:11,912 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:11,912 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:11,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:12,112 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:47:12,113 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:12,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2111057532, now seen corresponding path program 9 times [2022-01-31 11:47:12,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:12,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009564739] [2022-01-31 11:47:12,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:12,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:12,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:47:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:12,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:47:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:47:12,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:12,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009564739] [2022-01-31 11:47:12,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009564739] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:47:12,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587610143] [2022-01-31 11:47:12,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:47:12,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:12,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:12,916 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:47:12,917 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:47:12,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:47:12,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:12,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:47:12,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:47:14,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:47:14,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587610143] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:14,668 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:47:14,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:47:14,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281431025] [2022-01-31 11:47:14,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:14,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:47:14,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:47:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:47:14,669 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:17,130 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-01-31 11:47:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:47:17,131 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-01-31 11:47:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:17,131 INFO L225 Difference]: With dead ends: 55 [2022-01-31 11:47:17,131 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 11:47:17,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:47:17,132 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 84 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:17,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 70 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 11:47:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 11:47:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-01-31 11:47:17,134 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:47:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-01-31 11:47:17,134 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 49 [2022-01-31 11:47:17,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:17,134 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-01-31 11:47:17,134 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:47:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-01-31 11:47:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 11:47:17,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:17,135 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:47:17,153 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:47:17,343 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:47:17,343 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:17,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash 981661415, now seen corresponding path program 10 times [2022-01-31 11:47:17,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:17,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340427585] [2022-01-31 11:47:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:17,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:29,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:47:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:29,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:47:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:29,146 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:47:29,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:29,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340427585] [2022-01-31 11:47:29,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340427585] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:47:29,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822284665] [2022-01-31 11:47:29,147 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:47:29,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:29,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:29,148 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:47:29,149 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:47:29,213 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:47:29,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:29,214 WARN L261 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 92 conjunts are in the unsatisfiable core [2022-01-31 11:47:29,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:29,260 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:47:29,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:29,686 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:47:30,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:30,175 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:47:30,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:30,671 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:47:31,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:31,179 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:47:33,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:33,598 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:47:35,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:35,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:35,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-01-31 11:47:36,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:36,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:36,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:36,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:36,996 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 65 treesize of output 54 [2022-01-31 11:47:38,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:38,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:38,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:38,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:38,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:38,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:38,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:38,969 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 67 treesize of output 63 [2022-01-31 11:47:40,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:47:40,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,568 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 67 treesize of output 63 [2022-01-31 11:47:41,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:47:42,000 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 67 treesize of output 61 [2022-01-31 11:47:43,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:43,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:43,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:43,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:43,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:43,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:43,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:43,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:43,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:43,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:43,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:47:43,416 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 78 treesize of output 68 [2022-01-31 11:47:44,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:44,811 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:47:45,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:45,653 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 51 treesize of output 23 [2022-01-31 11:47:47,152 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:47:47,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:48:17,640 WARN L228 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 793 DAG size of output: 324 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-31 11:48:17,642 INFO L353 Elim1Store]: treesize reduction 3907, result has 18.3 percent of original size [2022-01-31 11:48:17,644 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 3722026 treesize of output 827428 [2022-01-31 11:48:21,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:48:21,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:48:21,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:48:21,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:48:21,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:48:21,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:48:21,047 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 159 treesize of output 109 [2022-01-31 11:48:21,846 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-31 11:48:21,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 11:48:22,061 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:48:22,061 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:48:22,067 INFO L158 Benchmark]: Toolchain (without parser) took 229466.77ms. Allocated memory was 166.7MB in the beginning and 494.9MB in the end (delta: 328.2MB). Free memory was 111.3MB in the beginning and 205.7MB in the end (delta: -94.4MB). Peak memory consumption was 237.9MB. Max. memory is 8.0GB. [2022-01-31 11:48:22,067 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 11:48:22,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.08ms. Allocated memory was 166.7MB in the beginning and 237.0MB in the end (delta: 70.3MB). Free memory was 111.1MB in the beginning and 212.4MB in the end (delta: -101.3MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-01-31 11:48:22,067 INFO L158 Benchmark]: Boogie Preprocessor took 29.00ms. Allocated memory is still 237.0MB. Free memory was 212.4MB in the beginning and 210.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 11:48:22,067 INFO L158 Benchmark]: RCFGBuilder took 228.96ms. Allocated memory is still 237.0MB. Free memory was 210.5MB in the beginning and 197.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-31 11:48:22,068 INFO L158 Benchmark]: IcfgTransformer took 15.48ms. Allocated memory is still 237.0MB. Free memory was 197.9MB in the beginning and 196.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 11:48:22,068 INFO L158 Benchmark]: TraceAbstraction took 229009.73ms. Allocated memory was 237.0MB in the beginning and 494.9MB in the end (delta: 257.9MB). Free memory was 195.8MB in the beginning and 205.7MB in the end (delta: -9.9MB). Peak memory consumption was 251.8MB. Max. memory is 8.0GB. [2022-01-31 11:48:22,072 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.09ms. Allocated memory is still 166.7MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.08ms. Allocated memory was 166.7MB in the beginning and 237.0MB in the end (delta: 70.3MB). Free memory was 111.1MB in the beginning and 212.4MB in the end (delta: -101.3MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.00ms. Allocated memory is still 237.0MB. Free memory was 212.4MB in the beginning and 210.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 228.96ms. Allocated memory is still 237.0MB. Free memory was 210.5MB in the beginning and 197.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 15.48ms. Allocated memory is still 237.0MB. Free memory was 197.9MB in the beginning and 196.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 229009.73ms. Allocated memory was 237.0MB in the beginning and 494.9MB in the end (delta: 257.9MB). Free memory was 195.8MB in the beginning and 205.7MB in the end (delta: -9.9MB). Peak memory consumption was 251.8MB. 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:48:22,281 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:48:22,326 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 0 Received shutdown request...